Conferences in DBLP

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

1. Arjen K. Lenstra, Eric R. Verheul
   The XTR Public Key System. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:1-19 [Conf]
   
2. Éliane Jaulmes, Antoine Joux
   A Chosen-Ciphertext Attack against NTRU. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:20-35 [Conf]
   
3. Yehuda Lindell, Benny Pinkas
   Privacy Preserving Data Mining. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:36-54 [Conf]
   
4. Amos Beimel, Yuval Ishai, Tal Malkin
   Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:55-73 [Conf]
   
5. Yevgeniy Dodis, Silvio Micali
   Parallel Reducibility for Information-Theoretically Secure Computation. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:74-92 [Conf]
   
6. Christian Cachin, Jan Camenisch
   Optimistic Fair Secure Computation. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:93-111 [Conf]
   
7. Yevgeniy Dodis, Shai Halevi, Tal Rabin
   A Cryptographic Solution to a Game Theoretic Problem. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:112-130 [Conf]
   
8. Ingrid Biehl, Bernd Meyer, Volker Müller
   Differential Fault Attacks on Elliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:131-146 [Conf]
   
9. Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama
   Quantum Public-Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2000, pp:147-165 [Conf]
   
10. Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park
    New Public-Key Cryptosystem Using Braid Groups. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:166-183 [Conf]
    
11. Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell
    Key Recovery and Forgery Attacks on the MacDES MAC Algorithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:184-196 [Conf]
    
12. John Black, Phillip Rogaway
    CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:197-215 [Conf]
    
13. Michael Semanko
    L-collision Attacks against Randomized MACs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:216-228 [Conf]
    
14. Jean-Sébastien Coron
    On the Exact Security of Full Domain Hash. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:229-235 [Conf]
    
15. Dan Boneh, Moni Naor
    Timed Commitments. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:236-254 [Conf]
    
16. Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
    A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:255-270 [Conf]
    
17. Masayuki Abe, Tatsuaki Okamoto
    Provably Secure Partially Blind Signatures. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:271-286 [Conf]
    
18. Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth
    Weaknesses in the SL₂(IF_s²) Hashing Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:287-299 [Conf]
    
19. Thomas Johansson, Fredrik Jönsson
    Fast Correlation Attacks through Reconstruction of Linear Polynomials. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:300-315 [Conf]
    
20. Reihaneh Safavi-Naini, Yejing Wang
    Sequential Traitor Tracing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:316-332 [Conf]
    
21. Juan A. Garay, Jessica Staddon, Avishai Wool
    Long-Lived Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:333-352 [Conf]
    
22. Martín Abadi
    Taming the Adversary. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:353-358 [Conf]
    
23. Anand Desai
    The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:359-375 [Conf]
    
24. Zulfikar Ramzan, Leonid Reyzin
    On the Round Security of Symmetric-Key Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:376-393 [Conf]
    
25. Anand Desai
    New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:394-412 [Conf]
    
26. Marc Fischlin, Roger Fischlin
    Efficient Non-malleable Commitment Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:413-431 [Conf]
    
27. Ivan Damgård, Jesper Buus Nielsen
    Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:432-450 [Conf]
    
28. Alon Rosen
    A Note on the Round-Complexity of Concurrent Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:451-468 [Conf]
    
29. Rosario Gennaro
    An Improved Pseudo-random Generator Based on Discrete Log. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:469-481 [Conf]
    
30. Nicolas Gisin, Stefan Wolf
    Linking Classical and Quantum Key Agreement: Is There ``Bound Information''? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:482-500 [Conf]
    
31. Muxiang Zhang, Agnes Hui Chan
    Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:501-514 [Conf]
    
32. Palash Sarkar, Subhamoy Maitra
    Nonlinearity Bounds and Constructions of Resilient Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:515-532 [Conf]
    
33. Jürgen Bierbrauer, Holger Schellwat
    Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:533-544 [Conf]