Cryptographers' World
 

CRYPTO 2006


[Sort by page number] [Sort by citations count]

 
Cynthia Dwork, editor, Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings. Springer, 2006. ISBN 3-540-37432-9.
[Papers]

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.



Elad Barkan,  Eli Biham,  Adi Shamir,  Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs, pp. 1 - 21, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 25 times ]

Iftach Haitner,  Danny Harnik,  Omer Reingold,  On the Power of the Randomized Iterate, pp. 22 - 40, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 26 times ]

Shai Halevi,  Hugo Krawczyk,  Strengthening Digital Signatures Via Randomized Hashing, pp. 41 - 59, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 95 times Red Star]

Marc Fischlin,  Round-Optimal Composable Blind Signatures in the Common Reference String Model, pp. 60 - 77, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 29 times ]

Melissa Chase,  Anna Lysyanskaya,  On Signatures of Knowledge, pp. 78 - 96, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 35 times ]

Jens Groth,  Rafail Ostrovsky,  Amit Sahai,  Non-interactive Zaps and New Techniques for NIZK, pp. 97 - 111, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 35 times ]

Nicolas Gama,  Nick Howgrave-Graham,  Henrik Koy,  Phong Q. Nguyen,  Rankin's Constant and Blockwise Lattice Reduction, pp. 112 - 130, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 41 times ]

Oded Regev,  Lattice-Based Cryptography, pp. 131 - 141, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 27 times ]

Craig Gentry,  Philip D. MacKenzie,  Zulfikar Ramzan,  A Method for Making Password-Based Key Exchange Resilient to Server Compromise, pp. 142 - 159, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 14 times ]

Ran Canetti,  Shai Halevi,  Michael Steiner,  Mitigating Dictionary Attacks on Password-Protected Local Storage, pp. 160 - 179, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 15 times ]

Anna Lysyanskaya,  Nikos Triandopoulos,  Rationality and Adversarial Behavior in Multi-party Computation, pp. 180 - 197, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 36 times ]

Kamalika Chaudhuri,  Nina Mishra,  When Random Sampling Preserves Privacy, pp. 198 - 213, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 10 times ]

Moni Naor,  Gil Segev,  Adam Smith,  Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models, pp. 214 - 231, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 20 times ]

Yevgeniy Dodis,  Jonathan Katz,  Leonid Reyzin,  Adam Smith,  Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets, pp. 232 - 250, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 48 times ]

Stefan Dziembowski,  On Forward-Secure Storage, pp. 251 - 270, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 19 times ]

Rafael Pass,  Abhi Shelat,  Vinod Vaikuntanathan,  Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One, pp. 271 - 289, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 25 times ]

Xavier Boyen,  Brent Waters,  Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles), pp. 290 - 307, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 136 times Red StarRed Star]

Zulfikar Ramzan,  David P. Woodruff,  Fast Algorithms for the Free Riders Problem in Broadcast Encryption, pp. 308 - 325, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 3 times ]

Antoine Joux,  Reynald Lercier,  Nigel P. Smart,  Frederik Vercauteren,  The Number Field Sieve in the Medium Prime Case, pp. 326 - 344, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 19 times ]

Louis Granboulan,  Antoine Joux,  Jacques Stern,  Inverting HFE Is Quasipolynomial, pp. 345 - 356, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 24 times ]

Jean-Charles Faugère,  Ludovic Perret,  Cryptanalysis of 2R-schemes, pp. 357 - 372, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 11 times ]

Tal Moran,  Moni Naor,  Receipt-Free Universally-Verifiable Voting with Everlasting Privacy, pp. 373 - 392, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 63 times Red Star]

David Wagner,  Cryptographic Protocols for Electronic Voting, pp. 393 - 393, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 1 times ]

Saurabh Agarwal,  Ronald Cramer,  Robbert de Haan,  Asymptotically Optimal Two-Round Perfectly Secure Message Transmission, pp. 394 - 408, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 32 times ]

Ronen Gradwohl,  Salil P. Vadhan,  David Zuckerman,  Random Selection with an Adversarial Majority, pp. 409 - 426, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 17 times ]

Ivan Damgard,  Serge Fehr,  Louis Salvail,  Christian Schaffner,  Oblivious Transfer and Linear Functions, pp. 427 - 444, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 10 times ]

Jonathan Katz,  Chiu-Yuen Koo,  On Expected Constant-Round Protocols for Byzantine Agreement, pp. 445 - 462, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 33 times ]

Martin Hirt,  Jesper Buus Nielsen,  Robust Multiparty Computation with Linear Communication Complexity, pp. 463 - 482, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 18 times ]

Yuval Ishai,  Eyal Kushilevitz,  Yehuda Lindell,  Erez Petrank,  On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation, pp. 483 - 500, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 17 times ]

Ivan Damgard,  Yuval Ishai,  Scalable Secure Multiparty Computation, pp. 501 - 520, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 15 times ]

Hao Chen,  Ronald Cramer,  Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields, pp. 521 - 536, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 27 times ]

Bruno Blanchet,  David Pointcheval,  Automated Security Proofs with Sequences of Games, pp. 537 - 554, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 61 times Red Star]

Remo Meier,  Bartosz Przydatek,  On Robust Combiners for Private Information Retrieval and Other Primitives, pp. 555 - 569, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 22 times ]

Dan Boneh,  Xavier Boyen,  On the Impossibility of Efficiently Combining Collision Resistant Hash Functions, pp. 570 - 583, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 19 times ]

Claude Carlet,  On the Higher Order Nonlinearities of Algebraic Immune Functions, pp. 584 - 601, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 23 times ]

Mihir Bellare,  New Proofs for NMAC and HMAC: Security Without Collision-Resistance, pp. 602 - 619, CRYPTO 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 118 times Red StarRed Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...