Home page

Call for papers

Submission

Accepted papers

Program

Venue

Accommodation

Travel info

Registration

Related Events

Contact

 

 

Sponsors

1. Constant Size Ciphertexts in Threshold Attribute-Based Encryption
   Javier Herranz, Fabien Laguillaumie, and Carla Rafols
   Universitat Politecnica de Catalunya and Universite de Caen-Basse Normandie

2. Groth-Sahai Proofs Revisited
   E. Ghadafi, N.P. Smart, and B. Warinschi
   University of Bristol

3. Secure Network Coding Over the Integers
   Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, and Tal Rabin
   IBM Research and University of Maryland

4. Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
   N.P. Smart and F. Vercauteren
   University of Bristol and K.U. Leuven

5. Solving a 676-bit Discrete Logarithm Problem in GF(3⁶ⁿ)
   Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'ichiro Matsuo, Masaaki Shirase, and Tsuyoshi Takagi
   Future University Hakodate, National Institute of Information and Communications Technology, Japan

6. Unlinkability of Sanitizable Signatures
   Christina Brzuska, Marc Fischlin, Anja Lehmann, and Dominique Schroeder
   Darmstadt University of Technology, Germany

7. Faster Algorithms for the Discrete Logarithm Problem in a Short Interval
   Steven Galbraith and Raminder Ruprai
   Mathematics Department, Auckland University, Auckland, New Zealand and Mathematics Department, Royal Holloway University of London, Egham, Surrey, UK

8. Efficient Set Operations in the Presence of Malicious Adversaries
   Carmit Hazay and Kobbi Missim
   Weizmann Institute and IDC, and Ben-Gurion University and Microsoft ILDC

9. Text Search Protocols with Simulation Based Security
   Rosario Gennaro, Carmit Hazay and Jeffrey S. Sorensen
   Weizmann Institute and IDC, and IBM T.J.Watson Research Center in New-York

10. On the Feasibility of Consistent Computations
    Sven Laur and Helger Lipmaa
    University of Tartu, Estonia and Cybernetica AS, Estonia

11. Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
    Robert Granger and Michael Scott
    Claude Shannon Institute, Dublin City University

12. Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
    Petros Mol and Scott Yilek
    UC San Diego and UC San Diego

13. Confidential Signatures and Deterministic Signcryption
    Alexander W. Dent, Marc Fischlin, Mark Manulis, Dominique Schroeder, and Martijn Stam
    Royal Holloway, University of London, Technische Universitat Darmstadt, and Ecole Polytechnique Federale de Lausanne

14. CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model
    Toshihide Matsuda, Ryo Nishimaki, and Keisuke Tanaka
    Department of Mathematical and Computing Science, Tokyo Institute of Technology, Japan and NTT Laboratories, Japan

15. Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
    Zhenfu Cao, Ivan Visconti, and Zongyang Zhang
    Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R.China and Dipartimento di Informatica ed Applicazioni, University of Salerno, Italy

16. Security of Encryption Schemes in the Weakened Random Oracle Models
    Akinori Kawachi, Akira Numayama, Keisuke Tanaka, and Keita Xagawa
    Tokyo Institute of University

17. Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting
    Wei Wu, Xinyi Huang, Yi Mu, Willy Susilo, and Yang Xiang
    University of Wollongong, Australia and Central Queensland University, Australia

18. Faster Pairing Computations on Curves with High-Degree Twists
    Craig Costello, Tanja Lange, Michael Naehrig
    Queensland University of Technology and Technische Universiteit Eindhoven

19. Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
    Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, and Victor Shoup
    New York University, Horst Gortz Institute Bochum, and CWI Amsterdam

20. Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate
    Jens Groth, Aggelos Kiayias, and Helger Lipmaa
    University College London, University of Athens and University of Connecticut, and Cybernetica AS

21. More Constructions of Lossy and Correlation-Secure Trapdoor Functions
    David Freeman and Oded Goldreich and Eike Kiltz and Alon Rosen and Gil Segev
    CWI Amsterdam, Weizmann, Efi Arazi School of Computer Science

22. Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
    Nuttapong Attrapadung and Benoit Libert
    AIST, Japan and Universite catholique de Louvain, Belgium

23. Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
    Mathias Herrmann and Alexander May
    Horst Goertz Insitute for IT Security, Ruhr Univerity Bochum

24. Preventing Pollution Attacks in Multi-Source Network Coding
    Shweta Agrawal, Dan Boneh, Xavier Boyen, and David Mandell Freeman
    University of Texas at Austin, Stanford University, and CWI and Universiteit Leiden

25. Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
    Jean-Charles Faugere and Pierre-Jean Spaenlehauer
    SALSA team, INRIA/UPMC/LIP6

26. Efficient arithmetic on Hessian curves
    Reza Rezaeian Farashahi and Marc Joye
    Department of Computing, Macquarie University, Sydney, Australia and Technicolor, Security Competence Center, France

27. Implicit Factoring with Shared Most Significant and Middle Bits
    Jean-Charles Faugere, Raphael Marinier, and Guenael Renault
    UPMC, Univ Paris 06, LIP6, INRIA, Centre Paris-Rocquencourt, SALSA Project

28. Of Lettuces of Lattices : a Framework for Short Signatures and IBE with Full Security
    Xavier Boyen
    Stanford University

29. Identity-Based Multi-Signatures and Aggregate Signatures based on RSA
    Ali Bagherzandi and Stanislaw Jarecki
    UC Irvine

Mentions légales