Conferences in DBLP
Elad Barkan , Eli Biham , Adi Shamir Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:1-21 [Conf ] Iftach Haitner , Danny Harnik , Omer Reingold On the Power of the Randomized Iterate. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:22-40 [Conf ] Shai Halevi , Hugo Krawczyk Strengthening Digital Signatures Via Randomized Hashing. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:41-59 [Conf ] Marc Fischlin Round-Optimal Composable Blind Signatures in the Common Reference String Model. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:60-77 [Conf ] Melissa Chase , Anna Lysyanskaya On Signatures of Knowledge. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:78-96 [Conf ] Jens Groth , Rafail Ostrovsky , Amit Sahai Non-interactive Zaps and New Techniques for NIZK. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:97-111 [Conf ] Nicolas Gama , Nick Howgrave-Graham , Henrik Koy , Phong Q. Nguyen Rankin's Constant and Blockwise Lattice Reduction. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:112-130 [Conf ] Oded Regev Lattice-Based Cryptography. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:131-141 [Conf ] Craig Gentry , Philip D. MacKenzie , Zulfikar Ramzan A Method for Making Password-Based Key Exchange Resilient to Server Compromise. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:142-159 [Conf ] Ran Canetti , Shai Halevi , Michael Steiner Mitigating Dictionary Attacks on Password-Protected Local Storage. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:160-179 [Conf ] Anna Lysyanskaya , Nikos Triandopoulos Rationality and Adversarial Behavior in Multi-party Computation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:180-197 [Conf ] Kamalika Chaudhuri , Nina Mishra When Random Sampling Preserves Privacy. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:198-213 [Conf ] Moni Naor , Gil Segev , Adam Smith Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:214-231 [Conf ] Yevgeniy Dodis , Jonathan Katz , Leonid Reyzin , Adam Smith Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:232-250 [Conf ] Stefan Dziembowski On Forward-Secure Storage. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:251-270 [Conf ] Rafael Pass , Abhi Shelat , Vinod Vaikuntanathan Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:271-289 [Conf ] Xavier Boyen , Brent Waters Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:290-307 [Conf ] Zulfikar Ramzan , David P. Woodruff Fast Algorithms for the Free Riders Problem in Broadcast Encryption. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:308-325 [Conf ] Antoine Joux , Reynald Lercier , Nigel P. Smart , Frederik Vercauteren The Number Field Sieve in the Medium Prime Case. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:326-344 [Conf ] Louis Granboulan , Antoine Joux , Jacques Stern Inverting HFE Is Quasipolynomial. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:345-356 [Conf ] Jean-Charles Faugère , Ludovic Perret Cryptanalysis of 2R- Schemes. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:357-372 [Conf ] Tal Moran , Moni Naor Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:373-392 [Conf ] David Wagner Cryptographic Protocols for Electronic Voting. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:393- [Conf ] Saurabh Agarwal , Ronald Cramer , Robbert de Haan Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:394-408 [Conf ] Ronen Gradwohl , Salil P. Vadhan , David Zuckerman Random Selection with an Adversarial Majority. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:409-426 [Conf ] Ivan Damgård , Serge Fehr , Louis Salvail , Christian Schaffner Oblivious Transfer and Linear Functions. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:427-444 [Conf ] Jonathan Katz , Chiu-Yuen Koo On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:445-462 [Conf ] Martin Hirt , Jesper Buus Nielsen Robust Multiparty Computation with Linear Communication Complexity. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:463-482 [Conf ] Yuval Ishai , Eyal Kushilevitz , Yehuda Lindell , Erez Petrank On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:483-500 [Conf ] Ivan Damgård , Yuval Ishai Scalable Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:501-520 [Conf ] Hao Chen , Ronald Cramer Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:521-536 [Conf ] Bruno Blanchet , David Pointcheval Automated Security Proofs with Sequences of Games. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:537-554 [Conf ] Remo Meier , Bartosz Przydatek On Robust Combiners for Private Information Retrieval and Other Primitives. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:555-569 [Conf ] Dan Boneh , Xavier Boyen On the Impossibility of Efficiently Combining Collision Resistant Hash Functions. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:570-583 [Conf ] Claude Carlet On the Higher Order Nonlinearities of Algebraic Immune Functions. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:584-601 [Conf ] Mihir Bellare New Proofs for. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:602-619 [Conf ]