|
- 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
- SQISignHD: New Dimensions in Cryptography - IACR Cryptology ePrint Archive
We introduce SQIsignHD, a new post-quantum digital signature scheme inspired by SQIsign SQIsignHD exploits the recent algorithmic breakthrough underlying the attack on SIDH, which allows to efficiently represent isogenies of arbitrary degrees as components of a higher dimensional isogeny SQIsignHD overcomes the main drawbacks of SQIsign First, it scales well to high security levels, since
- 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
- Verifiable Computation for Approximate Homomorphic Encryption Schemes
We address the problem of proving the validity of computation on ciphertexts of homomorphic encryption (HE) schemes, a feature that enables outsourcing of data and computation while ensuring both data privacy and integrity We propose a new solution that handles computations in RingLWE-based schemes, particularly the CKKS scheme for approximate arithmetic Our approach efficiently handles
- 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
|
|
|