Cryptology ePrint Archive: Listing for 1990s

• [ePrint 1996 - now ] (~5MB!)
• [ePrint 2020 - now ]    [ePrint 2026]    [ePrint 2025]    [ePrint 2024]    [ePrint 2023]    [ePrint 2022]    [ePrint 2021]    [ePrint 2020]
• [ePrint 2010 - 2019]    [ePrint 2019]    [ePrint 2018]    [ePrint 2017]    [ePrint 2016]    [ePrint 2015]    [ePrint 2014]    [ePrint 2013]    [ePrint 2012]    [ePrint 2011]    [ePrint 2010]
• [ePrint 2000 - 2009]    [ePrint 2009]    [ePrint 2008]    [ePrint 2007]    [ePrint 2006]    [ePrint 2005]    [ePrint 2004]    [ePrint 2003]    [ePrint 2002]    [ePrint 2001]    [ePrint 2000]
• [ePrint 1996 - 1999]    [ePrint 1999]    [ePrint 1998]    [ePrint 1997]    [ePrint 1996]

• 1999/024 (PDF)
  A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion
  M. Bellare, R. Impagliazzo
• 1999/023 (PDF)
  Concurrent Zero-Knowledge
  Cynthia Dwork, Moni Naor, Amit Sahai
• 1999/022 (PDF)
  Resettable Zero-Knowledge
  Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
• 1999/021 (PDF)
  Public-Key Cryptography and Password Protocols: The Multi-User Case
  Maurizio Kliban Boyarsky
• 1999/020 (PDF)
  Improving the Exact Security of Digital Signature Schemes
  Silvio Micali, Leonid Reyzin
• 1999/019 (PDF)
  Security of all RSA and Discrete Log Bits
  Johan Hastad, Mats Naslund
• 1999/018 (PDF)
  Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
  Mihir Bellare, Amit Sahai
• 1999/017 (PDF)
  A Composition Theorem for Universal One-Way Hash Functions
  Victor Shoup
• 1999/016 (PDF)
  A forward-secure digital signature scheme
  Mihir Bellare, Sara Miner
• 1999/015 (PDF)
  Interleaved Zero-Knowledge in the Public-Key Model
  Oded Goldreich, Shafi Goldwasser, Silvio Micali
• 1999/014 (PDF)
  Concurrent Zero-Knowledge is Easy in Practice
  Ivan Damgard
• 1999/013 (PDF)
  Secure Hash-and-Sign Signatures without the Random Oracle
  Rosario Gennaro, Shai Halevi, Tal Rabin
• 1999/012 (PDF)
  On Formal Models for Secure Key Exchange
  Victor Shoup
• 1999/011 (PDF)
  Practical Threshold Signatures
  Victor Shoup
• 1999/010 (PDF)
  A Relationship between One-Wayness and Correlation Intractability
  Satoshi Hada, Toshiaki Tanaka
• 1999/009 (PDF)
  On the Existence of3-Round Zero-Knowledge Protocols
  Satoshi Hada, Toshiaki Tanaka
• 1999/008 (PDF)
  Verifiable Encryption and Applications to Group Signatures and Signature Sharing
  Jan Camenisch, Ivan Damgaard
• 1999/007 (PDF)
  DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem
  Michel Abdalla, Mihir Bellare, Phillip Rogaway
• 1999/005 (PDF)
  Lattice Based Cryptography: A Global Improvement
  Daniele Micciancio
• 1999/004 (PDF)
  Public-key cryptography and password protocols
  Shai Halevi, Hugo Krawczyk
• 1999/003 (PDF)
  An error in the mixed adversary protocol by Fitzi, Hirt and Maurer
  Ivan Damgard
• 1999/002 (PDF)
  Chinese Remaindering with Errors
  Oded Goldreich, Dana Ron, Madhu Sudan
• 1999/001 (PDF)
  Signature Schemes Based on the Strong RSA Assumption
  Ronald Cramer, Victor Shoup
• 1998/026 (PDF)
  Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK
  Oded Goldreich, Salil Vadhan
• 1998/025 (PDF)
  Secure Distributed Storage and Retrieval
  Juan A. Garay, Rosario Gennaro, Charanjit Jutla, Tal Rabin
• 1998/024 (PDF)
  The Disparity between Work and Entropy in Cryptology
  John Pliam
• 1998/023 (PDF)
  Security amplification by composition: The case of doubly-iterated, ideal ciphers
  William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan
• 1998/022 (PDF)
  Insecurity of Quantum Computations
  Hoi-Kwong Lo
• 1998/021 (PDF)
  Relations among Notions of Security for Public-Key Encryption Schemes
  Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway
• 1998/020 (PDF)
  Almost All Discrete Log Bits Are Simultaneously Secure
  Claus P. Schnorr
• 1998/019 (PDF)
  Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems
  Mihir Bellare, Shai Halevi, Amit Sahai, Salil Vadhan
• 1998/018 (PDF)
  Security and Composition of Multi-party Cryptographic Protocols
  Ran Canetti
• 1998/017 (PDF)
  Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)
  H. F. Chau, H. -K. Lo
• 1998/015 (PDF)
  More on Proofs of Knowledge
  Shai Halevi, Silvio Micali
• 1998/014 (PDF)
  Randomness versus Fault-Tolerance
  Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosen
• 1998/013 (PDF)
  A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication)
  Yael Gertner, Shafi Goldwasser, Tal Malkin
