International Association
for Cryptologic Research

ePrint Report: Secure Merge in Linear Time and O(log log N) Rounds
Mark Blunk, Paul Bunn, Samuel Dittmer, Steve Lu, Rafail Ostrovsky

ePrint Report: Unnecessary Input Heuristics & PayJoin Transactions
Simin Ghesmati, Andreas Kern, Aljosha Judmayer, Nicholas Stifter and

ePrint Report: Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures
Daniel Kales, Greg Zaverucha

ePrint Report: Doubly Efficient Interactive Proofs over Infinite and Non-Commutative Rings
Eduardo Soria-Vazquez

ePrint Report: A survey of elliptic curves for proof systems
Diego F. Aranha, Youssef El Housni, Aurore Guillevic

ePrint Report: Towards Practical Homomorphic Time-Lock Puzzles: Applicability and Verifiability
Yi Liu, Qi Wang, Siu-Ming Yiu

ePrint Report: Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups
Lior Rotem

ePrint Report: A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff
Lior Rotem, Gil Segev