default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st CRYPTO 2011: Santa Barbara, California, USA
- Phillip Rogaway:
Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings. Lecture Notes in Computer Science 6841, Springer 2011, ISBN 978-3-642-22791-2 - Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert
, Yu Yu:
Leftover Hash Lemma, Revisited. 1-20 - Paul Baecher, Marc Fischlin:
Random Oracle Reducibility. 21-38 - Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Time-Lock Puzzles in the Random Oracle Model. 39-50 - Christina Brzuska, Marc Fischlin, Heike Schröder, Stefan Katzenbeisser:
Physically Uncloneable Functions in the Universal Composition Framework. 51-70 - Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Santiago Zanella Béguelin:
Computer-Aided Security Proofs for the Working Cryptographer. 71-90 - Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos:
Optimal Verification of Operations on Dynamic Sets. 91-110 - Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis:
Verifiable Delegation of Computation over Large Datasets. 111-131 - Shai Halevi, Yehuda Lindell, Benny Pinkas:
Secure Computation on the Web: Computing without Simultaneous Interaction. 132-150 - Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz:
Memory Delegation. 151-168 - Charles Bouillaguet, Patrick Derbez, Pierre-Alain Fouque:
Automatic Search of Attacks on Round-Reduced AES and Applications. 169-187 - María Naya-Plasencia:
How to Improve Rebound Attacks. 188-205 - Gregor Leander, Mohamed Ahmed Abdelraheem, Hoda Alkhzaimi, Erik Zenner:
A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack. 206-221 - Jian Guo, Thomas Peyrin, Axel Poschmann:
The PHOTON Family of Lightweight Hash Functions. 222-239 - Gilad Asharov, Yehuda Lindell, Tal Rabin:
Perfectly-Secure Multiplication for Any t < n/3. 240-258 - Yehuda Lindell, Eli Oxman, Benny Pinkas:
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. 259-276 - Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. 277-296 - Sanjam Garg, Abhishek Jain, Amit Sahai:
Leakage-Resilient Zero Knowledge. 297-315 - Carolyn Whitnall, Elisabeth Oswald:
A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework. 316-334 - Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
Key-Evolution Schemes Resilient to Space-Bounded Leakage. 335-353 - Nicolas Veyrat-Charvillon, François-Xavier Standaert:
Generic Side-Channel Distinguishers: Improvements and Limitations. 354-372 - Yael Tauman Kalai, Bhavana Kanukurthi, Amit Sahai:
Cryptography with Tamperable and Leaky Memory. 373-390 - Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Merkle Puzzles in a Quantum World. 391-410 - Sean Hallgren, Adam D. Smith, Fang Song:
Classical Cryptographic Protocols in a Quantum World. 411-428 - Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. 429-446 - Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. 447-464 - Daniele Micciancio, Petros Mol:
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. 465-484 - Roger Dingledine:
Tor and Circumvention: Lessons Learned - (Abstract to Go with Invited Talk). 485-486 - Jean-Sébastien Coron, Avradip Mandal, David Naccache, Mehdi Tibouchi:
Fully Homomorphic Encryption over the Integers with Shorter Public Keys. 487-504 - Zvika Brakerski, Vinod Vaikuntanathan:
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. 505-524 - Adam O'Neill, Chris Peikert, Brent Waters:
Bi-Deniable Public-Key Encryption. 525-542 - Zvika Brakerski, Gil Segev:
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. 543-560 - Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Collision Security of Tandem-DM in the Ideal Cipher Model. 561-577 - Alexandra Boldyreva, Nathan Chenette, Adam O'Neill:
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions. 578-595 - Kan Yasuda:
A New Variant of PMAC: Beyond the Birthday Bound. 596-609 - Mihir Bellare, Sriram Keelveedhi:
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. 610-629 - Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh:
Round Optimal Blind Signatures. 630-648 - Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo:
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. 649-666 - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger:
Constant-Rate Oblivious Transfer from Noisy Channels. 667-684 - Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. 685-705 - Koichi Sakumoto, Taizo Shirai, Harunaga Hiwatari:
Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials. 706-723 - Jintai Ding, Timothy J. Hodges:
Inverting HFE Systems Is Quasi-Polynomial for All Fields. 724-742 - Daniel J. Bernstein, Tanja Lange, Christiane Peters:
Smaller Decoding Exponents: Ball-Collision Decoding. 743-760 - Hang Dinh, Cristopher Moore, Alexander Russell:
McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks. 761-779
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 2024-10-12 22:45 CEST 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:
