CRYPTO A*

34 papers

YearTitle / Authors
2001A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0.
James Manger
2001Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings
Joe Kilian
2001An Efficient Scheme for Proving a Shuffle.
Jun Furukawa, Kazue Sako
2001An Identity Escrow Scheme with Appointed Verifiers.
Jan Camenisch, Anna Lysyanskaya
2001Correlation Analysis of the Shrinking Generator.
Jovan Dj. Golic
2001Cryptanalysis of RSA Signatures with Fixed-Pattern Padding.
Eric Brier, Christophe Clavier, Jean-Sébastien Coron, David Naccache
2001Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms.
Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
2001Forward-Secure Signatures with Optimal Signing and Verifying.
Gene Itkis, Leonid Reyzin
2001Identity-Based Encryption from the Weil Pairing.
Dan Boneh, Matthew K. Franklin
2001Improved Online/Offline Signature Schemes.
Adi Shamir, Yael Tauman
2001Minimal Complete Primitives for Secure Multi-party Computation.
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
2001New Public Key Cryptosystem Using Finite Non Abelian Groups.
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongtaek Chee, Choonsik Park
2001Nonlinear Vector Resilient Functions.
Jung Hee Cheon
2001OAEP Reconsidered.
Victor Shoup
2001Oblivious Transfer in the Bounded Storage Model.
Yan Zong Ding
2001On the (Im)possibility of Obfuscating Programs.
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
2001On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase.
Ronald Cramer, Ivan Damgård, Serge Fehr
2001On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme.
Dan Boneh, Igor E. Shparlinski
2001Online Ciphers and the Hash-CBC Construction.
Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre
2001Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.
Yehuda Lindell
2001Pseudorandomness from Braid Groups.
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
2001RSA-OAEP Is Secure under the RSA Assumption.
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern
2001Revocation and Tracing Schemes for Stateless Receivers.
Dalit Naor, Moni Naor, Jeffery Lotspiech
2001Robust Non-interactive Zero Knowledge.
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai
2001Robustness for Free in Unconditional Multi-party Computation.
Martin Hirt, Ueli M. Maurer
2001Secure Distributed Linear Algebra in a Constant Number of Rounds.
Ronald Cramer, Ivan Damgård
2001Secure and Efficient Asynchronous Broadcast Protocols.
Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup
2001Self Protecting Pirates and Black-Box Traitor Tracing.
Aggelos Kiayias, Moti Yung
2001Session-Key Generation Using Human Passwords Only.
Oded Goldreich, Yehuda Lindell
2001Simplified OAEP for the RSA and Rabin Functions.
Dan Boneh
2001Soundness in the Public-Key Model.
Silvio Micali, Leonid Reyzin
2001The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?).
Hugo Krawczyk
2001Two-Party Generation of DSA Signatures.
Philip D. MacKenzie, Michael K. Reiter
2001Universally Composable Commitments.
Ran Canetti, Marc Fischlin