The SCEAS System
Navigation Menu

Conferences in DBLP

International Crytology Conference (CRYPTO) (crypto)
2006 (conf/crypto/2006)

  1. Elad Barkan, Eli Biham, Adi Shamir
    Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:1-21 [Conf]
  2. Iftach Haitner, Danny Harnik, Omer Reingold
    On the Power of the Randomized Iterate. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:22-40 [Conf]
  3. Shai Halevi, Hugo Krawczyk
    Strengthening Digital Signatures Via Randomized Hashing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:41-59 [Conf]
  4. Marc Fischlin
    Round-Optimal Composable Blind Signatures in the Common Reference String Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:60-77 [Conf]
  5. Melissa Chase, Anna Lysyanskaya
    On Signatures of Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:78-96 [Conf]
  6. 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]
  7. 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]
  8. Oded Regev
    Lattice-Based Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:131-141 [Conf]
  9. 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]
  10. 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]
  11. Anna Lysyanskaya, Nikos Triandopoulos
    Rationality and Adversarial Behavior in Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:180-197 [Conf]
  12. Kamalika Chaudhuri, Nina Mishra
    When Random Sampling Preserves Privacy. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:198-213 [Conf]
  13. 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]
  14. 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]
  15. Stefan Dziembowski
    On Forward-Secure Storage. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:251-270 [Conf]
  16. 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]
  17. Xavier Boyen, Brent Waters
    Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:290-307 [Conf]
  18. 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]
  19. 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]
  20. Louis Granboulan, Antoine Joux, Jacques Stern
    Inverting HFE Is Quasipolynomial. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:345-356 [Conf]
  21. Jean-Charles Faugère, Ludovic Perret
    Cryptanalysis of 2R- Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:357-372 [Conf]
  22. Tal Moran, Moni Naor
    Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:373-392 [Conf]
  23. David Wagner
    Cryptographic Protocols for Electronic Voting. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:393- [Conf]
  24. 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]
  25. Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
    Random Selection with an Adversarial Majority. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:409-426 [Conf]
  26. 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]
  27. Jonathan Katz, Chiu-Yuen Koo
    On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:445-462 [Conf]
  28. Martin Hirt, Jesper Buus Nielsen
    Robust Multiparty Computation with Linear Communication Complexity. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:463-482 [Conf]
  29. 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]
  30. Ivan Damgård, Yuval Ishai
    Scalable Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:501-520 [Conf]
  31. 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]
  32. Bruno Blanchet, David Pointcheval
    Automated Security Proofs with Sequences of Games. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:537-554 [Conf]
  33. 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]
  34. 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]
  35. Claude Carlet
    On the Higher Order Nonlinearities of Algebraic Immune Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:584-601 [Conf]
  36. Mihir Bellare
    New Proofs for. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:602-619 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002