default search action
30th CRYPTO 2010: Santa Barbara, California, USA
- Tal Rabin:
Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings. Lecture Notes in Computer Science 6223, Springer 2010, ISBN 978-3-642-14622-0
Leakage
- Zvika Brakerski, Shafi Goldwasser:
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back). 1-20 - Yevgeniy Dodis, Krzysztof Pietrzak:
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks. 21-40 - Ali Juma, Yevgeniy Vahlis:
Protecting Cryptographic Keys against Continual Leakage. 41-58 - Shafi Goldwasser, Guy N. Rothblum:
Securing Computation against Continuous Leakage. 59-79
Lattice
- Chris Peikert:
An Efficient and Parallel Gaussian Sampler for Lattices. 80-97 - Shweta Agrawal, Dan Boneh, Xavier Boyen:
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE. 98-115
Homomorphic Encryption
- Craig Gentry:
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness. 116-137 - Carlos Aguilar Melchor, Philippe Gaborit, Javier Herranz
:
Additively Homomorphic Encryption with d-Operand Multiplications. 138-154 - Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. 155-172
Theory and Applications
- Vipul Goyal, Yuval Ishai, Mohammad Mahmoody
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. 173-190 - Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption. 191-208 - Masayuki Abe, Georg Fuchsbauer, Jens Groth
Structure-Preserving Signatures and Commitments to Group Elements. 209-236 - Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. 237-254
Key Exchange, OAEP/RSA, CCA
- Jan Camenisch, Nathalie Casati, Thomas Gross
Credential Authenticated Identification and Key Exchange. 255-276 - Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Password-Authenticated Session-Key Generation on the Internet in the Plain Model. 277-294 - Eike Kiltz
Instantiability of RSA-OAEP under Chosen-Plaintext Attack. 295-313 - Hoeteck Wee:
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs. 314-332
Attacks
- Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé
Factorization of a 768-Bit RSA Modulus. 333-350 - Wilko Henecka, Alexander May, Alexander Meurer:
Correcting Errors in RSA Private Keys. 351-369 - Thomas Peyrin:
Improved Differential Attacks for ECHO and Grøstl. 370-392 - Orr Dunkelman, Nathan Keller, Adi Shamir:
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony. 393-410
Composition
- Dominique Unruh
Universally Composable Incoercibility. 411-428 - Huijia Lin, Rafael Pass
Concurrent Non-Malleable Zero Knowledge Proofs. 429-446 - Chongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky:
Equivalence of Uniform Key Agreement and Composition Insecurity. 447-464
Computation Delegation and Obfuscation
- Rosario Gennaro, Craig Gentry, Bryan Parno:
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. 465-482 - Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption. 483-501 - Benny Pinkas, Tzachy Reinman:
Oblivious RAM Revisited. 502-519 - Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. 520-537
Multiparty Computation
- Amos Beimel
Protocols for Multiparty Coin Toss with Dishonest Majority. 538-557 - Ivan Damgård, Claudio Orlandi
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. 558-576 - Yuval Ishai, Eyal Kushilevitz, Anat Paskin:
Secure Multiparty Computation with Minimal Interaction. 577-594 - Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security. 595-612
Pseudorandomness
- Viet Tung Hoang, Phillip Rogaway:
On Generalized Feistel Networks. 613-630 - Hugo Krawczyk:
Cryptographic Extraction and Key Derivation: The HKDF Scheme. 631-648 - Anindya De, Luca Trevisan
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. 649-665 - Mihir Bellare, David Cash:
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks. 666-684
Quantum
- Frédéric Dupuis, Jesper Buus Nielsen
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. 685-706 - Severin Winkler, Jürg Wullschleger:
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions. 707-723 - Niek J. Bouman, Serge Fehr:
Sampling in a Quantum Population, and Applications. 724-741
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-11-22 19:30 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: