Journal: J. Cryptology

Volume 38, Issue 1

1 -- 0Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss. Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more
2 -- 0Gaëtan Leurent, Clara Pernot. New Representations of the AES Key Schedule
3 -- 0Jorge Chávez-Saab, Francisco Rodríguez-Henríquez, Mehdi Tibouchi. SwiftEC: Shallue-van de Woestijne Indifferentiable Function To Elliptic Curves
4 -- 0Alexander R. Block, Albert Garreta, Pratyush Ranjan Tiwari, Michal Zajac 0001. On Soundness Notions for Interactive Oracle Proofs
5 -- 0Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald. Achievable CCA2 Relaxation for Homomorphic Encryption
6 -- 0Valeh Farzaliyev, Calvin Pärn, Heleen Saarse, Jan Willemson. Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting
7 -- 0Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Daniele Venturi 0001, Ivan Visconti. Compact Proofs of Partial Knowledge for Overlapping CNF Formulae
8 -- 0Chris Brzuska, Geoffroy Couteau. On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness
9 -- 0Gildas Avoine, Loïc Ferreira. Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol
10 -- 0Dung Bui, Haotian Chu, Geoffroy Couteau, Xiao Wang 0012, Chenkai Weng, Kang Yang 0002, Yu Yu 0001. An Efficient ZK Compiler from SIMD Circuits to General Circuits
11 -- 0Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi 0002, Daniel Tschudi. Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model)
12 -- 0Jianwei Li, Phong Q. Nguyen. A Complete Analysis of the BKZ Lattice Reduction Algorithm
13 -- 0Agathe Beaugrand, Guilhem Castagnos, Fabien Laguillaumie. Efficient Succinct Zero-Knowledge Arguments in the CL Framework
14 -- 0Matteo Campanelli, Dario Fiore 0001, Rosario Gennaro. Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them
15 -- 0Jung Hee Cheon, Wonhee Cho, Jiseung Kim 0001. Improved Universal Thresholdizer from Iterative Shamir Secret Sharing
16 -- 0Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat. Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols