Abstract is missing.
- MPC vs. SFE : Unconditional and Computational SecurityMartin Hirt, Ueli M. Maurer, Vassilis Zikas. 1-18 [doi]
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing SchemesZhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, Huaxiong Wang. 19-36 [doi]
- Graph Design for Secure Multiparty Computation over Non-Abelian GroupsXiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary. 37-53 [doi]
- Some Perspectives on Complexity-Based CryptographyAndrew Chi-Chih Yao. 54 [doi]
- A Modular Security Analysis of the TLS Handshake ProtocolPaul Morrissey, Nigel P. Smart, Bogdan Warinschi. 55-73 [doi]
- Ambiguous Optimistic Fair ExchangeQiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo. 74-89 [doi]
- Compact Proofs of RetrievabilityHovav Shacham, Brent Waters. 90-107 [doi]
- On the Security of HB# against a Man-in-the-Middle AttackKhaled Ouafi, Raphael Overbeck, Serge Vaudenay. 108-124 [doi]
- Hash Functions from Sigma Protocols and Improvements to VSHMihir Bellare, Todor Ristov. 125-142 [doi]
- Slide Attacks on a Class of Hash FunctionsMichael Gorski, Stefan Lucks, Thomas Peyrin. 143-160 [doi]
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric CryptographyUeli M. Maurer, Stefano Tessaro. 161-178 [doi]
- Universally Composable Adaptive Oblivious TransferMatthew Green, Susan Hohenberger. 179-197 [doi]
- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff VotingJason Keller, Joe Kilian. 198-215 [doi]
- Towards Robust Computation on Encrypted DataManoj Prabhakaran, Mike Rosulek. 216-233 [doi]
- Efficient Protocols for Set Membership and Range ProofsJan Camenisch, Rafik Chaabouni, Abhi Shelat. 234-252 [doi]
- Preimage Attacks on 3, 4, and 5-Pass HAVALYu Sasaki, Kazumaro Aoki. 253-271 [doi]
- How to Fill Up Merkle-Damgård Hash FunctionsKan Yasuda. 272-289 [doi]
- Limits of Constructive Security ProofsMichael Backes, Dominique Unruh. 290-307 [doi]
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman AssumptionGoichiro Hanaoka, Kaoru Kurosawa. 308-325 [doi]
- Twisted Edwards Curves RevisitedHüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson. 326-343 [doi]
- On the Validity of the phi-Hiding Assumption in Cryptographic ProtocolsChristian Schridde, Bernd Freisleben. 344-354 [doi]
- Chosen Ciphertext Security with Optimal Ciphertext OverheadMasayuki Abe, Eike Kiltz, Tatsuaki Okamoto. 355-371 [doi]
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice ProblemsAkinori Kawachi, Keisuke Tanaka, Keita Xagawa. 372-389 [doi]
- Rigorous and Efficient Short Lattice Vectors EnumerationXavier Pujol, Damien Stehlé. 390-405 [doi]
- Solving Linear Equations Modulo Divisors: On Factoring Given Any BitsMathias Herrmann, Alexander May. 406-424 [doi]
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good NonlinearityClaude Carlet, Keqin Feng. 425-440 [doi]
- An Improved Impossible Differential Attack on MISTY1Orr Dunkelman, Nathan Keller. 441-454 [doi]
- Generalized Identity Based and Broadcast Encryption SchemesDan Boneh, Michael Hamburg. 455-470 [doi]
- Speeding Up the Pollard Rho Method on Prime FieldsJung Hee Cheon, Jin Hong, Minkyu Kim. 471-488 [doi]
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH ProblemsAndy Rupp, Gregor Leander, Endre Bangerter, Alexander W. Dent, Ahmad-Reza Sadeghi. 489-505 [doi]
- OAEP Is Secure under Key-Dependent MessagesMichael Backes, Markus Dürmuth, Dominique Unruh. 506-523 [doi]
- Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear MasksJung-Keun Lee, Dong Hoon Lee 0002, Sangwoo Park. 524-538 [doi]
- A New Attack on the LEX Stream CipherOrr Dunkelman, Nathan Keller. 539-556 [doi]
- Breaking the F-FCSR-H Stream Cipher in Real TimeMartin Hell, Thomas Johansson. 557-569 [doi]