Publications from Journal of Cryptology, 2000

Page	Title
1-7	Preface
9-30	Secure Communication in Minimal Connectivity Models
31-60	Player Simulation and General Adversary Structures in Perfect Multiparty Computation
61-105	Maintaining Authenticated Communication in the Presence of Break-Ins
107-142	Randomness versus Fault-Tolerance
143-202	Security and Composition of Multiparty Cryptographic Protocols
207-220	Practical Aspects of Quantum Cryptographic Key Distribution
221-244	Stronger Security Proofs for RSA and Rabin Bits
245-262	Fast Correlation Attacks on the Summation Generator
263-272	A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
273-300	Robust and Efficient Sharing of RSA Functions
301-314	Maximum Correlation Analysis of Nonlinear Combining Functions in Stream Ciphers
315-338	CBC MAC for Real-Time Data Sources
339-360	On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping
361-396	Security Arguments for Digital Signatures and Blind Signatures
397-416	RSA-Based Undeniable Signatures
417-436	A Detailed Analysis of SAFER K
437-447	Kangaroos, Monopoly and Discrete Logarithms
449-472	Short Non-Interactive Cryptographic Proofs
473-492	Computing Discrete Logarithms in Quadratic Orders