Fail-Stop Signatures

DOI10.1137/S009753979324557XzbMath0868.94022OpenAlexW1983341988MaRDI QIDQ4337635

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

zbMATH Keywords

randomizationcryptographyfactorizationauthenticationdiscrete logarithmdigital signaturesinformation-theoretic securitycomputational securityfail-stop

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Comment fail-stop blind signature scheme design based on pairings ⋮ On the existence of statistically hiding bit commitment schemes and fail-stop signatures ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Short fail-stop signature scheme based on factorization and discrete logarithm assumptions ⋮ One-Time Signatures and Chameleon Hash Functions

This page was built for publication: Fail-Stop Signatures