• 1998/012 (PDF)
  Maintaining Authenticated Communication in the Presence of Break-ins
  Ran Canetti, Shai Halevi, Amir Herzberg
• 1998/011 (PDF)
  The Random Oracle Methodology, Revisited
  Ran Canetti, Oded Goldreich, Shai Halevi
• 1998/010 (PDF)
  Chameleon Hashing and Signatures
  Hugo Krawczyk, Tal Rabin
• 1998/009 (PDF)
  A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols
  Mihir Bellare, Ran Canetti, Hugo Krawczyk
• 1998/008 (PDF)
  An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products
  Rosario Gennaro, Daniele Micciancio, Tal Rabin
• 1998/007 (PDF)
  Fast Batch Verification for Modular Exponentiation and Digital Signatures
  Mihir Bellare, Juan A. Garay, Tal Rabin
• 1998/006 (PDF)
  A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack
  Ronald Cramer, Victor Shoup
• 1998/005 (PDF)
  On the possibility of basing Cryptography on the assumption that $P \neq NP$
  Oded Goldreich, Shafi Goldwasser
• 1998/004 (PDF)
  Universal Service Providers for Database Private Information Retrieval
  Giovanni Di-Crescenzo, Yuval Ishai, Rafail Ostrovsky
• 1998/003 (PDF)
  Private Information Retrieval by Keywords
  Benny Chor, Niv Gilboa, Moni Naor
• 1998/002 (PDF)
  The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
  A. De Santis, G. Di Crescenzo, O. Goldreich, G. Persiano.
• 1998/001 (PDF)
  On Protocol Divertibility
  Gerrit Bleumer
• 1997/015 (PDF)
  Optimistic fair Exchange of Digital Signatures
  N. Asokan, V. Shoup, M. Waidner
• 1997/014 (PDF)
  Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring
  Eli Biham, Dan Boneh, Omer Reingold
• 1997/013 (PDF)
  Visual Authentication and Identification
  Moni Naor, Benny Pinkas.
• 1997/012 (PDF)
  Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop.
  Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest
• 1997/011 (PDF)
  Identity Escrow
  Joe Kilian, Erez Petrank
• 1997/010 (PDF)
  CBC MAC for Real-Time Data Sources
  Erez Petrank, Charles Rackoff
• 1997/009 (PDF)
  Collision-Resistant Hashing: Towards Making UOWHFs Practical
  Mihir Bellare, Phillip Rogaway
• 1997/008 (PDF)
  Factoring via Strong Lattice Reduction Algorithms
  Harald Ritter, Carsten Roessner
• 1997/007 (PDF)
  Towards realizing random oracles: Hash functions that hide all partial information
  Ran Canetti
• 1997/006 (PDF)
  Protecting Data Privacy in Private Information Retrieval Schemes
  Yuval Ishai, Eyal Kushilevitz
• 1997/005 (PDF)
  A Probabilistic Error-Correcting Scheme
  S. Decatur, O. Goldreich, D. Ron
• 1997/004 (PDF)
  A note on negligible functions
  Mihir Bellare
• 1997/003 (PDF)
  Efficient Cryptographic Protocols Based on Noisy Channels.
  Claude Crepeau
• 1997/002 (PDF)
  Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
  Mihir Bellare, Markus Jakobsson, Moti Yung
• 1997/001 (PDF)
  A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost
  Mihir Bellare, Daniele Micciancio
• 1996/016 (PDF)
  Public-Key Cryptosystems from Lattice Reduction Problems
  Oded Goldreich, Shafi Goldwasser, Shai Halevi
• 1996/015 (PDF)
  Verifiable Partial Key Escrow
  Mihir Bellare, Shafi Goldwasser
• 1996/014 (PDF)
  The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
  Oded Goldreich
• 1996/013 (PDF)
  On the Contrast in Visual Cryptography Schemes
  Carlo Blundo, Alfredo De Santis, Douglas R. Stinson
• 1996/012 (PDF)
  Proactive RSA
  Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
• 1996/011 (PDF)
  On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited
  Moni Naor, Omer Reingold
• 1996/010 (PDF)
  Oblivious Transfers and Intersecting Codes
  Gilles Brassard, Claude Crepeau, Miklos Santha
• 1996/009 (PDF)
  Collision-Free Hashing from Lattice Problems
  Oded Goldreich, Shafi Goldwasser, Shai Halevi
• 1996/008 (PDF)
  Access Control and Signatures via Quorum Secret Sharing
  Moni Naor, Avishai Wool
• 1996/007 (PDF)
  Visual Cryptography II: Improving the Contrast Via the Cover Base
  Moni Naor, Adi Shamir
• 1996/006 (PDF)
  Upper bound on the communication complexity of private information retrieval
  Andris Ambainis
• 1996/005 (PDF)
  Private Information Storage
  Rafail Ostrovsky, Victor Shoup
• 1996/004 (PDF)
  Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments
  Ronald Cramer, Ivan Damgaard
• 1996/003 (PDF)
  On Monotone Function Closure of Statistical Zero-Knowledge
  Ronald Cramer, Ivan Damgaard
• 1996/002 (PDF)
  Deniable Encryption
  Ran Canetti, Cynthia Dwork, Moni Naor, Rafi Ostrovsky
• 1996/001 (PDF)
  Incoercible Multiparty Computation
  Ran Canetti, Rosario Gennaro