Abstract is missing.
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard ModelKristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup. 1-18 [doi]
- Constant Size Ciphertexts in Threshold Attribute-Based EncryptionJavier Herranz, Fabien Laguillaumie, Carla Ràfols. 19-34 [doi]
- Algebraic Cryptanalysis of the PKC 2009 Algebraic Surface CryptosystemJean-Charles Faugère, Pierre-Jean Spaenlehauer. 35-52 [doi]
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSAMathias Herrmann, Alexander May. 53-69 [doi]
- Implicit Factoring with Shared Most Significant and Middle BitsJean-Charles Faugère, Raphaël Marinier, Guénaël Renault. 70-87 [doi]
- On the Feasibility of Consistent ComputationsSven Laur, Helger Lipmaa. 88-106 [doi]
- Multi-query Computationally-Private Information Retrieval with Constant Communication RateJens Groth, Aggelos Kiayias, Helger Lipmaa. 107-123 [doi]
- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user SettingXinyi Huang, Yi Mu, Willy Susilo, Wei Wu, Yang Xiang. 124-141 [doi]
- Secure Network Coding over the IntegersRosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin. 142-160 [doi]
- Preventing Pollution Attacks in Multi-source Network CodingShweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman. 161-176 [doi]
- Groth-Sahai Proofs RevisitedEssam Ghadafi, Nigel P. Smart, Bogdan Warinschi. 177-192 [doi]
- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and DecommitmentsZhenfu Cao, Ivan Visconti, Zongyang Zhang. 193-208 [doi]
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree ExtensionsRobert Granger, Michael Scott. 209-223 [doi]
- Faster Pairing Computations on Curves with High-Degree TwistsCraig Costello, Tanja Lange, Michael Naehrig. 224-242 [doi]
- Efficient Arithmetic on Hessian CurvesReza Rezaeian Farashahi, Marc Joye. 243-260 [doi]
- CCA Proxy Re-Encryption without Bilinear Maps in the Standard ModelToshihide Matsuda, Ryo Nishimaki, Keisuke Tanaka. 261-278 [doi]
- More Constructions of Lossy and Correlation-Secure Trapdoor FunctionsDavid Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev. 279-295 [doi]
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor FunctionsPetros Mol, Scott Yilek. 296-311 [doi]
- Efficient Set Operations in the Presence of Malicious AdversariesCarmit Hazay, Kobbi Nissim. 312-331 [doi]
- Text Search Protocols with Simulation Based SecurityRosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen. 332-350 [doi]
- Solving a 676-Bit Discrete Logarithm Problem in GF(3:::6::::n:::::::)Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi. 351-367 [doi]
- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short IntervalSteven D. Galbraith, Raminder S. Ruprai. 368-383 [doi]
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for NegationNuttapong Attrapadung, Benoît Libert. 384-402 [doi]
- Security of Encryption Schemes in Weakened Random Oracle ModelsAkinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa. 403-419 [doi]
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext SizesNigel P. Smart, Frederik Vercauteren. 420-443 [doi]
- Unlinkability of Sanitizable SignaturesChristina Brzuska, Marc Fischlin, Anja Lehmann, Dominique Schröder. 444-461 [doi]
- Confidential Signatures and Deterministic SigncryptionAlexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder. 462-479 [doi]
- Identity-Based Aggregate and Multi-Signature Schemes Based on RSAAli Bagherzandi, Stanislaw Jarecki. 480-498 [doi]
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and MoreXavier Boyen. 499-517 [doi]