CRYPTO A*

34 papers

YearTitle / Authors
2000A Chosen-Ciphertext Attack against NTRU.
Éliane Jaulmes, Antoine Joux
2000A Cryptographic Solution to a Game Theoretic Problem.
Yevgeniy Dodis, Shai Halevi, Tal Rabin
2000A Note on the Round-Complexity of Concurrent Zero-Knowledge.
Alon Rosen
2000A Practical and Provably Secure Coalition-Resistant Group Signature Scheme.
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
2000Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings
Mihir Bellare
2000Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications.
Jürgen Bierbrauer, Holger Schellwat
2000An Improved Pseudo-random Generator Based on Discrete Log.
Rosario Gennaro
2000CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions.
John Black, Phillip Rogaway
2000Differential Fault Attacks on Elliptic Curve Cryptosystems.
Ingrid Biehl, Bernd Meyer, Volker Müller
2000Efficient Non-malleable Commitment Schemes.
Marc Fischlin, Roger Fischlin
2000Fast Correlation Attacks through Reconstruction of Linear Polynomials.
Thomas Johansson, Fredrik Jönsson
2000Improved Non-committing Encryption Schemes Based on a General Complexity Assumption.
Ivan Damgård, Jesper Buus Nielsen
2000Key Recovery and Forgery Attacks on the MacDES MAC Algorithm.
Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell
2000L-collision Attacks against Randomized MACs.
Michael Semanko
2000Linking Classical and Quantum Key Agreement: Is There "Bound Information"?
Nicolas Gisin, Stefan Wolf
2000Long-Lived Broadcast Encryption.
Juan A. Garay, Jessica Staddon, Avishai Wool
2000Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers.
Muxiang Zhang, Agnes Hui Chan
2000New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack.
Anand Desai
2000New Public-Key Cryptosystem Using Braid Groups.
Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park
2000Nonlinearity Bounds and Constructions of Resilient Boolean Functions.
Palash Sarkar, Subhamoy Maitra
2000On the Exact Security of Full Domain Hash.
Jean-Sébastien Coron
2000On the Round Security of Symmetric-Key Cryptographic Primitives.
Zulfikar Ramzan, Leonid Reyzin
2000Optimistic Fair Secure Computation.
Christian Cachin, Jan Camenisch
2000Parallel Reducibility for Information-Theoretically Secure Computation.
Yevgeniy Dodis, Silvio Micali
2000Privacy Preserving Data Mining.
Yehuda Lindell, Benny Pinkas
2000Provably Secure Partially Blind Signatures.
Masayuki Abe, Tatsuaki Okamoto
2000Quantum Public-Key Cryptosystems.
Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama
2000Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.
Amos Beimel, Yuval Ishai, Tal Malkin
2000Sequential Traitor Tracing.
Reihaneh Safavi-Naini, Yejing Wang
2000Taming the Adversary.
Martín Abadi
2000The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search.
Anand Desai
2000The XTR Public Key System.
Arjen K. Lenstra, Eric R. Verheul
2000Timed Commitments.
Dan Boneh, Moni Naor
2000Weaknesses in the SL
Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth