Fail-Stop Signatures
From MaRDI portal
Publication:4337635
DOI10.1137/S009753979324557XzbMATH Open0868.94022OpenAlexW1983341988MaRDI QIDQ4337635FDOQ4337635
Birgit Pfitzmann, Torben P. Pedersen
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
randomizationfactorizationauthenticationcryptographydigital signaturesdiscrete logarithminformation-theoretic securitycomputational securityfail-stop
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- Asymptotically Efficient Lattice-Based Digital Signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- That's not my signature! Fail-stop signatures for a post-quantum world
- Comment fail-stop blind signature scheme design based on pairings
- One-Time Signatures and Chameleon Hash Functions
Recommendations
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)