September 3-5, 2014, Amalfi, Italy.

Accepted papers

  1. Universally Composable Non-Interactive Key Exchange
    Eduarda S.V. Freire (Royal Holloway, University of London, United Kingdom), Julia Hesse (Karlsruhe Institute of Technology, Germany), Dennis Hofheinz (Karlsruhe Institute of Technology, Germany)
  2. Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
    Katsuyuki Takashima (Mitsubishi Electric, Japan)
  3. Faster Maliciously Secure Two-Party Computation Using the GPU
    Tore K. Frederiksen (Aarhus University, Denmark), Thomas P. Jakobsen (Aarhus University, Denmark), Jesper B. Nielsen (Aarhus University, Denmark)
  4. Key-Indistinguishable Message Authentication Codes
    Joel Alwen (ETH Zurich, Switzerland), Martin Hirt (ETH Zurich, Switzerland), Ueli Maurer (ETH Zurich, Switzerland), Arpita Patra (IISc Bangalore, India), Pavel Raykov (ETH Zurich, Switzerland)
  5. Forward Secure Non-Interactive Key Exchange
    David Pointcheval (ENS, CNRS & INRIA, France), Olivier Sanders (ENS and Orange Labs, France)
  6. On the Classification of Finite Boolean Functions up to Fairness
    Nikolaos Makriyannis (Universitat Pompeu Fabra, Barcelona, Spain)
  7. Efficient Proofs of Secure Erasure
    Nikolaos P. Karvelas (TU Darmstadt, Germany), Aggelos Kiayias (University of Athens, Greece)
  8. Interactive Encryption and Message Authentication
    Yevgeniy Dodis (New York University, USA), Dario Fiore (IMDEA Software Institute, Madrid, Spain)
  9. Semi-Adaptive Attribute-Based Encryption and Improved Delegation for Boolean Formula
    Jie Chen (East China Normal University, Shanghai, China), Hoeteck Wee (ENS Paris, France)
  10. Obfuscation ==> (IND-CPA Security =/=> Circular Security)
    Antonio Marcedone (Cornell University, USA and Scuola Superiore di Catania, University of Catania, Italy), Claudio Orlandi (Aarhus University, Denmark)
  11. Publicly Auditable Secure Multi-Party Computation
    Carsten Baum (Aarhus University, Denmark), Ivan Damgärd (Aarhus University, Denmark), Claudio Orlandi (Aarhus University, Denmark)
  12. Statistics on password re-use and adaptive strength for financial accounts
    Daniel V. Bailey (Horst Görtz Institute for IT Security, Germany) Markus Dürmuth (Horst Görtz Institute for IT Security, Germany), Christof Paar (Horst Görtz Institute for IT Security, Germany)
  13. Generic Attacks on Strengthened HMAC: $n$-bit Secure HMAC Requires Key in All Blocks
    Yu Sasaki (NTT Secure Platform Laboratories, Tokyo, Japan), Lei Wang (Nanyang Technological University, Singapore)
  14. Communication-Efficient MPC for General Adversary Structures
    Joshua Lampkins (University of California, Los Angeles, USA), Rafail Ostrovsky (University of California, Los Angeles, USA)
  15. Improved Indifferentiable Security Analysis of PHOTON
    Yusuke Naito (Mitsubishi Electric Corporation and The University of Electro-Communications, Tokyo, Japan), Kazuo Ohta (The University of Electro-Communications, Tokyo, Japan)
  16. Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues
    Takashi Yamakawa (The University of Tokyo, Japan), Shota Yamada (AIST and RISEC, Japan), Koji Nuida (AIST and RISEC, Japan), Goichiro Hanaoka (AIST and RISEC, Japan), Noboru Kunihiro (The University of Tokyo, Japan)
  17. Secure Key Exchange and Sessions Without Credentials
    Ran Canetti (Boston University, USA), Vladimir Kolesnikov (Bell Labs, USA), Charles Rackoff (University of Toronto, Canada), Yevgeniy Vahlis (Bionym Inc, Toronto, Canada)
  18. Reducing the Overhead of MPC over a Large Population
    Ashish Choudhury (IIIT Bangalore, India) Arpita Patra (IISc Bangalore, India), Nigel P. Smart (University of Bristol, UK)
  19. Relaxed Two-to-one Recoding Schemes
    Omkant Pandey (University of Illinois, Urbana-Champaign, USA), Kim Ramchen (University of Texas at Austin, USA), Brent Waters (University of Texas at Austin, USA)
  20. Constrained Verifiable Random Functions
    Georg Fuchsbauer (Institute of Science and Technology, Austria)
  21. Systematizing Secure Computation for Research and Decision Support
    Jason Perry (Rutgers University, USA), Debayan Gupta (Yale University, USA), Joan Feigenbaum (Yale University, USA), Rebecca N. Wright (Rutgers University, USA)
  22. Proofs of Space: When Space is of the Essence
    Giuseppe Ateniese (Sapienza Univ. of Rome, Italy), Ilario Bonacina (Sapienza Univ. of Rome, Italy), Antonio Faonio (Sapienza Univ. of Rome, Italy), Nicola Galesi (Sapienza Univ. of Rome, Italy)
  23. Efficient Network-Based Enforcement of Data Access Rights
    Paul Giura (AT&T Security Research Center, New York, NY, USA), Vladimir Kolesnikov (Bell Labs, Murray Hill, NJ, USA), Aris Tentes (New York University, New York, USA), Yevgeniy Vahlis (Bionym Inc, Toronto, Canada)
  24. Efficient NIZK Arguments via Parallel Verification of Benes Networks
    Helger Lipmaa (University of Tartu, Estonia)
  25. An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation
    Ivan Damgärd (Aarhus University, Denmark), Rasmus Lauritsen (Aarhus University, Denmark), Tomas Toft (Aarhus University, Denmark)
  26. On Selective-Opening Attacks Against Encryption Schemes
    Rafail Ostrovsky (UCLA, USA) Vanishree Rao (UCLA, USA), Ivan Visconti (University of Salerno, Italy)
  27. EyeDecrypt -- Private Interactions in Plain Sight
    Andrea Forte (AT&T Labs, USA), Juan Garay (Yahoo Labs, USA), Trevor Jim (AT&T Labs, USA), Yevgeniy Vahlis (Byonim Inc, Toronto, Canada)
  28. Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
    Abhishek Jain (Boston University and MIT, USA), Omkant Pandey (UIUC, Urbana-Champaign, USA)
  29. Narrow Bandwidth is Not Inherent in Reverse Public-Key Encryption
    David Naccache (ENS, Paris, France), Rainer Steinwandt (Florida Atlantic University, USA), Adriana Suiárez (Universidad de Léon, Spain), Moti Yung (Google Inc. and Columbia University)
  30. On Adaptively Secure Protocols
    Muthuramakrishnan Venkitasubramaniam (University of Rochester, USA)
  31. Publicly Evaluable Pseudorandom Functions and Their Applications
    Yu Chen (Chinese Academy of Sciences, China), Zongyang Zhang (National Institute of Advanced Industrial Science and Technology, Japan)