Cryptology ePrint Archive: Listing for 1998


1998/026 ( PS PS.GZ )
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK
Oded Goldreich and Salil Vadhan
1998/025 ( PS PS.GZ )
Secure Distributed Storage and Retrieval
Juan A. Garay, Rosario Gennaro, Charanjit Jutla, and Tal Rabin
1998/024 ( PS PS.GZ )
The Disparity between Work and Entropy in Cryptology
John Pliam
1998/023 ( PS PS.GZ )
Security amplification by composition: The case of doubly-iterated, ideal ciphers
William Aiello, Mihir Bellare, Giovanni Di Crescenzo and Ramarathnam Venkatesan
1998/022 ( PS PS.GZ )
Insecurity of Quantum Computations
Hoi-Kwong Lo
1998/021 ( PS PS.GZ )
Relations among Notions of Security for Public-Key Encryption Schemes
Mihir Bellare,Anand Desai, David Pointcheval and Phillip Rogaway
1998/020 ( PS PS.GZ )
Almost All Discrete Log Bits Are Simultaneously Secure
Claus P. Schnorr
1998/019 ( PS PS.GZ )
Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems
Mihir Bellare, Shai Halevi, Amit Sahai and Salil Vadhan
1998/018 ( PS PS.GZ )
Security and Composition of Multi-party Cryptographic Protocols
Ran Canetti
1998/017 ( PS PS.GZ )
Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)
H. F. Chau and H.-K. Lo
1998/016 ( -- withdrawn -- )
Quantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distances
Hoi-Kwong Lo and H. F. Chau
1998/015 ( PS PS.GZ )
More on Proofs of Knowledge
Shai Halevi and Silvio Micali
1998/014 ( PS PS.GZ )
Randomness versus Fault-Tolerance
Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosen
1998/013 ( PS PS.GZ )
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 ( PS PS.GZ )
Maintaining Authenticated Communication in the Presence of Break-ins
Ran Canetti, Shai Halevi, Amir Herzberg
1998/011 ( PS PS.GZ PDF )
The Random Oracle Methodology, Revisited
Ran Canetti, Oded Goldreich, Shai Halevi
1998/010 ( PS PS.GZ )
Chameleon Hashing and Signatures
Hugo Krawczyk and Tal Rabin
1998/009 ( PS PS.GZ )
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols
Mihir Bellare, Ran Canetti, and Hugo Krawczyk
1998/008 ( PS PS.GZ )
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products
Rosario Gennaro and Daniele Micciancio and Tal Rabin
1998/007 ( PS PS.GZ )
Fast Batch Verification for Modular Exponentiation and Digital Signatures
Mihir Bellare, Juan A. Garay, and Tal Rabin
1998/006 ( PS PS.GZ )
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack
Ronald Cramer and Victor Shoup
1998/005 ( PS PS.GZ )
On the possibility of basing Cryptography on the assumption that $P \neq NP$
Oded Goldreich and Shafi Goldwasser
1998/004 ( PS PS.GZ )
Universal Service Providers for Database Private Information Retrieval
Giovanni Di-Crescenzo and Yuval Ishai and Rafail Ostrovsky
1998/003 ( PS PS.GZ )
Private Information Retrieval by Keywords
Benny Chor, Niv Gilboa, and Moni Naor
1998/002 ( PS PS.GZ )
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
A. De Santis, G. Di Crescenzo, O. Goldreich, and G. Persiano.
1998/001 ( PS PS.GZ )
On Protocol Divertibility
Gerrit Bleumer


[ Cryptology ePrint archive ]