Journal: J. Cryptology

Volume 33, Issue 4

1405 -- 1441Benoît Libert, Moti Yung. Adaptively Secure Non-interactive CCA-Secure Threshold Cryptosystems: Generic Framework and Constructions
1442 -- 1460Michael Hutter, Erich Wenger. Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors
1461 -- 1584Ralf Küsters, Max Tuengerthal, Daniel Rausch 0001. The IITM Model: A Simple and Expressive Model for Universal Composability
1585 -- 1658Ralf Küsters, Max Tuengerthal, Daniel Rausch 0001. Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
1659 -- 1731Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov. 1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds
1732 -- 1786Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
1787 -- 1821Roman Langrehr, Jiaxin Pan. Tightly Secure Hierarchical Identity-Based Encryption
1822 -- 1870Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth. Foundations of Fully Dynamic Group Signatures
1871 -- 1913Akiko Inoue, Tetsu Iwata, Kazuhiko Minematsu, Bertram Poettering. Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality
1914 -- 1983Katriel Cohn-Gordon, Cas Cremers, Benjamin Dowling, Luke Garratt, Douglas Stebila. A Formal Security Analysis of the Signal Messaging Protocol
1984 -- 2033Sandro Coretti, Yevgeniy Dodis, Ueli Maurer, Björn Tackmann, Daniele Venturi 0001. Non-malleable Encryption: Simpler, Shorter, Stronger
2034 -- 2077Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi 0001. Continuously Non-malleable Codes in the Split-State Model
2078 -- 2112Jonathan R. Ullman, Salil P. Vadhan. PCPs and the Hardness of Generating Synthetic Data
2113 -- 2147Benjamin Wesolowski. Efficient Verifiable Delay Functions

Volume 33, Issue 3

619 -- 702Sam Kim, David J. Wu. Multi-theorem Preprocessing NIZKs from Lattices
703 -- 741Avik Chakraborti, Tetsu Iwata, Kazuhiko Minematsu, Mridul Nandi. Blockcipher-Based Authenticated Encryption: How Small Can We Go?
742 -- 823Zhenzhen Bao, Itai Dinur, Jian Guo 0001, Gaëtan Leurent, Lei Wang 0031. Generic Attacks on Hash Combiners
824 -- 873Itai Dinur, Nathan Keller, Ohad Klein. An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
874 -- 909Itai Dinur. Cryptanalytic Time-Memory-Data Trade-offs for FX-Constructions and the Affine Equivalence Problem
910 -- 916Orr Dunkelman, Nathan Keller, Eran Lambooij, Yu Sasaki. A Practical Forgery Attack on Lilliput-AE
917 -- 953Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz. The Communication Complexity of Private Simultaneous Messages, Revisited
954 -- 1002Lucas Kowalczyk, Hoeteck Wee. 1 from k-Lin
1003 -- 1043Achiya Bar-On, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir. Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities
1044 -- 1079Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar. Four-State Non-malleable Codes with Explicit Constant Rate
1080 -- 1113Martin R. Albrecht, Pooya Farshim, Shuai Han, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson. Multilinear Maps from Obfuscation
1114 -- 1155Felix Wegener, Lauren De Meyer, Amir Moradi 0001. Spin Me Right Round Rotational Symmetry for FPGA-Specific AES: Extended Version
1156 -- 1183Tim Beyne. Block Cipher Invariants as Eigenvectors of Correlation Matrices
1184 -- 1215Patrick Derbez, Léo Perrin. Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCE
1216 -- 1271Masaud Y. Alhassan, Daniel Günther 0004, Ágnes Kiss, Thomas Schneider 0003. Efficient and Scalable Universal Circuits
1272 -- 1317Ashwin Jha, Mridul Nandi. Tight Security of Cascaded LRW2
1318 -- 1361Susumu Kiyoshima. Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
1362 -- 1403Paul Bunn, Rafail Ostrovsky. Oblivious Sampling with Applications to Two-Party k-Means Clustering

Volume 33, Issue 2

357 -- 405Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs. From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
406 -- 458Ilan Komargodski, Gil Segev 0001. From Minicrypt to Obfustopia via Private-Key Functional Encryption
459 -- 493Nir Bitansky. Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
494 -- 566David A. Basin, Andreas Lochbihler, S. Reza Sefidgar. CryptHOL: Game-Based Proofs in Higher-Order Logic
567 -- 594Tomer Ashur, Tim Beyne, Vincent Rijmen. Revisiting the Wrong-Key-Randomization Hypothesis
595 -- 617Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder. Feasibility and Infeasibility of Secure Computation with Malicious PUFs

Volume 33, Issue 1

1 -- 33Qian Guo 0001, Thomas Johansson 0001, Carl Löndahl. Solving LPN Using Covering Codes
34 -- 91Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène. TFHE: Fast Fully Homomorphic Encryption Over the Torus
92 -- 129Sabyasachi Karati, Palash Sarkar 0001. Kummer for Genus One Over Prime-Order Fields
130 -- 175Steven D. Galbraith, Christophe Petit, Javier Silva 0001. Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
176 -- 227Adi Akavia, Rio LaVigne, Tal Moran. Topology-Hiding Computation on All Graphs
228 -- 270Jian Guo 0001, Guohong Liao, Guozhen Liu, Meicheng Liu, Kexin Qiao, Ling Song 0001. Practical Collision Attacks against Round-Reduced SHA-3
271 -- 318Carmit Hazay, Muthuramakrishnan Venkitasubramaniam. On the Power of Secure Two-Party Computation
319 -- 355Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou. Locally Decodable and Updatable Non-malleable Codes and Their Applications