For more than 20 years, the Cryptology ePrint Archive has been publishing pre-print papers relevant to the field of cryptology. You can read more about our goals and history, see our acceptance and publishing conditions, check out some statistics, or contact us.
The Cryptology ePrint Archive provides rapid access to recent research in cryptology. Papers have been placed here by the authors and did not undergo any refereeing process other than verifying that the work seems to be within the scope of cryptology and meets some minimal acceptance criteria.
In this respect, the papers in the Cryptology ePrint Archive have the status of technical reports. Papers submitted may be author versions of published papers if the copyright holder allows such posting.
Note: Acknowledgement Updated. We've noticed a recent work (https://eprint.iacr.org/2025/892) that claims to break QA-SD assumptions under serveal parameter regimes. Our work is resilient to their attacks by either using Ring-LPN assumptions or using QA-SD assumptions over larger fields as pointed out in Section 5 and Table 1 of that work.
Existing post-quantum folding schemes (Boneh, Chen, ePrint 2024/257) based on lattice assumptions instead are secure under structured lattice assumptions, such as the Module Short Integer Solution Assumption (MSIS), which also binds them to relatively complex arithmetic.
We introduce WHIR, a new IOP of proximity that offers small query complexity and exceptionally fast verification time. The WHIR verifier typically runs in a few hundred microseconds, whereas other verifiers in the literature require several milliseconds (if not much more). This significantly improves the state of the art in verifier time for hash-based SNARGs (and beyond). Crucially, WHIR is ...
Abstract We introduce a general template for building garbled circuits with low communication, assuming decisional composite residuosity (DCR) and a circular security assumption. For the case of layered Boolean circuits, we can garble a circuit of size s with communication proportional to O (s / log log s) bits, plus an additive factor that is polynomial in the security parameter. For layered ...
Abstract Typical protocols in the multi-party private set operations (MPSO) setting enable m> 2 parties to perform certain secure computation on the intersection or union of their private sets, realizing a very limited range of MPSO functionalities. Most works in this field focus on just one or two specific functionalities, resulting in a large variety of isolated schemes and a lack of a ...
We revisit the construction of signature schemes using the MPC-in-the-head paradigm. We obtain two main contributions: – We observe that previous signatures in the MPC-in-the-head paradigm must rely on a salted version of the GGM puncturable pseudorandom function (PPRF) to avoid collision attacks. We design a new efficient PPRF construction that is provably secure in the multi-instance ...
