Encryption I

• 
  Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model. 1-18
• 
  Javier Herranz, Fabien Laguillaumie, Carla Ràfols: Constant Size Ciphertexts in Threshold Attribute-Based Encryption. 19-34

Cryptanalysis

• 
  Jean-Charles Faugère, Pierre-Jean Spaenlehauer: Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem. 35-52
• 
  Mathias Herrmann, Alexander May: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. 53-69
• 
  Jean-Charles Faugère, Raphaël Marinier, Guénaël Renault: Implicit Factoring with Shared Most Significant and Middle Bits. 70-87

Protocols I

• 
  Sven Laur, Helger Lipmaa: On the Feasibility of Consistent Computations. 88-106
• 
  Jens Groth, Aggelos Kiayias, Helger Lipmaa: Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. 107-123
• 
  Xinyi Huang, Yi Mu, Willy Susilo, Wei Wu, Yang Xiang: Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting. 124-141

Network Coding

• 
  Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin: Secure Network Coding over the Integers. 142-160
• 
  Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman: Preventing Pollution Attacks in Multi-source Network Coding. 161-176

Tools

• 
  Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi: Groth-Sahai Proofs Revisited. 177-192
• 
  Zhenfu Cao, Ivan Visconti, Zongyang Zhang: Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments. 193-208

Elliptic Curves

• 
  Robert Granger, Michael Scott: Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. 209-223
• 
  Craig Costello, Tanja Lange, Michael Naehrig: Faster Pairing Computations on Curves with High-Degree Twists. 224-242
• 
  Reza Rezaeian Farashahi, Marc Joye: Efficient Arithmetic on Hessian Curves. 243-260

Lossy Trapdoor Functions

• 
  Toshihide Matsuda, Ryo Nishimaki, Keisuke Tanaka: CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model. 261-278
• 
  David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. 279-295
• 
  Petros Mol, Scott Yilek: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. 296-311

Protocols II

• 
  Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. 312-331
• 
  Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen: Text Search Protocols with Simulation Based Security. 332-350

Discrete Logarithm

• 
  Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi: Solving a 676-Bit Discrete Logarithm Problem in GF(3⁶ⁿ). 351-367
• 
  Steven D. Galbraith, Raminder S. Ruprai: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. 368-383

Encryption II

• 
  Nuttapong Attrapadung, Benoît Libert: Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation. 384-402
• 
  Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. 403-419
• 
  Nigel P. Smart, Frederik Vercauteren: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. 420-443

Signatures

• 
  Christina Brzuska, Marc Fischlin, Anja Lehmann, Dominique Schröder: Unlinkability of Sanitizable Signatures. 444-461
• 
  Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder: Confidential Signatures and Deterministic Signcryption. 462-479
• 
  Ali Bagherzandi, Stanislaw Jarecki: Identity-Based Aggregate and Multi-Signature Schemes Based on RSA. 480-498
• 
  Xavier Boyen: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More. 499-517

last updated on Thu May 23 03:39:31 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page