An efficient fail-stop signature scheme based on factorization

DOI10.1007/3-540-36552-4_5MaRDI QIDQ4413313zbMATH OpenFDO

Authors Willy Susilo, Reihaneh Safavi-Naini

Publication date 17 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2587/25870062.htm

zbMATH Keywords

failstop signature scheme

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Information and Communications Security
• scientific article; zbMATH DE number 503351
• On the security for the fail-stop digital signatures
• Fail-Stop Signatures
• Short fail-stop signature scheme based on factorization and discrete logarithm assumptions

Cited in

(14)

• Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
• Digital signature schemes: general framework and fail-stop signatures
• A short fail-stop signature scheme from factoring
• One-time signatures and chameleon hash functions
• How to construct fail-stop confirmer signature schemes
• Comment fail-stop blind signature scheme design based on pairings
• Fail-stop threshold signature schemes based on elliptic curves
• scientific article; zbMATH DE number 503351 (Why is no real title available?)
• scientific article; zbMATH DE number 708797 (Why is no real title available?)
• scientific article; zbMATH DE number 2080186 (Why is no real title available?)
• Fail-stop blind signature scheme based on the integer factorization
• Efficient ``on the fly signature schemes based on integer factoring
• Information and Communications Security
• That's not my signature! Fail-stop signatures for a post-quantum world

This page was built for publication: An efficient fail-stop signature scheme based on factorization

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