Alfred Menezes (ed.)

Advances in Cryptology - CRYPTO 2007

27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings
Herausgegeben:Menezes, Alfred

• Broschiertes Buch

Produktbeschreibung

This volume constitutes the refereed proceedings of the 27th Annual International Cryptology Conference held in Santa Barbara, California, in August 2007. Thirty-three full papers are presented along with one important invited lecture. The papers address current foundational, theoretical, and research aspects of cryptology, cryptography, and cryptanalysis. In addition, readers will discover many advanced and emerging applications.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 4622
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12104802, 978-3-540-74142-8
• 2007
• Seitenzahl: 648
• Erscheinungstermin: 23. August 2007
• Englisch
• Abmessung: 235mm x 155mm x 35mm
• Gewicht: 968g
• ISBN-13: 9783540741428
• ISBN-10: 3540741429
• Artikelnr.: 23036816

Inhaltsangabe

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.

Rezensionen

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)