Publications from Journal of Cryptology, 2010

Page	Title
1-36	On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
37-71	Efficient Cache Attacks on AES, and Countermeasures
72-90	Cryptanalysis of MD2
91-120	A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
121-168	Obfuscation for Cryptographic Purposes
169-186	The RSA Group is Pseudo-Free
187-223	The TLS Handshake Protocol: A Modular Analysis
224-280	A Taxonomy of Pairing-Friendly Elliptic Curves
281-343	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
344-371	How Should We Solve Search Problems Privately?
373-401	Secure Computation of the Median (and Other Elements of Specified Ranks)
402-421	Parallel and Concurrent Security of the HB and HB+ Protocols
422-456	Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
457-476	Discrete Logarithm Problems with Auxiliary Inputs
477-503	On the Efficient Generation of Prime-Order Elliptic Curves
505-518	Structural Cryptanalysis of SASAS
519-545	An Analysis of the Blockcipher-Based Hash Functions from PGV
546-579	A Verifiable Secret Shuffle of Homomorphic Encryptions
580-593	On d-Multiplicative Secret Sharing
594-671	Long-Term Security and Universal Composability