PKC 2014

The 17th IACR International Conference on
  Practice and Theory of Public-Key Cryptography

Buenos Aires, Argentina, March 26-28, 2014

Important Dates
Submission: Oct. 8, 2013
Notification: Dec. 16, 2013
Camera-ready: Jan. 13, 2014


News
Jun. 4: Website is online.
Jul. 25: Published submission instructions.
Sep. 13: Submission server is operational.
Sep. 28: Submission deadline postponed to Oct. 8.
Oct. 8: Closed submissions server.
Dec. 27: Published accepted papers; added travel information (VISA requirements).
Dec. 30: Registration site is open; published information for students (see Registration).
Jan. 20: Program is online.
Jan. 29: Added tourism information (under Travel Information).
Feb. 3: Published last invited talk.
Feb. 13: Published cheaper price for the conference's Hotel accomodations.

Accepted Papers

Online/Offline Attribute-Based Encryption
Susan Hohenberger (Johns Hopkins University); Brent Waters (University of Texas at Austin)

Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications
Alex Escala (Scytl Secure Electronic Voting, Spain); Javier Herranz (Universitat Politècnica de Catalunya - BarcelonaTech, Spain); Benoît Libert (Technicolor, France); Carla Rafols (Ruhr-Universität Bochum, Germany)

Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle
Gengran Hu (Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences); Yanbin Pan (Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences); Feng Zhang (Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences)

Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
Sébastien Canard (Orange Labs, Caen); David Pointcheval (Ecole Normale Supérieure, Paris); Olivier Sanders (Orange Labs, Caen and Ecole Normale Supérieure, Paris)

Scale-Invariant Fully Homomorphic Encryption over the Integers
Jean-Sébastien Coron (University of Luxembourg); Tancrède Lepoint (CryptoExperts and Ecole Normale Supérieure and University of Luxembourg); Mehdi Tibouchi (NTT Secure Platform Laboratories)

General Impossibility of Group Homomorphic Encryption in the Quantum World
Frederik Armknecht (University of Mannheim, Germany); Tommaso Gagliardoni (TU Darmstadt, CASED and EC-SPRIDE, Germany); Stefan Katzenbeisser (TU Darmstadt, Germany); Andreas Peter (University of Twente, Netherlands)

