30. CRYPTO 2010: Santa Barbara, California, USA
Tal Rabin (Ed.): Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings. Springer 2010 Lecture Notes in Computer Science 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
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, Amit Sahai: 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, Kristiyan Haralambiev, Miyako Ohkubo: 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 Groß, Victor Shoup: 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, Adam O'Neill, Adam Smith: 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é, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann: Factorization of a 768-Bit RSA Modulus. 333-350
- 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
- Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam: 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
Multiparty Computation
- Amos Beimel, Eran Omri, Ilan Orlov: 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
- Hugo Krawczyk: Cryptographic Extraction and Key Derivation: The HKDF Scheme. 631-648
- Anindya De, Luca Trevisan, Madhur Tulsiani: 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, Louis Salvail: 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team