1. Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

   • Benny Applebaum
   • Yuval Ishai
   • Eyal Kushilevitz

   OriginalPaper 03 October 2016 Pages: 1 - 22

2. Practical Homomorphic Message Authenticators for Arithmetic Circuits

   • Dario Catalano
   • Dario Fiore

   OriginalPaper 04 January 2017 Pages: 23 - 59

3. Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions

   • Ilan Komargodski
   • Gil Segev
   • Eylon Yogev

   OriginalPaper 14 February 2017 Pages: 60 - 100

   

4. Making the Impossible Possible

   • Christina Boura
   • Virginie Lallemand
   • Valentin Suder

   OriginalPaper 01 February 2017 Pages: 101 - 133

   

5. Incremental Deterministic Public-Key Encryption

   • Ilya Mironov
   • Omkant Pandey
   • Gil Segev

   OriginalPaper 19 April 2017 Pages: 134 - 161

   

6. How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?

   • Shoni Gilboa
   • Shay Gueron
   • Ben Morris

   OriginalPaper 07 April 2017 Pages: 162 - 171

   

7. A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption

   • Seung Geol Choi
   • Dana Dachman-Soled
   • Hoeteck Wee

   OriginalPaper 13 March 2017 Pages: 172 - 201

   

8. Function-Private Functional Encryption in the Private-Key Setting

   • Zvika Brakerski
   • Gil Segev

   OriginalPaper 17 April 2017 Pages: 202 - 225

   

9. All-But-Many Encryption

   • Eiichiro Fujisaki

   OriginalPaper 11 May 2017 Pages: 226 - 275

   

10. Optimal Security Proofs for Full Domain Hash, Revisited

    • Saqib A. Kakvi
    • Eike Kiltz

    OriginalPaper 24 April 2017 Pages: 276 - 306