Publications from Journal of Cryptology, 2011

Page	Title
1-23	Practical Collisions for EnRUPT
24-41	An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
42-82	Wildcarded Identity-Based Encryption
83-147	Universally Composable Symbolic Security Analysis
148-156	Cryptanalysis of the Tillich-Zémor Hash Function
157-202	Utility Dependence in Correct and Fair Rational Secret Sharing
203-244	Efficient Non-Malleable Commitment Schemes
245-246	Guest Editorial
247-268	Glitch and Laser Fault Attacks onto a Secure AES Implementation on a SRAM-Based FPGA
269-291	Mutual Information Analysis: a Comprehensive Study
292-321	Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches
322-345	Side-Channel Resistant Crypto for Less than 2, 300 GE
346-374	Fault-Based Attack on Montgomery's Ladder Algorithm
375-397	Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive
398-425	On the Security of Oscillator-Based Random Number Generators
427-445	Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time
446-469	Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
470-516	Possibility and Impossibility Results for Selective Decommitments
517-544	Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
545-587	Short Undeniable Signatures Based on Group Homomorphisms
588-613	Tweakable Block Ciphers
615-658	Resource Fairness and Composability of Cryptographic Protocols
659-693	Efficient Selective Identity-Based Encryption Without Random Oracles
694-719	Securely Obfuscating Re-Encryption
720-760	Secure Computation Without Authentication
761-799	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer