Layering quantum-resistance into classical digital signature algorithms
From MaRDI portal
Publication:2154036
DOI10.1007/978-3-030-91356-4_2zbMath1504.94224OpenAlexW3217150976MaRDI QIDQ2154036
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-91356-4_2
digital signatureelliptic curve digital signature algorithmzero-knowledge proofpost-quantum security
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Uses Software
Cites Work
- W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Security comparisons and performance analyses of post-quantum signature algorithms
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Scalable zero knowledge with no trusted setup
- Collapse-Binding Quantum Commitments Without Random Oracles
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- New directions in cryptography
- Diophantine Representation of the Set of Prime Numbers
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- How to Time-Stamp a Digital Document
- Strengths and Weaknesses of Quantum Computing
- One Way Hash Functions and DES
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Layering quantum-resistance into classical digital signature algorithms
