The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern
    Practical Cryptanalysis of SFLASH. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:1-12 [Conf]
  2. Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen
    Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:13-30 [Conf]
  3. Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
    How Should We Solve Search Problems Privately? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:31-49 [Conf]
  4. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III
    Public Key Encryption That Allows PIR Queries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:50-67 [Conf]
  5. Ross Anderson, Tyler Moore
    Information Security Economics - and Beyond. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:68-91 [Conf]
  6. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography with Constant Input Locality. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:92-110 [Conf]
  7. Omer Horvitz, Jonathan Katz
    Universally-Composable Two-Party Computation in Two Rounds. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:111-129 [Conf]
  8. Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
    Indistinguishability Amplification. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:130-149 [Conf]
  9. Nick Howgrave-Graham
    A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:150-169 [Conf]
  10. Guillaume Hanrot, Damien Stehlé
    Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:170-186 [Conf]
  11. Ueli M. Maurer, Stefano Tessaro
    Domain Extension of Public Random Functions: Beyond the Birthday Barrier. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:187-204 [Conf]
  12. Dominique Unruh
    Random Oracles and Auxiliary Input. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:205-223 [Conf]
  13. Marc Fischlin, Anja Lehmann
    Security-Amplifying Combiners for Collision-Resistant Hash Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:224-243 [Conf]
  14. Antoine Joux, Thomas Peyrin
    Hash Functions and the (Amplified) Boomerang Attack. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:244-263 [Conf]
  15. Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
    Amplifying Collision Resistance: A Complexity-Theoretic Treatment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:264-283 [Conf]
  16. Danny Harnik, Yuval Ishai, Eyal Kushilevitz
    How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:284-302 [Conf]
  17. Melissa Chase, Anna Lysyanskaya
    Simulatable VRFs with Applications to Multi-theorem NIZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:303-322 [Conf]
  18. Jens Groth, Rafail Ostrovsky
    Cryptography in the Multi-string Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:323-341 [Conf]
  19. Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner
    Secure Identification and QKD in the Bounded-Quantum-Storage Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:342-359 [Conf]
  20. Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner
    A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:360-378 [Conf]
  21. Jean-Sébastien Coron
    Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:379-394 [Conf]
  22. Ellen Jochemsz, Alexander May
    A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:395-411 [Conf]
  23. Shai Halevi
    Invertible Universal Hashing and the TET Encryption Mode. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:412-429 [Conf]
  24. Vipul Goyal
    Reducing Trust in the PKG in Identity Based Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:430-447 [Conf]
  25. Aggelos Kiayias, Serdar Pehlivanoglu
    Pirate Evolution: How to Make the Most of Your Traitor Keys. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:448-465 [Conf]
  26. Daniel R. L. Brown, Kristian Gjøsteen
    A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:466-481 [Conf]
  27. Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi
    A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:482-499 [Conf]
  28. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
    Chernoff-Type Direct Product Theorems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:500-516 [Conf]
  29. Manoj Prabhakaran, Mike Rosulek
    Rerandomizable RCCA Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:517-534 [Conf]
  30. Mihir Bellare, Alexandra Boldyreva, Adam O'Neill
    Deterministic and Efficiently Searchable Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:535-552 [Conf]
  31. Dennis Hofheinz, Eike Kiltz
    Secure Hybrid Encryption from Weakened Key Encapsulation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:553-571 [Conf]
  32. Ivan Damgård, Jesper Buus Nielsen
    Scalable and Unconditionally Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:572-590 [Conf]
  33. Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang
    On Secure Multi-party Computation in Black-Box Groups. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:591-612 [Conf]
  34. Ronald Cramer, Eike Kiltz, Carles Padró
    A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:613-630 [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