Abstract is missing.
- On Ideal Lattices and Learning with Errors over RingsVadim Lyubashevsky, Chris Peikert, Oded Regev. 1-23 [doi]
- Fully Homomorphic Encryption over the IntegersMarten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan. 24-43 [doi]
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order GroupsDavid Mandell Freeman. 44-61 [doi]
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product EncryptionAllison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters. 62-91 [doi]
- Secure Obfuscation for Encrypted SignaturesSatoshi Hada. 92-112 [doi]
- Public-Key Encryption in the Bounded-Retrieval ModelJoël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs. 113-134 [doi]
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy CasesSebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan. 135-156 [doi]
- Partial Fairness in Secure Two-Party ComputationS. Dov Gordon, Jonathan Katz. 157-176 [doi]
- Secure Message Transmission with Small Public DiscussionJuan A. Garay, Clint Givens, Rafail Ostrovsky. 177-196 [doi]
- On the Impossibility of Three-Move Blind Signature SchemesMarc Fischlin, Dominique Schröder. 197-215 [doi]
- Efficient Device-Independent Quantum Key DistributionEsther Hänggi, Renato Renner, Stefan Wolf. 216-234 [doi]
- New Generic Algorithms for Hard KnapsacksNick Howgrave-Graham, Antoine Joux. 235-256 [doi]
- Lattice Enumeration Using Extreme PruningNicolas Gama, Phong Q. Nguyen, Oded Regev. 257-278 [doi]
- Algebraic Cryptanalysis of McEliece Variants with Compact KeysJean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich. 279-298 [doi]
- Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 RoundsAlex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir. 299-319 [doi]
- Cryptography between Wonderland and UnderlandMoti Yung. 320-321 [doi]
- Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and OthersAlex Biryukov, Ivica Nikolic. 322-344 [doi]
- Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTRKenneth G. Paterson, Gaven J. Watson. 345-361 [doi]
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening AttacksSerge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee. 381-402 [doi]
- Cryptographic Agility and Its Relation to Circular EncryptionTolga Acar, Mira Belenkiy, Mihir Bellare, David Cash. 403-422 [doi]
- Bounded Key-Dependent Message SecurityBoaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai. 423-444 [doi]
- Perfectly Secure Multiparty Computation and the Computational Overhead of CryptographyIvan Damgård, Yuval Ishai, Mikkel Krøigaard. 445-465 [doi]
- Adaptively Secure BroadcastMartin Hirt, Vassilis Zikas. 466-485 [doi]
- Universally Composable Quantum Multi-party ComputationDominique Unruh. 486-505 [doi]
- A Simple BGN-Type Cryptosystem from LWECraig Gentry, Shai Halevi, Vinod Vaikuntanathan. 506-522 [doi]
- Bonsai Trees, or How to Delegate a Lattice BasisDavid Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert. 523-552 [doi]
- Efficient Lattice (H)IBE in the Standard ModelShweta Agrawal, Dan Boneh, Xavier Boyen. 553-572 [doi]
- Multi-property-preserving Domain Extension Using Polynomial-Based Modes of OperationJooyoung Lee, John P. Steinberger. 573-596 [doi]
- Stam s Collision Resistance ConjectureJohn P. Steinberger. 597-615 [doi]
- Universal One-Way Hash Functions via Inaccessible EntropyIftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee. 616-637 [doi]
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way FunctionsRafael Pass, Hoeteck Wee. 638-655 [doi]
- Constructing Verifiable Random Functions with Large Input SpacesSusan Hohenberger, Brent Waters. 656-672 [doi]
- Adaptive Trapdoor Functions and Chosen-Ciphertext SecurityEike Kiltz, Payman Mohassel, Adam O Neill. 673-692 [doi]