Cryptology ePrint Archive: Listing for 1998

• [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]

• 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