International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from Journal of Cryptology 2011

Year
Venue
Title
2011
JOFC
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Yehuda Lindell Hila Zarosim
2011
JOFC
An <i>L</i>(1/3) Discrete Logarithm Algorithm for Low Degree Curves
Andreas Enge Pierrick Gaudry Emmanuel Thomé
2011
JOFC
Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time
Martin Hell Thomas Johansson
2011
JOFC
Cryptanalysis of the Tillich-Zémor Hash Function
Markus Grassl Ivana Ilic Spyros S. Magliveras Rainer Steinwandt
2011
JOFC
Efficient Non-Malleable Commitment Schemes
Roger Fischlin Marc Fischlin
2011
JOFC
Efficient Selective Identity-Based Encryption Without Random Oracles
Dan Boneh Xavier Boyen
2011
JOFC
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Steven D. Galbraith Xibin Lin Michael Scott
2011
JOFC
Fault-Based Attack on Montgomery's Ladder Algorithm
Agustin Dominguez-Oviedo M. Anwar Hasan Bijan Ansari
2011
JOFC
Glitch and Laser Fault Attacks onto a Secure AES Implementation on a SRAM-Based FPGA
Gaetan Canivet Paolo Maistri Régis Leveugle Jessy Clédière Florent Valette Marc Renaudin
2011
JOFC
Guest Editorial
Christof Paar Jean-Jacques Quisquater Berk Sunar
2011
JOFC
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
Dafna Kidron Yehuda Lindell
2011
JOFC
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive
Abhranil Maiti Patrick Schaumont
2011
JOFC
Mutual Information Analysis: a Comprehensive Study
Lejla Batina Benedikt Gierlichs Emmanuel Prouff Matthieu Rivain François-Xavier Standaert Nicolas Veyrat-Charvillon
2011
JOFC
On the Security of Oscillator-Based Random Number Generators
Mathieu Baudet David Lubicz Julien Micolod André Tassiaux
2011
JOFC
Possibility and Impossibility Results for Selective Decommitments
Dennis Hofheinz
2011
JOFC
Practical Collisions for EnRUPT
Sebastiaan Indesteege Bart Preneel
2011
JOFC
Resource Fairness and Composability of Cryptographic Protocols
Juan A. Garay Philip D. MacKenzie Manoj Prabhakaran Ke Yang
2011
JOFC
Secure Computation Without Authentication
Boaz Barak Ran Canetti Yehuda Lindell Rafael Pass Tal Rabin
2011
JOFC
Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches
Svetla Nikova Vincent Rijmen Martin Schläffer
2011
JOFC
Securely Obfuscating Re-Encryption
Susan Hohenberger Guy N. Rothblum Abhi Shelat Vinod Vaikuntanathan
2011
JOFC
Short Undeniable Signatures Based on Group Homomorphisms
Jean Monnerat Serge Vaudenay
2011
JOFC
Side-Channel Resistant Crypto for Less than 2, 300 GE
Axel Poschmann Amir Moradi Khoongming Khoo Chu-Wee Lim Huaxiong Wang San Ling
2011
JOFC
Tweakable Block Ciphers
Moses Liskov Ronald L. Rivest David Wagner
2011
JOFC
Universally Composable Symbolic Security Analysis
Ran Canetti Jonathan Herzog
2011
JOFC
Utility Dependence in Correct and Fair Rational Secret Sharing
Gilad Asharov Yehuda Lindell
2011
JOFC
Wildcarded Identity-Based Encryption
Michel Abdalla James Birkett Dario Catalano Alexander W. Dent John Malone-Lee Gregory Neven Jacob C. N. Schuldt Nigel P. Smart