Publications from Journal of Cryptology, 2005

Page	Title
1-35	Computationally Secure Oblivious Transfer
37-61	Minimal Complete Primitives for Secure Multi-Party Computation
63-76	Analysis of the Sliding Window Powering Algorithm
79-89	Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields
91-110	An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
111-131	CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
133-165	Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security
167-183	Low Bandwidth Dynamic Traitor Tracing Schemes
187-189	Preface
191-217	Byzantine Agreement Given Partial Broadcast
219-246	Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
247-287	Secure Multi-Party Computation without Agreement
291-311	Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
313-335	Secure Classical Bit Commitment Using Fixed Capacity Communication Channels
337-355	Polynomial and Normal Bases for Finite Fields
357-373	The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
375-389	Partial Key Recovery Attack Against RMAC
391-414	Analysis and Design of Distributed Key Distribution Centers