The 14th IACR International Conference on Practice and Theory in Public Key Cryptography PKC 2011 March 6—9, 2011, Taormina, Italy

Accepted Papers

• Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
  Qixiang Mei (Graduate University of Chinese Academy of Sciences and Gunangdong Ocean University), Bao Li, Xianhui Lu and Dingding Jia (Graduate University of Chinese Academy of Sciences)
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
  Dan Boneh and David Mandell Freeman (Stanford University, USA)
• Fully Secure Accountable-Authority Identity-Based Encryption
  Amit Sahai (UCLA - Computer Science) and Hakan Seyalioglu (UCLA - Mathematics)
• Cryptanalysis of the RSA subgroup Assumption from TCC 2005
  Jean-Sebastien Coron (University of Luxembourg), Antoine Joux (DGA and University of Versailles), Avradip Mandal (University of Luxembourg), David Naccache (ENS) and Mehdi Tibouchi (ENS and University of Luxembourg)
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
  Brent Waters (University of Texas at Austin)
• Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials
  Vivien Dubois (DGA/MI, Rennes) and Jean-Gabriel Kammerer (DGA/MI, Rennes and IRMAR, Université de Rennes 1)
• Linear Recurring Sequences for the UOV Key Generation
  Albrecht Petzoldt, Stanislav Bulygin and Johannes Buchmann (TU Darmstadt)
• (If) Size Matters: Size-Hiding Private Set Intersection
  Giuseppe Ateniese (Johns Hopkins University), Emiliano De Cristofaro, and Gene Tsudik (University of California, Irvine)
• On Impossibility of Instantiating PSS in the Standard Model
  Rishiraj Bhattacharyya (Indian Statistical Institute, Kolkata) and Avradip Mandal (University of Luxembourg, Luxembourg)
• Chosen-Ciphertext Security Based on Chameleon Lossy Trapdoor Functions
  Junzuo Lai, Robert H. Deng (Singapore Management University) and Shengli Liu (Shanghai Jiao Tong University)
• Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three
  Roberto Avanzi (Ruhr University of Bochum) and Clemens Heuberger (Technical University of Graz)
• Sub-Linear, Secure Comparison With Two Non-Colluding Parties
  Tomas Toft (Aarhus University, Denmark)
• Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
  Shota Yamada (The University of Tokyo), Nuttapong Attrapadung, Goichiro Hanaoka (National Institute of Advanced Industrial Science and Technology) and Noboru Kunihiro (The University of Tokyo)
• Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
  Luk Bettale, Jean-Charles Faugère and Ludovic Perret (INRIA/CNRS/UMPC, France)
• Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra
  Jae Hong Seo (Seoul National University, Korea)
• On the Security of a Bidirectional Proxy Re-Encryption Scheme from PKC 2010
  Jian Weng (Jinan University, Guangzhou, China), Yunlei Zhao (Fudan University, Shanghai, China), Goichiro Hanaoka (National Institute of Advanced Industrial Science and Technology, Tokyo, Japan)
• Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
  Nuttapong Attrapadung (Research Center for Information Security, AIST, Japan), and Benoit Libert (Universite catholique de Louvain, Belgium) and Elie de Panafieu (Ecole Normale Superieure - Cachan, France)
• Randomizable Signatures on Encrypted Messages
  Olivier Blazy (ENS, Paris, France), Georg Fuchsbauer (Univ. Bristol, UK), David Pointcheval (ENS, Paris, France), and Damien Vergnaud (ENS, Paris, France)
• One-Pass HMQV and Asymmetric Key-Wrapping
  Shai Halevi and Hugo Krawczyk (IBM Research)
• On-line Non-transferable Signatures Revisited
  Jacob C.N. Schuldt (RCIS, AIST, Japan) and Kanta Matsuura (IIS, The University of Tokyo)
• Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks
  Takahiro Matsuda and Kanta Matsuura (The University of Tokyo)
• Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model
  Tatsuaki Okamoto (NTT) and Katsuyuki Takashima (Mitsubishi Electric)
• Revocation for Delegatable Anonymous Credentials
  Lan Nguyen and Tolga Acar (Microsoft Research)
• Homomorphic Network Coding Signatures in the Standard Model
  Nuttapong Attrapadung (Research Center for Information Security, AIST, Japan) and Benoit Libert (Universite catholique de Louvain, Belgium)
• Oblivious Transfer with Hidden Access Control Policies
  Jan Camenisch, Maria Dubovitskaya, Gregory Neven (IBM Research - Zurich), and Gregory M. Zaverucha (Certicom Research)
• Secure Blind Decryption
  Matthew Green (Johns Hopkins University)
• Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
  Charles Bouillaguet (ENS, France), Jean-Charles Faugère (INRIA/CNRS/UMPC, France), Pierre-Alain Fouque (ENS, France) and Ludovic Perret (INRIA/CNRS/UMPC, France)
• On the correct use of the negation map in the Pollard rho method
  Daniel J. Bernstein (University of Illinois at Chicago), Tanja Lange and Peter Schwabe (Technische Universiteit Eindhoven)