Using Freivalds' algorithm to accelerate lattice-based signature verifications

DOI10.1007/978-3-030-34339-2_22MaRDI QIDQ2169929zbMATH OpenOpenAlexFDO

Authors Arnaud Sipasseuth, Thomas Plantard, Willy Susilo

Publication date 30 August 2022

Full work available at URL https://ro.uow.edu.au/cgi/viewcontent.cgi?article=4552&context=eispapers1

zbMATH Keywords

delegated computation verificationdiagonal reduction signaturelattice-based cryptographylattice-based signaturesNISTpost-quantum cryptography

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Speeding-up verification of digital signatures
• Prover efficient public verification of dense or sparse/structured matrix-vector multiplication
• Modular lattice signatures, revisited
• Fast verification for improved versions of the UOV and rainbow signature schemes
• High-speed signatures from standard lattices

Cited in

(2)

• Progressive and efficient verification for digital signatures
• Speeding-up verification of digital signatures

This page was built for publication: Using Freivalds' algorithm to accelerate lattice-based signature verifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169929)