Abstract is missing.
- The Arithmetic Codex: Theory and ApplicationsRonald Cramer. 1 [doi]
- Lattice Reduction Algorithms: Theory and PracticePhong Q. Nguyen. 2-6 [doi]
- Efficient Authentication from Hard Learning ProblemsEike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain 0002, Daniele Venturi. 7-26 [doi]
- Making NTRU as Secure as Worst-Case Problems over Ideal LatticesDamien Stehlé, Ron Steinfeld. 27-47 [doi]
- Faster Explicit Formulas for Computing Pairings over Ordinary CurvesDiego F. Aranha, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López. 48-68 [doi]
- Pushing the Limits: A Very Compact and a Threshold Implementation of AESAmir Moradi, Axel Poschmann, San Ling, Christof Paar, Huaxiong Wang. 69-88 [doi]
- Fully Leakage-Resilient SignaturesElette Boyle, Gil Segev, Daniel Wichs. 89-108 [doi]
- A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale DevicesMathieu Renauld, François-Xavier Standaert, Nicolas Veyrat-Charvillon, Dina Kamel, Denis Flandre. 109-128 [doi]
- Implementing Gentry s Fully-Homomorphic Encryption SchemeCraig Gentry, Shai Halevi. 129-148 [doi]
- Homomorphic Signatures for Polynomial FunctionsDan Boneh, David Mandell Freeman. 149-168 [doi]
- Semi-homomorphic Encryption and Multiparty ComputationRikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias. 169-188 [doi]
- Tight Proofs for Signature Schemes without Random OraclesSven Schäge. 189-206 [doi]
- Adaptive Pseudo-free Groups and ApplicationsDario Catalano, Dario Fiore, Bogdan Warinschi. 207-223 [doi]
- Commuting Signatures and Verifiable EncryptionGeorg Fuchsbauer. 224-245 [doi]
- Secure Authentication from a Weak Key, without Leaking InformationNiek J. Bouman, Serge Fehr. 246-265 [doi]
- Secret Keys from Channel NoiseHadi Ahmadi, Reihaneh Safavi-Naini. 266-283 [doi]
- Almost Optimum ::::t::::-Cheater Identifiable Secret Sharing SchemesSatoshi Obana. 284-302 [doi]
- On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFINGregor Leander. 303-322 [doi]
- Domain Extension for MACs Beyond the Birthday BarrierYevgeniy Dodis, John P. Steinberger. 323-342 [doi]
- Statistical Attack on RC4 - Distinguishing WPAPouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux. 343-363 [doi]
- Improved Generic Algorithms for Hard KnapsacksAnja Becker, Jean-Sébastien Coron, Antoine Joux. 364-385 [doi]
- Two-Output Secure Computation with Malicious AdversariesAbhi Shelat, Chih-Hao Shen. 386-405 [doi]
- Efficient Non-interactive Secure ComputationYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai. 406-425 [doi]
- Towards a Game Theoretic View of Secure ComputationGilad Asharov, Ran Canetti, Carmit Hazay. 426-445 [doi]
- Highly-Efficient Universally-Composable Commitments Based on the DDH AssumptionYehuda Lindell. 446-466 [doi]
- Concurrent Composition in the Bounded Quantum Storage ModelDominique Unruh. 467-486 [doi]
- Careful with Composition: Limitations of the Indifferentiability FrameworkThomas Ristenpart, Hovav Shacham, Thomas Shrimpton. 487-506 [doi]
- Efficient Circuit-Size Independent Public Key Encryption with KDM SecurityTal Malkin, Isamu Teranishi, Moti Yung. 507-526 [doi]
- Key-Dependent Message Security: Generic Amplification and CompletenessBenny Applebaum. 527-546 [doi]
- Unbounded HIBE and Attribute-Based EncryptionAllison B. Lewko, Brent Waters. 547-567 [doi]
- Decentralizing Attribute-Based EncryptionAllison B. Lewko, Brent Waters. 568-588 [doi]
- Threshold and Revocation Cryptosystems via Extractable Hash ProofsHoeteck Wee. 589-609 [doi]
- Deniable Encryption with Negligible Detection Probability: An Interactive ConstructionMarkus Dürmuth, David Mandell Freeman. 610-626 [doi]