Abstract is missing.
- A Practical Attack on KeeLoqSebastiaan Indesteege, Nathan Keller, Orr Dunkelman, Eli Biham, Bart Preneel. 1-18 [doi]
- Key Recovery on Hidden Monomial Multivariate SchemesPierre-Alain Fouque, Gilles Macario-Rat, Jacques Stern. 19-30 [doi]
- Predicting Lattice ReductionNicolas Gama, Phong Q. Nguyen. 31-51 [doi]
- Efficient Sequential Aggregate Signed DataGregory Neven. 52-69 [doi]
- Proving Tight Security for Rabin-Williams SignaturesDaniel J. Bernstein. 70-87 [doi]
- Threshold RSA for Dynamic and Ad-Hoc GroupsRosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin. 88-107 [doi]
- Towards Key-Dependent Message Security in the Standard ModelDennis Hofheinz, Dominique Unruh. 108-126 [doi]
- The Twin Diffie-Hellman Problem and ApplicationsDavid Cash, Eike Kiltz, Victor Shoup. 127-145 [doi]
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner ProductsJonathan Katz, Amit Sahai, Brent Waters. 146-162 [doi]
- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic CurvesBenjamin Smith. 163-180 [doi]
- On the Indifferentiability of the Sponge ConstructionGuido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche. 181-197 [doi]
- A New Mode of Operation for Block Ciphers and Length-Preserving MACsYevgeniy Dodis, Krzysztof Pietrzak, Prashant Puniya. 198-219 [doi]
- Security/Efficiency Tradeoffs for Permutation-Based HashingPhillip Rogaway, John P. Steinberger. 220-236 [doi]
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5Lei Wang, Kazuo Ohta, Noboru Kunihiro. 237-253 [doi]
- Collisions for the LPS Expander Graph Hash FunctionJean-Pierre Tillich, Gilles Zémor. 254-269 [doi]
- Second Preimage Attacks on Dithered Hash FunctionsElena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer. 270-288 [doi]
- Efficient Two Party and Multi Party Computation Against Covert AdversariesVipul Goyal, Payman Mohassel, Adam Smith. 289-306 [doi]
- Almost-Everywhere Secure ComputationJuan A. Garay, Rafail Ostrovsky. 307-323 [doi]
- Truly Efficient 2-Round Perfectly Secure Message Transmission SchemeKaoru Kurosawa, Kazuhiro Suzuki. 324-340 [doi]
- Protocols and Lower Bounds for Failure Localization in the InternetBoaz Barak, Sharon Goldberg, David Xiao. 341-360 [doi]
- HB:::#:::: Increasing the Security and Efficiency of HB:::+:::Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin. 361-378 [doi]
- Sub-linear Zero-Knowledge Argument for Correctness of a ShuffleJens Groth, Yuval Ishai. 379-396 [doi]
- Precise Concurrent Zero KnowledgeOmkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam. 397-414 [doi]
- Efficient Non-interactive Proof Systems for Bilinear GroupsJens Groth, Amit Sahai. 415-432 [doi]
- Zero-Knowledge Sets with Short ProofsDario Catalano, Dario Fiore, Mariagrazia Messina. 433-450 [doi]
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on CurvesHao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo. 451-470 [doi]
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy ExtractorsRonald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs. 471-488 [doi]
- Obfuscating Point Functions with Multibit OutputRan Canetti, Ronny Ramzi Dakdouk. 489-508 [doi]
- Isolated Proofs of Knowledge and Isolated Zero KnowledgeIvan Damgård, Jesper Buus Nielsen, Daniel Wichs. 509-526 [doi]
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof HardwareTal Moran, Gil Segev. 527-544 [doi]
- New Constructions for UC Secure Computation Using Tamper-Proof HardwareNishanth Chandran, Vipul Goyal, Amit Sahai. 545-562 [doi]