On lattice-based interactive protocols: an approach with less or no aborts

DOI10.1007/978-3-030-55304-3_3MaRDI QIDQ2030863zbMATH OpenOpenAlexFDO

Authors Nabil Alkeilani Alkadri, Rachid El Bansarkhani, Johannes Buchmann

Publication date 8 June 2021

Full work available at URL https://doi.org/10.1007/978-3-030-55304-3_3

zbMATH Keywords

abortshash treeslattice-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Lattice-based blind signatures, revisited
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Improved Zero-Knowledge Identification with Lattices
• Adaptively secure identity-based identification from lattices without random oracles
• Lattice-Based Identification Schemes Secure Under Active Attacks

Cited in

(8)

• Lattice-based blind signatures, revisited
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• Practical lattice-based distributed signatures for a small number of signers
• CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
• Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
• Lattice-based proof-friendly signatures from vanishing short integer solutions
• Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
• Post-quantum blind signature from standard group action assumptions and more

This page was built for publication: On lattice-based interactive protocols: an approach with less or no aborts

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