The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing https://eprint.iacr.org/2024/1482
Katharina Boudgoust, Mark Simkin
zkSNARKs in the ROM with Unconditional UC-Security https://eprint.iacr.org/2024/724
Alessandro Chiesa Giacomo Fenzi
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs https://eprint.iacr.org/2024/818
Jan Bobolz, Pooya Farshim, Markulf Kohlweiss, Akira Takahashi
Hamming Weight Proofs of Proximity with One-Sided Error https://eprint.iacr.org/2024/832
Gal Arnon, Shany Ben-David, Eylon Yogev
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds https://eprint.iacr.org/2024/1434
Alessandro Chiesa and Marcel Dall'Agnol and Ziyi Guan and Nicholas Spooner and Eylon Yogev
Batching Adaptively-Sound SNARGs for NP https://eprint.iacr.org/2024/1812 Lalita Devadas, Brent Waters, David J. Wu
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge https://eprint.iacr.org/2024/781 Or Keret and Ron D. Rothblum and Prashant Nalini Vasudevan
Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption https://eprint.iacr.org/2023/1967 Shafik Nassar and Brent Waters and David J. Wu
Batch Arguments to NIZKs from One-Way Functions https://eprint.iacr.org/2023/1938 Eli Bradley and Brent Waters and David J. Wu
Security Bounds for Proof-Carrying Data from Straightline Extractors https://eprint.iacr.org/2023/1646 Alessandro Chiesa and Ziyi Guan and Shahar Samocha and Eylon Yogev
Black-Box Timed Commitments from Time-Lock Puzzles https://eprint.iacr.org/2024/1786 Hamza Abusalah and Gennaro Avitabile
Kolmogorov & One-Way Functions
Lower Bounds for Levin–Kolmogorov Complexity https://eprint.iacr.org/2024/687 Nicholas Brandt
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth https://eprint.iacr.org/2023/1086 Yanyi Liu and Rafael Pass
One-Way Functions and pKt Complexity https://eprint.iacr.org/2024/1388 Shuichi Hirahara and Zhenjian Lu and Igor C. Oliveira
On Bounded Storage Key Agreement and One-Way Functions https://fondation-hadamard.fr/media/filer_public/71/66/716614d5-f7fc-4b59-9263-4aa0c7a974ea/f_boundedspacekeyagreement_egger.pdf
Rate-1 Zero-Knowledge Proofs from One-Way Functions https://eprint.iacr.org/2024/1493 Noor Athamnah and Eden Florentz – Konopnicki and Ron D. Rothblum
Lattice
Sparse Linear Regression and Lattice Problems https://arxiv.org/abs/2402.14645 Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan
Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective https://eprint.iacr.org/2024/603 Divesh Aggarwal and Leong Jin Ming and Alexandra Veliche
Homomorphism
Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing https://eprint.iacr.org/2024/820 Pierre Meyer and Claudio Orlandi and Lawrence Roy and Peter Scholl
Key-Homomorphic and Aggregate Verifiable Random Functions https://eprint.iacr.org/2024/643 Giulio Malavolta
More Efficient Functional Bootstrapping for General Functions in Polynomial Modulus https://iacr.org/cryptodb/data/paper.php?pubkey=34732 Han Xia and Feng-Hao Liu and Han Wang
Obfuscation
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants https://eprint.iacr.org/2024/856 Seyoon Ragavan and Neekon Vafa and Vinod Vaikuntanathan
Towards general-purpose program obfuscation via local mixing https://eprint.iacr.org/2024/006 Ran Canetti and Claudio Chamon and Eduardo Mucciolo and Andrei Ruckenstein