Journal: J. Cryptology

Volume 31, Issue 1

1 -- 22Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings
23 -- 59Dario Catalano, Dario Fiore. Practical Homomorphic Message Authenticators for Arithmetic Circuits
60 -- 100Ilan Komargodski, Gil Segev, Eylon Yogev. Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
101 -- 133Christina Boura, Virginie Lallemand, MarĂ­a Naya-Plasencia, Valentin Suder. Making the Impossible Possible
134 -- 161Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev. Incremental Deterministic Public-Key Encryption
162 -- 171Shoni Gilboa, Shay Gueron, Ben Morris. How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
172 -- 201Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee. A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
202 -- 225Zvika Brakerski, Gil Segev. Function-Private Functional Encryption in the Private-Key Setting
226 -- 275Eiichiro Fujisaki. All-But-Many Encryption
276 -- 306Saqib A. Kakvi, Eike Kiltz. Optimal Security Proofs for Full Domain Hash, Revisited