Public-Key Cryptography – PKC 2017

1. Front Matter

   Pages I-XIV

   PDF

2. Cryptanalysis

   1. Front Matter

      Pages 1-1

      PDF

   2. LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE

      • Gottfried Herold, Alexander May

      Pages 3-15

   3. Improved Algorithms for the Approximate k-List Problem in Euclidean Norm

      • Gottfried Herold, Elena Kirshanova

      Pages 16-40

   4. Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

      • Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi

      Pages 41-58

3. Protocols

   1. Front Matter

      Pages 59-59

      PDF

   2. Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash

      • David Pointcheval, Olivier Sanders, Jacques Traoré

      Pages 61-90

   3. Asymptotically Tight Bounds for Composing ORAM with PIR

      • Ittai Abraham, Christopher W. Fletcher, Kartik Nayak, Benny Pinkas, Ling Ren

      Pages 91-120

   4. Predictable Arguments of Knowledge

      • Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi

      Pages 121-150

   5. Removing Erasures with Explainable Hash Proof Systems

      • Michel Abdalla, Fabrice Benhamouda, David Pointcheval

      Pages 151-174

   6. Scalable Multi-party Private Set-Intersection

      • Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

      Pages 175-203

4. Encryption Schemes

   1. Front Matter

      Pages 205-205

      PDF

   2. Tightly Secure IBE Under Constant-Size Master Public Key

      • Jie Chen, Junqing Gong, Jian Weng

      Pages 207-231

   3. Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

      • Rishab Goyal, Venkata Koppula, Brent Waters

      Pages 232-246

   4. Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts

      • Benoît Libert, Thomas Peters, Chen Qian

      Pages 247-276

5. Leakage-Resilient and Non-Malleable Codes

   1. Front Matter

      Pages 277-277

      PDF

   2. Non-malleable Codes with Split-State Refresh

      • Antonio Faonio, Jesper Buus Nielsen

      Pages 279-309

   3. Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes

      • Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi

      Pages 310-332

   4. Fully Leakage-Resilient Codes

      • Antonio Faonio, Jesper Buus Nielsen

      Pages 333-358

6. Number Theory and Diffie-Hellman

   1. Front Matter

      Pages 359-359

      PDF

The two-volume set LNCS 10174 and 10175 constitutes the refereed proceedings of the 20th IACR International Conference on the Practice and Theory in Public-Key Cryptography, PKC 2017, held in Amsterdam, The Netherlands, in March 2017.
The 34 revised papers presented were carefully reviewed and selected from 160 submissions. They are organized in topical sections such as Cryptanalysis, Protocols,  Encrpytion Schemes, Leakage-Resilient and Non-Malleable Codes, Number Theory and Diffie-Hellman, Encryption with Access Control,  Special Signatures, Fully Homomorphic Encryption, Real-World Schemes, Multiparty Computation and Primitives.

• cryptanalysis
• elliptic curve cryptography
• linear programming
• oblivious transfer
• provable security
• algorithm analysis and problem complexity

• CWI , Amsterdam, The Netherlands

  Serge Fehr

Policies and ethics