default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Cryptology, Volume 24
Volume 24, Number 1, January 2011
- Sebastiaan Indesteege, Bart Preneel
:
Practical Collisions for EnRUPT. 1-23 - Andreas Enge, Pierrick Gaudry, Emmanuel Thomé:
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves. 24-41 - Michel Abdalla, James Birkett, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Jacob C. N. Schuldt, Nigel P. Smart:
Wildcarded Identity-Based Encryption. 42-82 - Ran Canetti, Jonathan Herzog:
Universally Composable Symbolic Security Analysis. 83-147 - Markus Grassl, Ivana Ilic, Spyros S. Magliveras, Rainer Steinwandt:
Cryptanalysis of the Tillich-Zémor Hash Function. 148-156 - Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. 157-202 - Marc Fischlin, Roger Fischlin:
Efficient Non-Malleable Commitment Schemes. 203-244
Volume 24, Number 2, April 2011
- Christof Paar, Jean-Jacques Quisquater, Berk Sunar:
Guest Editorial. 245-246 - Gaetan Canivet, Paolo Maistri, Régis Leveugle, Jessy Clédière, Florent Valette, Marc Renaudin:
Glitch and Laser Fault Attacks onto a Secure AES Implementation on a SRAM-Based FPGA. 247-268 - Lejla Batina, Benedikt Gierlichs, Emmanuel Prouff, Matthieu Rivain, François-Xavier Standaert, Nicolas Veyrat-Charvillon:
Mutual Information Analysis: a Comprehensive Study. 269-291 - Svetla Nikova, Vincent Rijmen, Martin Schläffer:
Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches. 292-321 - Axel Poschmann, Amir Moradi, Khoongming Khoo, Chu-Wee Lim, Huaxiong Wang, San Ling:
Side-Channel Resistant Crypto for Less than 2, 300 GE. 322-345 - Agustin Dominguez-Oviedo, M. Anwar Hasan, Bijan Ansari:
Fault-Based Attack on Montgomery's Ladder Algorithm. 346-374 - Abhranil Maiti, Patrick Schaumont:
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive. 375-397 - Mathieu Baudet, David Lubicz, Julien Micolod, André Tassiaux:
On the Security of Oscillator-Based Random Number Generators. 398-425
Volume 24, Number 3, July 2011
- Martin Hell, Thomas Johansson:
Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time. 427-445 - Steven D. Galbraith, Xibin Lin, Michael Scott:
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. 446-469 - Dennis Hofheinz:
Possibility and Impossibility Results for Selective Decommitments. 470-516 - Dafna Kidron, Yehuda Lindell:
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. 517-544 - Jean Monnerat, Serge Vaudenay:
Short Undeniable Signatures Based on Group Homomorphisms. 545-587 - Moses D. Liskov, Ronald L. Rivest, David A. Wagner:
Tweakable Block Ciphers. 588-613
Volume 24, Number 4, October 2011
- Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. 615-658 - Dan Boneh, Xavier Boyen:
Efficient Selective Identity-Based Encryption Without Random Oracles. 659-693 - Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-Encryption. 694-719 - Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. 720-760 - Yehuda Lindell, Hila Zarosim:
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. 761-799
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-28 23:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
