default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CRYPTO 2009: Santa Barbara, California, USA
- Shai Halevi:
Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science 5677, Springer 2009, ISBN 978-3-642-03355-1
Key Leakage
- Nadia Heninger, Hovav Shacham:
Reconstructing RSA Private Keys from Random Key Bits. 1-17 - Moni Naor, Gil Segev:
Public-Key Cryptosystems Resilient to Key Leakage. 18-35 - Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. 36-54
Hash-Function Cryptanalysis
- Marc Stevens
, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. 55-69 - Kazumaro Aoki, Yu Sasaki:
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1. 70-89
Privacy and Anonymity
- Stanislaw Jarecki, Xiaomin Liu:
Private Mutual Authentication and Conditional Oblivious Transfer. 90-107 - Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham:
Randomizable Proofs and Delegatable Anonymous Credentials. 108-125 - Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan:
Computational Differential Privacy. 126-142
Interactive Proofs and Zero-Knowledge
- Yael Tauman Kalai, Ran Raz:
Probabilistically Checkable Arguments. 143-159 - Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström:
On the Composition of Public-Coin Zero-Knowledge Protocols. 160-176 - Ronald Cramer, Ivan Damgård:
On the Amortized Complexity of Zero-Knowledge Protocols. 177-191 - Jens Groth:
Linear Algebra with Sub-linear Zero-Knowledge Arguments. 192-208
Block-Cipher Cryptanalysis
- Zheng Yuan, Wei Wang, Keting Jia, Guangwu Xu, Xiaoyun Wang:
New Birthday Attacks on Some MACs Based on Block Ciphers. 209-230 - Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic:
Distinguisher and Related-Key Attack on the Full AES-256. 231-249 - Julia Borghoff, Lars R. Knudsen, Gregor Leander, Krystian Matusiewicz:
Cryptanalysis of C2. 250-266
Modes of Operation
- Yevgeniy Dodis, John P. Steinberger:
Message Authentication Codes from Unpredictable Block Ciphers. 267-285 - Ben Morris, Phillip Rogaway, Till Stegers:
How to Encipher Messages on a Small Domain. 286-302
Elliptic Curves
- Thomas Icart:
How to Hash into Elliptic Curves. 303-316 - Daniel J. Bernstein:
Batch Binary Edwards. 317-336
Cryptographic Hardness
- Adi Akavia:
Solving Hidden Number Problem with One Bit Oracle and Advice. 337-354 - Ueli M. Maurer, Stefano Tessaro:
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. 355-373
Merkle Puzzles
- Boaz Barak, Mohammad Mahmoody-Ghidary:
Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle. 374-390
Cryptography in the Physical World
- Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky:
Position Based Cryptography. 391-407 - Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner:
Improving the Security of Quantum Protocols via Commit-and-Open. 408-427
Attacks on Signature Schemes
- Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann:
Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures. 428-444 - Gaëtan Leurent, Phong Q. Nguyen:
How Risky Is the Random-Oracle Model? 445-464
Invited Talk
- Ueli M. Maurer:
Abstraction in Cryptography. 465
Secret Sharing and Secure Computation
- Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing:
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. 466-486 - Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. 487-504 - Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou:
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer. 505-523
Cryptography and Game-Theory
- Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti:
Collusion-Free Multiparty Computation in the Mediated Model. 524-540 - Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos:
Privacy-Enhancing Auctions Using Rational Cryptography. 541-558 - Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. 559-576
Cryptography and Lattices
- Vadim Lyubashevsky, Daniele Micciancio:
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. 577-594 - Benny Applebaum, David Cash, Chris Peikert, Amit Sahai:
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. 595-618
Identity-Based Encryption
- Brent Waters:
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions. 619-636
Cryptographers' Toolbox
- Dennis Hofheinz, Eike Kiltz:
The Group of Signed Quadratic Residues and Applications. 637-653 - Susan Hohenberger, Brent Waters:
Short and Stateless Signatures from the RSA Assumption. 654-670 - Michel Abdalla, Céline Chevalier, David Pointcheval:
Smooth Projective Hashing for Conditionally Extractable Commitments. 671-689
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-29 00:05 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:
