On Schnorr's preprocessing for digital signature schemes
From MaRDI portal
Publication:676822
DOI10.1007/S001459900016zbMATH Open0865.94023OpenAlexW2945016443WikidataQ126839191 ScholiaQ126839191MaRDI QIDQ676822FDOQ676822
Authors: Peter de Rooij
Publication date: 15 July 1997
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900016
Recommendations
Cites Work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- Efficient signature generation by smart cards
- Title not available (Why is that?)
- Zero-knowledge proofs of identity
- Title not available (Why is that?)
- An interactive identification scheme based on discrete logarithms and factoring
- On the Security of the Schnorr Scheme using Preprocessing
Cited In (8)
- Title not available (Why is that?)
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Speeding up exponentiation using an untrusted computational resource
- Title not available (Why is that?)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- On the multi-user security of short Schnorr signatures with preprocessing
- On the Security of the Schnorr Scheme using Preprocessing
This page was built for publication: On Schnorr's preprocessing for digital signature schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676822)