Factorization-based fail-stop signatures revisited
From MaRDI portal
Recommendations
- An efficient fail-stop signature scheme based on factorization
- A short fail-stop signature scheme from factoring
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Threshold fail-stop signature schemes based on discrete logarithm and factorization
- Fail-stop signature for long messages
Cited in
(16)- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Fail-stop signature for long messages
- Fail-stop confirmer signatures
- A new Rabin-type trapdoor permutation equivalent to factoring
- A short fail-stop signature scheme from factoring
- One-time signatures and chameleon hash functions
- On the security for the fail-stop digital signatures
- Comment fail-stop blind signature scheme design based on pairings
- Fail-stop threshold signature schemes based on elliptic curves
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- An efficient fail-stop signature scheme based on factorization
- Threshold fail-stop signature schemes based on discrete logarithm and factorization
- Fail-stop blind signature scheme based on the integer factorization
- scientific article; zbMATH DE number 5232721 (Why is no real title available?)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
- That's not my signature! Fail-stop signatures for a post-quantum world
This page was built for publication: Factorization-based fail-stop signatures revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464770)