September 5-7, 2012, Amalfi, Italy.

Accepted papers

  1. Efficiency Limitations of Σ-protocols for Group Homomorphisms Revisited
    Björn Terelius (KTH Royal Institute of Technology, Sweden) and Douglas Wikström (KTH Royal Institute of Technology, Sweden)
  2. Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
    Xiang Xie (Chinese Academy of Sciences, China), Rui Xue (Chinese Academy of Sciences, China), Rui Zhang (Chinese Academy of Sciences, China)
  3. On the Strength Comparison of the ECDLP and the IFP
    Masaya Yasuda (Fujitsu Laboratories LTD., Japan), Takeshi Shimoyama (Fujitsu Laboratories LTD., Japan), Jun Kogure (Fujitsu Laboratories LTD., Japan) and Tetsuya Izu (Fujitsu Laboratories LTD., Japan)
  4. Ring Switching in BGV-Style Homomorphic Encryption
    Craig Gentry (IBM Research, USA), Shai Halevi (IBM Research, USA), Chris Peikert (Georgia Institute of Technology, USA) and Nigel P. Smart (University of Bristol, UK)
  5. Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
    Ivan Damgård (Aarhus University, Denmark) and Adriana López-Alt (NYU, USA)
  6. History-Free Sequential Aggregate Signatures
    Marc Fischlin (TU Darmstadt, Germany), Anja Lehmann (IBM Research Zurich, Switzerland) and Dominique Schröder (University of Maryland, USA)
  7. Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
    Ivan Damgård (Aarhus University, Denmark), Marcel Keller (University of Bristol, UK), Enrique Larraia (University of Bristol, UK), Christian Miles (University of Bristol, UK) and Nigel P. Smart (University of Bristol, UK)
  8. Decentralized Dynamic Broadcast Encryption
    Duong Hieu Phan (University of Paris 8/ENS/CNRS/INRIA, France), David Pointcheval (ENS/CNRS/INRIA, France) and Mario Strefler (ENS/CNRS/INRIA, France)
  9. Compact Round-Optimal Partially-Blind Signatures
    Olivier Blazy (ENS Paris, France), David Pointcheval (ENS Paris, France ) and Damien Vergnaud (ENS Paris, France )
  10. Hash Combiners for Second Pre-Image Resistance, Target Collision Resistance and Pre-Image Resistance have Long Output
    Arno Mittelbach (Darmstadt University of Technology & CASED, Germany)
  11. Public-Key Encryption with Lazy Parties
    Kenji Yasunaga (ISIT, Japan)
  12. Time-Specific Encryption from Forward-Secure Encryption
    Kouhei Kasamatsu (Chuo University, Japan), Takahiro Matsuda (AIST, Japan), Keita Emura (NICT, Japan), Nuttapong Attrapadung (AIST, Japan), Goichiro Hanaoka (AIST, Japan) and Hideki Imai (Chuo University, Japan)
  13. 5PM: Secure Pattern Matching
    Joshua Baron (UCLA, USA), Karim El Defrawy (HRL Laboratories, USA), Kirill Minkovich (HRL Laboratories, USA), Rafail Ostrovsky (UCLA, USA) and Eric Tressler (HRL Laboratories USA)
  14. Active Security in Multiparty Computation over Black-Box Groups
    Yvo Desmedt (UCL, UK) Josef Piperzyk (Macquarie University, Australia) Ron Steinfeld (Monash University, Australia)
  15. Fully Anonymous Attribute Tokens from Lattices
    Jan Camenisch (IBM Research Zurich, Switzerland) and Gregory Neven (IBM Research Zurich, Switzerland), Markus Rückert
  16. Multiple Differential Cryptanalysis using LLR and Χ2 Statistics
    Céline Blondeau (Aalto University School of Science, Finland), Benoît Gérard (Universitè catholique de Louvain, Belgium) and Kaisa Nyberg (Aalto University School of Science, Finland)
  17. A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument
    Helger Lipmaa (University of Tartu, Estonia), Bingsheng Zhang (State University of New York at Buffalo, USA)
  18. Publicly Verifiable Ciphertexts
    Juan Manuel Gonzàlez Nieto (Queensland University of Technology, Australia), Mark Manulis (University of Surrey, UK), Bertram Poettering (Royal Holloway University of London, UK), Jothi Rangasamy (Queensland University of Technology, Australia) and Douglas Stebila (Queensland University of Technology, Australia)
  19. Homomorphic Encryption for Multiplications and Pairing Evaluation
    Guilhem Castagnos (Université o fBordeaux 1/CNRS, France), Fabien Laguillaumie (Université de Caen Basse-Normandie/CNRS/ENSL/INRIA/UCBL LIP, France)
  20. Quo Vadis Quaternion? Cryptanalysis of Rainbow over Non-Commutative Rings
    Enrico Thomae (Ruhr-University of Bochum, Germany)
  21. Human Perfectly Secure Message Transmission Protocols and their Applications
    Stelios Erotokritou (UCL, UK and The Cyprus Institute, Cyprus), Yvo Desmedt (UCL, UK)
  22. Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
    Jan Camenisch (IBM Research Zurich, Switzerland), Robert R. Enderlein (IBM Research Zurich, ETHZ, Switzerland), Maria Dubovitskaya (IBM Research Zurich, ETHZ, Switzerland) and Gregory Neven (IBM Research Zurich, Switzerland)
  23. Efficient Structure-Preserving Signature Scheme from Standard Assumptions
    Jan Camenisch (IBM Research Zurich, Switzerland), Maria Dubovitskaya (IBM Research Zurich, ETHZ, Switzerland) and Kristiyan Haralambiev (IBM Research Zurich, Switzerland)
  24. On The Centrality of Off-Line E-Cash to Concrete Partial Information Games
    Seung Geol Choi (University of Maryland, USA), Dana Dachman-Soled (Microsoft Research New England, USA) and Moti Yung (Google & Columbia University, USA)
  25. A New Hash and Sign Approach and Structure-Preserving Signatures from DLIN
    Melissa Chase (Microsoft Research, USA) and Markulf Kohlweiss (Microsoft Research, USA)
  26. Universally Composable Security With Local Adversaries
    Ran Canetti (Boston University, USA) and Margarita Vald (Tel Aviv University, Israel)
  27. MAC Aggregation with Message Multiplicity
    Vladimir Kolesnikov (Bell Labs, USA)
  28. New Attacks for Knapsack Based Cryptosystems
    Gottfried Herold (Ruhr-University Bochum, Germany) and Alexander Meurer (Ruhr-University Bochum, Germany)
  29. Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
    Ching-Hua Yu (National Taiwan University, Taiwan) and Bo-Yin Yang (Academia Sinica, Taiwan)
  30. Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
    Vladimir Kolesnikov (Bell Labs, USA) Ranjit Kumaresan (University of Maryland, USA)
  31. Blackbox Construction of A More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
    Steven Myers (Indiana University, USA), Mona Sergi (University of Virginia, USA) and abhi shelat (University of Virginia, USA)