Discrete logarithm in GF(2^809) with FFS
Razvan Barbulescu (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Cyril Bouvier (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Jérémie Detrey (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Pierrick Gaudry (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Hamza Jeljeli (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Emmanuel Thomé (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Marion Videau (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine); Paul Zimmermann (CARAMEL project-team, LORIA, INRIA/CNRS/Université de Lorraine)

Fine-Tuning Groth-Sahai Proofs
Alex Escala (Scytl Secure Electronic Voting, Spain); Jens Groth (University College London, UK)

On the Lossiness of the Rabin Trapdoor Function
Yannick Seurin (ANSSI, France)

Lazy Modulus Switching for the BKW Algorithm on LWE
Martin R. Albrecht (Technical University of Denmark, Denmark); Jean-Charles Faugère (INRIA, UPMC, CNRS, LIP6); Robert Fitzpatrick (RHUL); Ludovic Perret (UPMC, UPMC, CNRS, LIP6)

Leakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of Pairing
Baodong Qin (Shanghai Jiao Tong University and Southwest University of Science and Technology, China); Shengli Liu (Shanghai Jiao Tong University, China)

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
Martin R. Albrecht (Technical University of Denmark, Denmark); Jean-Charles Faugère (INRIA, Paris-Rocquencourt Center, POLSYS Project UPMC Univ Paris 06, UMR 7606, LIP6, F-75005, Paris, France CNRS, UMR 7606, LIP6, F-75005, Paris, France); Robert Fitzpatrick (Information Security Group Royal Holloway, University of London Egham, Surrey TW20 0EX, United Kingdom); Ludovic Perret (INRIA, Paris-Rocquencourt Center, POLSYS Project UPMC Univ Paris 06, UMR 7606, LIP6, F-75005, Paris, France CNRS, UMR 7606, LIP6, F-75005, Paris, France); Yosuke Todo (NTT Secure Platform Laboratories 3-9-11, Midori-cho Musashino-shi, Tokyo, 180-8585 Japan); Keita Xagawa (NTT Secure Platform Laboratories 3-9-11, Midori-cho Musashino-shi, Tokyo, 180-8585 Japan)

Re-encryption, functional re-encryption, and multi-hop re-encryption: A framework for achieving obfuscation-based security and instantiations from Lattices
Nishanth Chandran (Microsoft Research, India); Melissa Chase (Microsoft Research, Redmond); Feng-Hao Liu (University of Maryland, College Park); Ryo Nishimaki (NTT, Japan); Keita Xagawa (NTT, Japan)

Elliptic and Hyperelliptic Curves: a Practical Security Analysis
Joppe W. Bos (Microsoft Research, USA); Craig Costello (Microsoft Research, USA); Andrea Miele (EPFL, Switzerland)

Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
Prabhanjan Ananth (UCLA); Nishanth Chandran (Microsoft Research, India); Vipul Goyal (Microsoft Research, India); Bhavana Kanukurthi (UCLA); Rafail Ostrovsky (UCLA)

On the Security of the Pre-Shared Key Ciphersuites of TLS
Yong Li (Ruhr-Universität Bochum); Sven Schäge (University College London); Zheng Yang (Ruhr-Universität Bochum); Florian Kohlar (Ruhr-Universität Bochum); Jˆrg Schwenk (Ruhr-Universität Bochum)

Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice
Tsukasa Ishiguro (KDDI R&D Laboratories Inc., Japan); Shinsaku Kiyomoto (KDDI R&D Laboratories Inc., Japan); Yutaka Miyake (KDDI R&D Laboratories Inc., Japan); Tsuyoshi Takagi (Institute of Mathematics for Industry, Kyushu University, Japan)

Traceable Group Encryption
Benoît Libert (Technicolor); Moti Yung (Google and Columbia University); Marc Joye (Technicolor); Thomas Peters (Université catholique de Louvain)

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
Jingguo Bi (Tsinghua University); Jean-Sébastien Coron (University of Luxembourg); Jean-Charles Faugère (INRIA, UPMC, CNRS and LIP6); Phong Q. Nguyen (INRIA and Tsinghua University); Guénaël Renault (UPMC, INRIA, CNRS and LIP6); Rina Zeitoun (Oberthur Technologies, UPMC, INRIA, CNRS and LIP6.)

Related Randomness Attacks for Public Key Encryption
Kenneth G. Paterson (Royal Holloway, University of London); Jacob C. N. Schuldt (Royal Holloway, University of London); Dale L. Sibborn (Royal Holloway, University of London)

Lattice-based Group Signature Scheme with Verifier-local Revocation
Adeline Langlois (LIP, ENS de Lyon, France); San Ling (Nanyang Technological University, Singapore); Khoa Nguyen (Nanyang Technological University, Singapore); Huaxiong Wang (Nanyang Technological University, Singapore)

Encryption Schemes Secure Under Related-Key and Key-Dependent Message Attacks
Florian Böhl (Karlsruhe Institute of Technology); Gareth T. Davies (University of Bristol); Dennis Hofheinz (Karlsruhe Institute of Technology)

Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts
Stefano Tessaro (University of California, Santa Barbara); David A. Wilson (MIT CSAIL)

Leakage-Resilient Signatures with Graceful Degradation
Jesper Buus Nielsen (Aarhus University); Daniele Venturi (Sapienza University of Rome); Angela Zottarel (Aarhus University)

Proxy Re-encryption from Lattices
Elena Kirshanova (Ruhr-Univerität Bochumm)

Verifiable Oblivious Storage
Daniel Apon (University of Maryland); Jonathan Katz (University of Maryland); Elaine Shi (University of Maryland); Aishwarya Thiruvengadam (University of Maryland)

A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme
Dana Dachman-Soled (University of Maryland)

On Minimal Assumptions for Sender-Deniable Public Key Encryption
Dana Dachman-Soled (University of Maryland)

Policy-Based Signatures
Mihir Bellare (University of California, San Diego); Georg Fuchsbauer (IST Austria)

Enhanced Chosen-Ciphertext Security and Applications
Dana Dachman-Soled (University of Maryland); Georg Fuchsbauer (Institute of Science and Technology Austria); Payman Mohassel (University of Calgary); Adam O'Neill (Georgetown University)

Simple Chosen-Ciphertext Security from Low-Noise LPN
Eike Kiltz (HGI RUB); Daniel Masny (HGI RUB); Krzysztof Pietrzak (IST Austria)

Cross-Domain Secure Computation
Chongwon Cho (HRL Laboratories); Sanjam Garg (IBM Research T.J. Watson); Rafail Ostrovsky (UCLA)

A Framework and Compact Constructions for Non-monotonic Attribute-Based Encryption
Shota Yamada (The University of Tokyo); Nuttapong Attrapadung (National Institute of Advanced Industrial Science and Technology); Goichiro Hanaoka (National Institute of Advanced Industrial Science and Technology); Noboru Kunihiro (The University of Tokyo)

Chosen Ciphertext Security via UCE
Takahiro Matsuda (RISEC, AIST, Japan); Goichiro Hanaoka (RISEC, AIST, Japan)

Verifiable Set Operations over Outsourced Databases
Ran Canetti (Boston University and Tel Aviv University); Omer Paneth (Boston University); Dimitrios Papadopoulos (Boston University); Nikos Triandopoulos (RSA Laboratories and Boston University)

Practical Covert Authentication
Stanislaw Jarecki (University of California, Irvine)

Generalizing Homomorphic MACs for Arithmetic Circuits
Dario Catalano (Università di Catania, Italy); Dario Fiore (IMDEA Software Institute, Spain); Rosario Gennaro (City University of New York, USA); Luca Nizzardo (Università degli Studi di Milano-Bicocca, Italy)

Functional Signatures and Pseudorandom Functions
Elette Boyle (Technion); Shafi Goldwasser (MIT and Weizmann); Ioana Ivan (MIT)