On the Security of the Schnorr Scheme using Preprocessing

DOI10.1007/3-540-46416-6_6MaRDI QIDQ4037452zbMATH OpenOpenAlexFDO

Authors Peter de Rooij

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_6

zbMATH Keywords

complexityattacksecret keysignaturesSchnorr scheme

Mathematics Subject Classification ID

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

Recommendations

• On the multi-user security of short Schnorr signatures with preprocessing
• Publication:4934716
• On Schnorr's preprocessing for digital signature schemes
• scientific article; zbMATH DE number 4201454
• On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
• On tight security proofs for Schnorr signatures
• On tight security proofs for Schnorr signatures
• Provable security of the Knudsen-Preneel compression functions
• On the bit security of cryptographic primitives
• On the security of the Merkle- Hellman cryptographic scheme (Corresp.)

Cited in

(6)

• Speeding up exponentiation using an untrusted computational resource
• Efficient signature generation by smart cards
• scientific article; zbMATH DE number 1394302 (Why is no real title available?)
• On the multi-user security of short Schnorr signatures with preprocessing
• Random small Hamming weight products with applications to cryptography
• On Schnorr's preprocessing for digital signature schemes

This page was built for publication: On the Security of the Schnorr Scheme using Preprocessing

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