default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th CRYPTO 2007: Santa Barbara, California, USA
- Alfred Menezes:
Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings. Lecture Notes in Computer Science 4622, Springer 2007, ISBN 978-3-540-74142-8
Cryptanalysis I
- Vivien Dubois, Pierre-Alain Fouque
, Adi Shamir, Jacques Stern:
Practical Cryptanalysis of SFLASH. 1-12 - Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen:
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. 13-30
Secure Searching
- Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? 31-49 - Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption That Allows PIR Queries. 50-67
Invited Talk
- Ross J. Anderson, Tyler Moore:
Information Security Economics - and Beyond. 68-91
Theory I
- Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography with Constant Input Locality. 92-110 - Omer Horvitz, Jonathan Katz:
Universally-Composable Two-Party Computation in Two Rounds. 111-129 - Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner:
Indistinguishability Amplification. 130-149
Lattices
- Nick Howgrave-Graham:
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. 150-169 - Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. 170-186
Random Oracles
- Ueli M. Maurer, Stefano Tessaro:
Domain Extension of Public Random Functions: Beyond the Birthday Barrier. 187-204 - Dominique Unruh:
Random Oracles and Auxiliary Input. 205-223
Hash Functions
- Marc Fischlin, Anja Lehmann:
Security-Amplifying Combiners for Collision-Resistant Hash Functions. 224-243 - Antoine Joux, Thomas Peyrin:
Hash Functions and the (Amplified) Boomerang Attack. 244-263 - Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. 264-283
Theory II
- Danny Harnik, Yuval Ishai, Eyal Kushilevitz:
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? 284-302 - Melissa Chase, Anna Lysyanskaya:
Simulatable VRFs with Applications to Multi-theorem NIZK. 303-322 - Jens Groth, Rafail Ostrovsky:
Cryptography in the Multi-string Model. 323-341
Quantum Cryptography
- Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure Identification and QKD in the Bounded-Quantum-Storage Model. 342-359 - Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. 360-378
Cryptanalysis II
- Jean-Sébastien Coron:
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. 379-394 - Ellen Jochemsz, Alexander May:
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073. 395-411
Encryption
- Shai Halevi:
Invertible Universal Hashing and the TET Encryption Mode. 412-429 - Vipul Goyal:
Reducing Trust in the PKG in Identity Based Cryptosystems. 430-447 - Aggelos Kiayias, Serdar Pehlivanoglu:
Pirate Evolution: How to Make the Most of Your Traitor Keys. 448-465
Protocol Analysis
- Daniel R. L. Brown, Kristian Gjøsteen:
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. 466-481 - Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi:
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. 482-499 - Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. 500-516
Public-Key Encryption
- Manoj Prabhakaran, Mike Rosulek:
Rerandomizable RCCA Encryption. 517-534 - Mihir Bellare, Alexandra Boldyreva, Adam O'Neill:
Deterministic and Efficiently Searchable Encryption. 535-552 - Dennis Hofheinz, Eike Kiltz:
Secure Hybrid Encryption from Weakened Key Encapsulation. 553-571
Multi-party Computation
- Ivan Damgård, Jesper Buus Nielsen:
Scalable and Unconditionally Secure Multiparty Computation. 572-590 - Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang:
On Secure Multi-party Computation in Black-Box Groups. 591-612 - Ronald Cramer, Eike Kiltz, Carles Padró:
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. 613-630
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-12-04 01:24 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:
