
Conferences in DBLP
 Vivien Dubois, PierreAlain Fouque, Adi Shamir, Jacques Stern
Practical Cryptanalysis of SFLASH. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:112 [Conf]
 PierreAlain Fouque, Gaëtan Leurent, Phong Q. Nguyen
Full KeyRecovery Attacks on HMAC/NMACMD4 and NMACMD5. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:1330 [Conf]
 Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
How Should We Solve Search Problems Privately? [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:3149 [Conf]
 Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III
Public Key Encryption That Allows PIR Queries. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:5067 [Conf]
 Ross Anderson, Tyler Moore
Information Security Economics  and Beyond. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:6891 [Conf]
 Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Cryptography with Constant Input Locality. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:92110 [Conf]
 Omer Horvitz, Jonathan Katz
UniversallyComposable TwoParty Computation in Two Rounds. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:111129 [Conf]
 Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
Indistinguishability Amplification. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:130149 [Conf]
 Nick HowgraveGraham
A Hybrid LatticeReduction and MeetintheMiddle Attack Against NTRU. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:150169 [Conf]
 Guillaume Hanrot, Damien Stehlé
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:170186 [Conf]
 Ueli M. Maurer, Stefano Tessaro
Domain Extension of Public Random Functions: Beyond the Birthday Barrier. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:187204 [Conf]
 Dominique Unruh
Random Oracles and Auxiliary Input. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:205223 [Conf]
 Marc Fischlin, Anja Lehmann
SecurityAmplifying Combiners for CollisionResistant Hash Functions. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:224243 [Conf]
 Antoine Joux, Thomas Peyrin
Hash Functions and the (Amplified) Boomerang Attack. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:244263 [Conf]
 Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
Amplifying Collision Resistance: A ComplexityTheoretic Treatment. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:264283 [Conf]
 Danny Harnik, Yuval Ishai, Eyal Kushilevitz
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:284302 [Conf]
 Melissa Chase, Anna Lysyanskaya
Simulatable VRFs with Applications to Multitheorem NIZK. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:303322 [Conf]
 Jens Groth, Rafail Ostrovsky
Cryptography in the Multistring Model. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:323341 [Conf]
 Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner
Secure Identification and QKD in the BoundedQuantumStorage Model. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:342359 [Conf]
 Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner
A Tight HighOrder Entropic Quantum Uncertainty Relation with Applications. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:360378 [Conf]
 JeanSébastien Coron
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:379394 [Conf]
 Ellen Jochemsz, Alexander May
A Polynomial Time Attack on RSA with Private CRTExponents Smaller Than N ^{0.073}. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:395411 [Conf]
 Shai Halevi
Invertible Universal Hashing and the TET Encryption Mode. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:412429 [Conf]
 Vipul Goyal
Reducing Trust in the PKG in Identity Based Cryptosystems. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:430447 [Conf]
 Aggelos Kiayias, Serdar Pehlivanoglu
Pirate Evolution: How to Make the Most of Your Traitor Keys. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:448465 [Conf]
 Daniel R. L. Brown, Kristian Gjøsteen
A Security Analysis of the NIST SP 80090 Elliptic Curve Random Number Generator. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:466481 [Conf]
 Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:482499 [Conf]
 Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
ChernoffType Direct Product Theorems. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:500516 [Conf]
 Manoj Prabhakaran, Mike Rosulek
Rerandomizable RCCA Encryption. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:517534 [Conf]
 Mihir Bellare, Alexandra Boldyreva, Adam O'Neill
Deterministic and Efficiently Searchable Encryption. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:535552 [Conf]
 Dennis Hofheinz, Eike Kiltz
Secure Hybrid Encryption from Weakened Key Encapsulation. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:553571 [Conf]
 Ivan Damgård, Jesper Buus Nielsen
Scalable and Unconditionally Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:572590 [Conf]
 Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang
On Secure Multiparty Computation in BlackBox Groups. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:591612 [Conf]
 Ronald Cramer, Eike Kiltz, Carles Padró
A Note on Secure Computation of the MoorePenrose Pseudoinverse and Its Application to Secure Linear Algebra. [Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:613630 [Conf]
