Publications from Journal of Cryptology, 2004

Page	Title
1-3	Preface
5-26	Optimal Randomizer Efficiency in the Bounded-Storage Model
27-42	Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
43-77	Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
81-104	RSA-OAEP Is Secure under the RSA Assumption
105-124	The Full Cost of Cryptanalytic Attacks
125-151	Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing
153-207	Adaptive versus Non-Adaptive Security of Multi-Party Protocols
209-229	Nearly One-Sided Tests and the Goldreich?Levin Predicate
233	Preface
235-261	The Weil Pairing, and Its Efficient Calculation
263-276	A One Round Protocol for Tripartite Diffie-Hellman
277-296	Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
297-319	Short Signatures from the Weil Pairing
321-334	Efficient Implementation of Pairing-Based Cryptosystems