000			06153nam a22006735i 4500
001			978-3-642-03356-8
003			DE-He213
005			20240423130217.0
007			cr nn 008mamaa
008			100301s2009 gw | s |||| 0|eng d
020			_a9783642033568 _9978-3-642-03356-8
024	7		_a10.1007/978-3-642-03356-8 _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	_aAdvances in Cryptology - CRYPTO 2009 _h[electronic resource] : _b29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009, Proceedings / _cedited by Shai Halevi.
250			_a1st ed. 2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009.
300			_aXIV, 692 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 ; _v5677
505	0		_aKey Leakage -- Reconstructing RSA Private Keys from Random Key Bits -- Public-Key Cryptosystems Resilient to Key Leakage -- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model -- Hash-Function Cryptanalysis -- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate -- Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 -- Privacy and Anonymity -- Private Mutual Authentication and Conditional Oblivious Transfer -- Randomizable Proofs and Delegatable Anonymous Credentials -- Computational Differential Privacy -- Interactive Proofs and Zero-Knowledge -- Probabilistically Checkable Arguments -- On the Composition of Public-Coin Zero-Knowledge Protocols -- On the Amortized Complexity of Zero-Knowledge Protocols -- Linear Algebra with Sub-linear Zero-Knowledge Arguments -- Block-Cipher Cryptanalysis -- New Birthday Attacks on Some MACs Based on Block Ciphers -- Distinguisher and Related-Key Attack on the Full AES-256 -- Cryptanalysis of C2 -- Modes of Operation -- Message Authentication Codes from Unpredictable Block Ciphers -- How to Encipher Messages on a Small Domain -- Elliptic Curves -- How to Hash into Elliptic Curves -- Batch Binary Edwards -- Cryptographic Hardness -- Solving Hidden Number Problem with One Bit Oracle and Advice -- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition -- Merkle Puzzles -- Merkle Puzzles Are Optimal — An O(n 2)-Query Attack on Any Key Exchange from a Random Oracle -- Cryptography in the Physical World -- Position Based Cryptography -- Improving the Security of Quantum Protocols via Commit-and-Open -- Attacks on Signature Schemes -- Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures -- How Risky Is the Random-Oracle Model? -- Invited Talk -- Abstraction inCryptography -- Secret Sharing and Secure Computation -- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field -- The Round Complexity of Verifiable Secret Sharing Revisited -- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer -- Cryptography and Game-Theory -- Collusion-Free Multiparty Computation in the Mediated Model -- Privacy-Enhancing Auctions Using Rational Cryptography -- Utility Dependence in Correct and Fair Rational Secret Sharing -- Cryptography and Lattices -- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem -- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems -- Identity-Based Encryption -- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions -- Cryptographers’ Toolbox -- The Group of Signed Quadratic Residues and Applications -- Short and Stateless Signatures from the RSA Assumption -- Smooth Projective Hashing for Conditionally Extractable Commitments.
520			_aThis book constitutes the refereed proceedings of the 29th Annual International Cryptology Conference, CRYPTO 2009, held in Santa Barbara, CA, USA in August 2009. The 38 revised full papers presented were carefully reviewed and selected from 213 submissions. Addressing all current foundational, theoretical and research aspects of cryptology, cryptography, and cryptanalysis as well as advanced applications, the papers are organized in topical sections on key leakage, hash-function cryptanalysis, privacy and anonymity, interactive proofs and zero-knowledge, block-cipher cryptanalysis, modes of operation, elliptic curves, cryptographic hardness, merkle puzzles, cryptography in the physical world, attacks on signature schemes, secret sharing and secure computation, cryptography and game-theory, cryptography and lattices, identity-based encryption and cryptographers’ toolbox.
650		0	_aCryptography.
650		0	_aData encryption (Computer science).
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aAlgebra.
650		0	_aCoding theory.
650		0	_aData protection.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650	1	4	_aCryptology.
650	2	4	_aData Structures and Information Theory.
650	2	4	_aAlgebra.
650	2	4	_aCoding and Information Theory.
650	2	4	_aData and Information Security.
650	2	4	_aDiscrete Mathematics in Computer Science.
700	1		_aHalevi, Shai. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642033551
776	0	8	_iPrinted edition: _z9783642033575
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v5677
856	4	0	_uhttps://doi.org/10.1007/978-3-642-03356-8
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c186221 _d186221