Advances in Cryptology - CRYPTO 2007
Springer Berlin (Verlag)
978-3-540-74142-8 (ISBN)
Cryptanalysis I.- Practical Cryptanalysis of SFLASH.- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5.- Secure Searching.- How Should We Solve Search Problems Privately?.- Public Key Encryption That Allows PIR Queries.- Invited Talk.- Information Security Economics - and Beyond.- Theory I.- Cryptography with Constant Input Locality.- Universally-Composable Two-Party Computation in Two Rounds.- Indistinguishability Amplification.- Lattices.- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU.- Improved Analysis of Kannan's Shortest Lattice Vector Algorithm.- Random Oracles.- Domain Extension of Public Random Functions: Beyond the Birthday Barrier.- Random Oracles and Auxiliary Input.- Hash Functions.- Security-Amplifying Combiners for Collision-Resistant Hash Functions.- Hash Functions and the (Amplified) Boomerang Attack.- Amplifying Collision Resistance: A Complexity-Theoretic Treatment.- Theory II.- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?.- Simulatable VRFs with Applications to Multi-theorem NIZK.- Cryptography in the Multi-string Model.- Quantum Cryptography.- Secure Identification and QKD in the Bounded-Quantum-Storage Model.- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications.- Cryptanalysis II.- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach.- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.- Encryption.- Invertible Universal Hashing and the TET Encryption Mode.- Reducing Trust in the PKG in Identity Based Cryptosystems.- Pirate Evolution: How to Make the Most of Your Traitor Keys.- Protocol Analysis.- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.- A Generalization of DDHwith Applications to Protocol Analysis and Computational Soundness.- Chernoff-Type Direct Product Theorems.- Public-Key Encryption.- Rerandomizable RCCA Encryption.- Deterministic and Efficiently Searchable Encryption.- Secure Hybrid Encryption from Weakened Key Encapsulation.- Multi-party Computation.- Scalable and Unconditionally Secure Multiparty Computation.- On Secure Multi-party Computation in Black-Box Groups.- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
lt;p>Aus den Rezensionen:
"... Für den mathematisch weniger (Ieid)geprüften Leser bieten Anderson und Moore im längsten Text des Kompendiums eine Abhandlung über die wirtschaftlichen Zusammenhänge, die der Informationssicherheit zugrunde liegen - und das ohne eine einzige Formel, dafür aber mit knapp fünf Seiten Anhang, 108 Referenzen enthaltend. Ein Buch für Fachleute - aber denen hat CRYPTO 2007 eine Menge Erhellendes zu bieten." (Tobias Engler, in: c't - magazin für computer technik, 2008, Issue 9, S. 210)
| Erscheint lt. Verlag | 23.8.2007 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XIV, 634 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 965 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | Algebraic Geometry • algorithms • authentication • broadcast encryption • Calculus • collision resistance • complexity analysis • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • Cryptosystems • Database Security • data encryption • Data Security • differential path • Digital Signatures • group computation • Hardcover, Softcover / Informatik, EDV/Informatik • hash function • HC/Informatik, EDV/Informatik • Information • MD5 • multiparty computation • privacy • Public Key Cryptography • rsa • searchable encryption • security • SHA |
| ISBN-10 | 3-540-74142-9 / 3540741429 |
| ISBN-13 | 978-3-540-74142-8 / 9783540741428 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
