copy and paste this google map to your website or blog!
Press copy button and paste into your blog or website.
(Please switch to 'HTML' mode when posting into your blog. Examples: WordPress Example, Blogger Example)
Input Form:Deal with this potential dealer,buyer,seller,supplier,manufacturer,exporter,importer
(Any information to deal,buy, sell, quote for products or service)
Cryptology ePrint Archive 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
About the Cryptology ePrint Archive - IACR 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
Operations of the Cryptology ePrint Archive - IACR 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
Efficient Pseudorandom Correlation Generators for Any Finite Field 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
Browse by year and category - IACR Note: In order to protect the privacy of readers, eprint iacr org does not use cookies or embedded third party content
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification 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
Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic . . . 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
Lova: Lattice-Based Folding Scheme from Unstructured Lattices 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
Transistor: a TFHE-friendly Stream Cipher - eprint. iacr. org Fully Homomorphic Encryption (FHE) allows computations on encrypted data without requiring decryption, ensuring data privacy during processing However, FHE introduces a significant expansion of ciphertext sizes compared to plaintexts, which results in higher communication A practical solution to mitigate this issue is transciphering, where only the master key is homomorphically encrypted