Publications of eprint 1998

Page	Title
	On Protocol Divertibility
	The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
	Private Information Retrieval by Keywords
	Universal Service Providers for Database Private Information Retrieval
	On the possibility of basing Cryptography on the assumption that $P \neq NP$
	A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack
	Fast Batch Verification for Modular Exponentiation and Digital Signatures
	An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products
	A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols
	Chameleon Hashing and Signatures
	The Random Oracle Methodology, Revisited
	Maintaining Authenticated Communication in the Presence of Break-ins
	A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication)
	Randomness versus Fault-Tolerance
	More on Proofs of Knowledge
	Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)
	Security and Composition of Multi-party Cryptographic Protocols
	Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems
	Almost All Discrete Log Bits Are Simultaneously Secure
	Relations among Notions of Security for Public-Key Encryption Schemes
	Insecurity of Quantum Computations
	Security amplification by composition: The case of doubly-iterated, ideal ciphers
	The Disparity between Work and Entropy in Cryptology
	Secure Distributed Storage and Retrieval
	Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK