000			04746nam a22006615i 4500
001			978-3-540-32732-5
003			DE-He213
005			20240730174404.0
007			cr nn 008mamaa
008			100715s2006 gw | s |||| 0|eng d
020			_a9783540327325 _9978-3-540-32732-5
024	7		_a10.1007/11681878 _2doi
050		4	_aQA268
072		7	_aGPJ _2bicssc
072		7	_aURY _2bicssc
072		7	_aCOM083000 _2bisacsh
072		7	_aGPJ _2thema
072		7	_aURY _2thema
082	0	4	_a005.824 _223
245	1	0	_aTheory of Cryptography _h[electronic resource] : _bThird Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings / _cedited by Shai Halevi, Tal Rabin.
250			_a1st ed. 2006.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006.
300			_aXII, 620 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSecurity and Cryptology, _x2946-1863 ; _v3876
505	0		_aZero-Knowledge -- Concurrent Zero Knowledge Without Complexity Assumptions -- Interactive Zero-Knowledge with Restricted Random Oracles -- Non-interactive Zero-Knowledge from Homomorphic Encryption -- Primitives -- Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles -- Efficient Blind and Partially Blind Signatures Without Random Oracles -- Key Exchange Using Passwords and Long Keys -- Mercurial Commitments: Minimal Assumptions and Efficient Constructions -- Assumptions and Models -- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices -- On Error Correction in the Exponent -- On the Relation Between the Ideal Cipher and the Random Oracle Models -- The Bounded-Retrieval Model -- Intrusion-Resilience Via the Bounded-Storage Model -- Perfectly Secure Password Protocols in the Bounded Retrieval Model -- Privacy -- Polylogarithmic Private Approximations and Efficient Matching -- Calibrating Noise to Sensitivity in Private Data Analysis -- Secret Sharing and Multi-party Computation (I) -- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation -- Efficient Multi-party Computation with Dispute Control -- Round-Optimal and Efficient Verifiable Secret Sharing -- Universally-Composible Security -- Generalized Environmental Security from Number Theoretic Assumptions -- Games and the Impossibility of Realizable Ideal Functionality -- Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols -- Resource Fairness and Composability of Cryptographic Protocols -- One-Way Functions and Friends -- Finding Pessiland -- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness -- On the Complexity of Parallel Hardness Amplification for One-Way Functions -- Secret Sharing and Multi-party Computation (II) -- On Matroids and Non-ideal Secret Sharing -- Secure Computation with Partial Message Loss -- Communication Efficient Secure Linear Algebra -- Threshold and Proactive Pseudo-Random Permutations -- Pseudo-Random Functions and Encryption -- PRF Domain Extension Using DAGs -- Chosen-Ciphertext Security from Tag-Based Encryption -- Separating Sources for Encryption and Secret Sharing.
650		0	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aAlgorithms. _93390
650		0	_aComputer science _xMathematics. _93866
650		0	_aDiscrete mathematics. _912873
650		0	_aOperating systems (Computers). _95329
650		0	_aElectronic data processing _xManagement. _9112304
650		0	_aComputers and civilization. _921733
650	1	4	_aCryptology. _931769
650	2	4	_aAlgorithms. _93390
650	2	4	_aDiscrete Mathematics in Computer Science. _931837
650	2	4	_aOperating Systems. _937074
650	2	4	_aIT Operations. _931703
650	2	4	_aComputers and Society. _931668
700	1		_aHalevi, Shai. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9112305
700	1		_aRabin, Tal. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9112306
710	2		_aSpringerLink (Online service) _9112307
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540327318
776	0	8	_iPrinted edition: _z9783540821243
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v3876 _9112308
856	4	0	_uhttps://doi.org/10.1007/11681878
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c89406 _d89406