Fail-Stop Signatures

DOI10.1137/S009753979324557XMaRDI QIDQ4337635zbMATH OpenOpenAlexFDO

Authors Torben P. Pedersen, Birgit Pfitzmann

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753979324557x

zbMATH Keywords

authenticationcomputational securitycryptographydigital signaturesdiscrete logarithmfactorizationfail-stopinformation-theoretic securityrandomization

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Digital signature schemes: general framework and fail-stop signatures
• scientific article; zbMATH DE number 503351
• On the security for the fail-stop digital signatures

Cited in

(16)

• Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Digital signature schemes: general framework and fail-stop signatures
• Fail-stop signature for long messages
• A general construction for fail-stop signature using authentication codes
• Fail-stop confirmer signatures
• One-time signatures and chameleon hash functions
• Reactively secure signature schemes
• On the security for the fail-stop digital signatures
• Comment fail-stop blind signature scheme design based on pairings
• scientific article; zbMATH DE number 503351 (Why is no real title available?)
• scientific article; zbMATH DE number 708797 (Why is no real title available?)
• An efficient fail-stop signature scheme based on factorization
• scientific article; zbMATH DE number 2088330 (Why is no real title available?)
• Asymptotically Efficient Lattice-Based Digital Signatures
• That's not my signature! Fail-stop signatures for a post-quantum world

This page was built for publication: Fail-Stop Signatures

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