Advances in Cryptology - CRYPTO 2009
Springer Berlin (Verlag)
978-3-642-03355-1 (ISBN)
Key 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.
| Erscheint lt. Verlag | 28.7.2009 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XIV, 692 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 978 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | AES-256 • Algebra • authentication • birthday attack • Complexity • Cryptanalysis • cryptography • finite field • Hardcover, Softcover / Informatik, EDV/Informatik • IACR • lattice • MD5 • Public Key • quantum encryption • rsa • SHA-0 • SHA-1 • Signatures • Zero-knowledge |
| ISBN-10 | 3-642-03355-5 / 3642033555 |
| ISBN-13 | 978-3-642-03355-1 / 9783642033551 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
