Computational alternatives to random number generators

DOI10.1007/3-540-48892-8_6MaRDI QIDQ4250807zbMATH OpenFDO

Authors David M'Raïhi, David Naccache, David Pointcheval, Serge Vaudenay

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

random-based signatures

Mathematics Subject Classification ID

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

Recommendations

• Deterministic random oracles
• Secure hash-and-sign signatures without the random oracle
• The random oracle methodology, revisited.
• scientific article; zbMATH DE number 1775406

Cited in

(5)

• Security of hedged Fiat-Shamir signatures under fault attacks
• Threshold Schnorr with stateless deterministic signing from standard assumptions
• From Identification to Signatures, Tightly: A Framework and Generic Transforms
• Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
• Signatures with memory-tight security in the quantum random oracle model

This page was built for publication: Computational alternatives to random number generators

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