The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Alex Biryukov, Christophe De Cannière, Michaël Quisquater
    On Multiple Linear Approximations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:1-22 [Conf]
  2. Nicolas Courtois
    Feistel Schemes and Bi-linear Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:23-40 [Conf]
  3. Dan Boneh, Xavier Boyen, Hovav Shacham
    Short Group Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:41-55 [Conf]
  4. Jan Camenisch, Anna Lysyanskaya
    Signature Schemes and Anonymous Credentials from Bilinear Maps. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:56-72 [Conf]
  5. Thomas Holenstein, Ueli M. Maurer, Johan Sjödin
    Complete Classification of Bilinear Hard-Core Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:73-91 [Conf]
  6. Chun-Yuan Hsiao, Leonid Reyzin
    Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:92-105 [Conf]
  7. Jacques Patarin
    Security of Random Feistel Schemes with 5 or More Rounds. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:106-122 [Conf]
  8. Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi
    Signed Binary Representations Revisited. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:123-139 [Conf]
  9. Michael Scott, Paulo S. L. M. Barreto
    Compressed Pairings. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:140-156 [Conf]
  10. Marten van Dijk, David P. Woodruff
    Asymptotically Optimal Communication for Torus-Based Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:157-178 [Conf]
  11. Craig Gentry
    How to Compress Rabin Ciphertexts and Signatures (and More). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:179-200 [Conf]
  12. Qi Cheng
    On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:201-212 [Conf]
  13. Alexander May
    Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:213-219 [Conf]
  14. Rosario Gennaro
    Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:220-236 [Conf]
  15. Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti
    Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:237-253 [Conf]
  16. Ivan Damgård, Serge Fehr, Louis Salvail
    Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:254-272 [Conf]
  17. Mihir Bellare, Adriana Palacio
    The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:273-289 [Conf]
  18. Eli Biham, Rafi Chen
    Near-Collisions of SHA-0. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:290-305 [Conf]
  19. Antoine Joux
    Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:306-316 [Conf]
  20. Masayuki Abe, Serge Fehr
    Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:317-334 [Conf]
  21. Jonathan Katz, Rafail Ostrovsky
    Round-Optimal Secure Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:335-354 [Conf]
  22. Susan Landau
    Security, Liberty, and Electronic Communications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:355-372 [Conf]
  23. Håvard Molland, Tor Helleseth
    An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:373-389 [Conf]
  24. Philip Hawkes, Gregory G. Rose
    Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:390-406 [Conf]
  25. Yi Lu 0002, Serge Vaudenay
    Faster Correlation Attack on Bluetooth Keystream Generator E0. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:407-425 [Conf]
  26. Kaoru Kurosawa, Yvo Desmedt
    A New Paradigm of Hybrid Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:426-442 [Conf]
  27. Dan Boneh, Xavier Boyen
    Secure Identity Based Encryption Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:443-459 [Conf]
  28. Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
    Non-interactive Timestamping in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:460-476 [Conf]
  29. Dario Catalano, David Pointcheval, Thomas Pornin
    IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:477-493 [Conf]
  30. Yevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk, Tal Rabin
    Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:494-510 [Conf]
  31. Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia
    Efficient Tree-Based Revocation in Groups of Low-State Devices. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:511-527 [Conf]
  32. Cynthia Dwork, Kobbi Nissim
    Privacy-Preserving Datamining on Vertically Partitioned Databases. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:528-544 [Conf]
  33. K. Srinathan, Arvind Narayanan, C. Pandu Rangan
    Optimal Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:545-561 [Conf]
  34. Matthias Fitzi, Stefan Wolf, Jürg Wullschleger
    Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:562-578 [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