Abstract is missing.
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back)Zvika Brakerski, Shafi Goldwasser. 1-20 [doi]
- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel NetworksYevgeniy Dodis, Krzysztof Pietrzak. 21-40 [doi]
- Protecting Cryptographic Keys against Continual LeakageAli Juma, Yevgeniy Vahlis. 41-58 [doi]
- Securing Computation against Continuous LeakageShafi Goldwasser, Guy N. Rothblum. 59-79 [doi]
- An Efficient and Parallel Gaussian Sampler for LatticesChris Peikert. 80-97 [doi]
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBEShweta Agrawal, Dan Boneh, Xavier Boyen. 98-115 [doi]
- Toward Basing Fully Homomorphic Encryption on Worst-Case HardnessCraig Gentry. 116-137 [doi]
- Additively Homomorphic Encryption with ::::d::::-Operand MultiplicationsCarlos Aguilar Melchor, Philippe Gaborit, Javier Herranz. 138-154 [doi]
- ::::i::::-Hop Homomorphic Encryption and Rerandomizable Yao CircuitsCraig Gentry, Shai Halevi, Vinod Vaikuntanathan. 155-172 [doi]
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional CryptographyVipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai. 173-190 [doi]
- Fully Secure Functional Encryption with General Relations from the Decisional Linear AssumptionTatsuaki Okamoto, Katsuyuki Takashima. 191-208 [doi]
- Structure-Preserving Signatures and Commitments to Group ElementsMasayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo. 209-236 [doi]
- Efficient Indifferentiable Hashing into Ordinary Elliptic CurvesEric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi. 237-254 [doi]
- Credential Authenticated Identification and Key ExchangeJan Camenisch, Nathalie Casati, Thomas Groß, Victor Shoup. 255-276 [doi]
- Password-Authenticated Session-Key Generation on the Internet in the Plain ModelVipul Goyal, Abhishek Jain 0002, Rafail Ostrovsky. 277-294 [doi]
- Instantiability of RSA-OAEP under Chosen-Plaintext AttackEike Kiltz, Adam O Neill, Adam Smith. 295-313 [doi]
- Efficient Chosen-Ciphertext Security via Extractable Hash ProofsHoeteck Wee. 314-332 [doi]
- Factorization of a 768-Bit RSA ModulusThorsten 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. 333-350 [doi]
- Correcting Errors in RSA Private KeysWilko Henecka, Alexander May, Alexander Meurer. 351-369 [doi]
- Improved Differential Attacks for ECHO and GrøstlThomas Peyrin. 370-392 [doi]
- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G TelephonyOrr Dunkelman, Nathan Keller, Adi Shamir. 393-410 [doi]
- Universally Composable IncoercibilityDominique Unruh, Jörn Müller-Quade. 411-428 [doi]
- Concurrent Non-Malleable Zero Knowledge ProofsHuijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam. 429-446 [doi]
- Equivalence of Uniform Key Agreement and Composition InsecurityChongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky. 447-464 [doi]
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted WorkersRosario Gennaro, Craig Gentry, Bryan Parno. 465-482 [doi]
- Improved Delegation of Computation Using Fully Homomorphic EncryptionKai-Min Chung, Yael Kalai, Salil P. Vadhan. 483-501 [doi]
- Oblivious RAM RevisitedBenny Pinkas, Tzachy Reinman. 502-519 [doi]
- On Strong Simulation and Composable Point ObfuscationNir Bitansky, Ran Canetti. 520-537 [doi]
- Protocols for Multiparty Coin Toss with Dishonest MajorityAmos Beimel, Eran Omri, Ilan Orlov. 538-557 [doi]
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low CostIvan Damgård, Claudio Orlandi. 558-576 [doi]
- Secure Multiparty Computation with Minimal InteractionYuval Ishai, Eyal Kushilevitz, Anat Paskin. 577-594 [doi]
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC SecurityHemanta K. Maji, Manoj Prabhakaran, Mike Rosulek. 595-612 [doi]
- On Generalized Feistel NetworksViet Tung Hoang, Phillip Rogaway. 613-630 [doi]
- Cryptographic Extraction and Key Derivation: The HKDF SchemeHugo Krawczyk. 631-648 [doi]
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGsAnindya De, Luca Trevisan, Madhur Tulsiani. 649-665 [doi]
- Pseudorandom Functions and Permutations Provably Secure against Related-Key AttacksMihir Bellare, David Cash. 666-684 [doi]
- Secure Two-Party Quantum Evaluation of Unitaries against Specious AdversariesFrédéric Dupuis, Jesper Buus Nielsen, Louis Salvail. 685-706 [doi]
- On the Efficiency of Classical and Quantum Oblivious Transfer ReductionsSeverin Winkler, Jürg Wullschleger. 707-723 [doi]
- Sampling in a Quantum Population, and ApplicationsNiek J. Bouman, Serge Fehr. 724-741 [doi]