Fail-stop signatures

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 291-330

  Pedersen, Torben Pryds ^a,b   Pfitzmann, Birgit ^c,d,e  

^a Cryptomathic AS   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

^c UNIVERSITY OF HILDESHEIM   (Germany)

^d TU DORTMUND UNIVERSITY   (Germany)

^e ISAAC NEWTON INSTITUTE FOR MATHEMATICAL SCIENCES   (United Kingdom)

Author keywords

Authentication; Computational security; Cryptography; Digital signatures; Discrete logarithm; Factorization; Fail stop; Information theoretic security; Randomization

Indexed keywords

EID: 0008284565     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979324557X     Document Type: Article

References (44)

1. M. BELLARE AND S. MICALI, How to sign given any trapdoor permutation, J. Assoc. Comput. Mach., 39 (1992), pp. 214-233.
2. J. BENALOH, Verifiable secret-ballot elections, Ph.D. thesis, Yale University, New Haven, CT, 1987.
3. J. BENALOH AND M. DE MARE, One-way accumulators: A decentralized alternative to digital signatures, in Proc. 1993 Eurocrypt, Lecture Notes in Comput. Sci. 765, Springer-Verlag, Berlin, 1994, pp. 274-285.
4. G. BLEUMER, B. PFITZMANN, AND M. WAIDNER, A remark on a signature scheme where forgery can be proved, in Proc. 1990 Eurocrypt, Lecture Notes in Comput. Sci. 473, Springer-Verlag, Berlin, 1991, pp. 441-445.
5. J. BOYAR, D. CHAUM, I. DAMGÅRD, AND T. PEDERSEN, Convertible undeniable signatures, in Proc. 1990 Crypto, Lecture Notes in Comput. Sci. 537, Springer-Verlag, Berlin, 1991, pp. 189-205.
6. J. BOS, D. CHAUM, AND G. PURDY, A voting scheme, unpublished manuscript, presented at the rump session of 1988 Crypto, Santa Barbara, CA, 1988.
7. D. CHAUM AND H. VAN ANTWERPEN, Undeniable signatures, in Proc. 1989 Crypto, Lecture Notes in Comput Sci. 435, Springer-Verlag, Berlin, 1990, pp. 212-216.
8. D. CHAUM, E. VAN HEIJST, AND B. PFITZMANN, Cryptographically strong undeniable signatures, unconditionally secure for the signer, in Proc. 1991 Crypto, Lecture Notes in Comput. Sci. 576, Springer-Verlag, Berlin, 1992, pp. 470-484.
9. D. CHAUM AND S. ROIJAKKERS, Unconditionally secure digital signatures, in Proc. 1990 Crypto, Lecture Notes in Comput. Sci. 537, Springer-Verlag, Berlin, 1991, pp. 206-214.
10. I. B. DAMGÅRD, Collision free hash functions and public key signature schemes, in Proc. 1987 Eurocrypt, Lecture Notes in Comput. Sci. 304, Springer-Verlag, Berlin, 1988, pp. 203-216.
11. I. B. DAMGÅRD, T. P. PEDERSEN, AND B. PFITZMANN, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, in Proc. 1993 Crypto, Lecture Notes in Comput. Sci. 773, Springer-Verlag, Berlin, 1994, pp. 250-265.
12. W. DIFFIE AND M. HELLMAN, New directions in cryptography, IEEE Trans. Inform. Theory, 22 (1976), pp. 644-654.
13. H. DOBBERTIN, A. BOSSELAERS, AND B. PRENEEL, RIPEMD-160: A strengthened version of RIPEMD, in Proc. 3rd Fast Software Encryption Workshop, Lecture Notes in Comput. Sci. 1039, Springer-Verlag, Berlin, 1996, pp. 71-82.
14. W. FELLER, An Introduction to Probability Theory and Its Applications, Vol. II, 2nd ed., John Wiley, New York, 1971.
15. R. GALLAGER, Information Theory and Reliable Communication, John Wiley, New York, 1968.
16. E. N. GILBERT, F. J. MACWILLIAMS, AND N. J. A. SLOANE, Codes which detect deception, Bell System Technical J., 53 (1974), pp. 405-424.
17. O. GOLDREICH, Two remarks concerning the Goldwasser-Micali-Rivest signature scheme, in Proc. 1986 Crypto, Lecture Notes in Comput. Sci. 263, Springer-Verlag, Berlin, 1987, pp. 104-110.
18. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
19. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-207.
20. S. GOLDWASSER, S. MICALI, AND R. L. RIVEST, A digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput., 17 (1988), pp. 281-308.
21. J. VAN DE GRAAF AND R. PERALTA, A simple and secure way to show the validity of your public key, in Proc. 1987 Crypto, Lecture Notes in Comput. Sci. 293, Springer-Verlag, Berlin, 1988, pp. 128-134.
22. E. VAN HEYST AND T. P. PEDERSEN, How to make efficient fail-stop signatures, in Proc. 1992 Eurocrypt, Lecture Notes in Comput. Sci. 658, Springer-Verlag, Berlin, 1993, pp. 366-377.
23. E. VAN HEIJST, T. P. PEDERSEN, AND B. PFITZMANN, New constructions of fail-stop signatures and tower bounds, in Proc. 1992 Crypto, Lecture Notes in Comput. Sci. 740, Springer-Verlag, Berlin, 1993, pp. 15-30.
24. N. KOBLITZ, Elliptic curve implementation of zero-knowledge blobs, J. Cryptology, 4 (1991), pp. 207-213.
25. L. LAMPORT, Constructing digital signatures from a one-way function, Report CSL-98, SRI International, Menlo Park, CA, 1979.
26. R. C. MERKLE, Protocols for public key cryptosystems, in Proc. 1980 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, Los Alamitos, CA, 1980, pp. 122-134.
27. R. C. MERKLE, Protocols for public key cryptosystems, in Secure Communications and Asymmetric Cryptosystems, G. J. Simmons, ed., AAAS Selected Symposium 69, Westview Press, Boulder, CO, 1982, pp. 73-104.
28. R. C. MERKLE, A digital signature based on a conventional encryption function, in Proc. 1987 Crypto, Lecture Notes in Comput. Sci. 293, Springer-Verlag, Berlin, 1988, pp. 369-378.
29. R. C. MERKLE, A certified digital signature (That antique paper from 1979), in Proc. 1989 Crypto, Lecture Notes in Comput. Sci. 435, Springer-Verlag, Berlin, 1990, pp. 218-238.
30. M. NAOR AND M. YUNG, Universal one-way hash functions and their cryptographic applications, in Proc. 21st Symposium on Theory of Computing (1989 STOC), ACM, New York, 1989, pp. 33-43.
31. B. PFITZMANN, Für den Unterzeichner unbedingt sichere digitale Signaturen und ihre Anwendung, Diploma thesis, Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe, Karlsruhe, Germany, 1989 (in German; summarized in English in [35]).
32. B. PFITZMANN, Fail-stop signatures: Principles and applications, in Proc. 8th World Conference on Computer Security, Audit, and Control (1991 Compsec), Elsevier, Oxford, UK, 1991, pp. 125-134.
33. B. PFITZMANN, Fail-stop signatures without trees, Hildesheimer Informatik-Berichte 16/94 (ISSN 0941-3014), Institut für Informatik, Universität Hildesheim, Hildesheim, Germany, 1994.
34. B. PFITZMANN, Digital Signature Schemes: General Framework and Fail-Stop Signatures, Lecture Notes in Comput. Sci. 1100, Springer-Verlag, Berlin, 1996.
35. B. PFITZMANN AND M. WAIDNER, Formal aspects of fail-stop signatures, Technical Report 22/90, Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany, 1990.
36. B. PFITZMANN AND M. WAIDNER, Fail-stop signatures and their application, in Proc. 9th Worldwide Congress on Computer and Communications Security and Protection (1991 Securicom), Paris, 1991, pp. 145-160.
37. B. PFITZMANN AND M. WAIDNER, Unconditional Byzantine agreement for any number of faulty processors, in Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science (1992 STACS), Lecture Notes in Comput. Sci. 577, Springer-Verlag, Berlin, 1992, pp. 339-350.
38. R. L. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. Assoc. Comput. Mach., 21 (1978), pp. 120-126; reprinted in Comm. Assoc. Comput. Mach., 26 (1983), pp. 96-99.
39. R. L. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. Assoc. Comput. Mach., 21 (1978), pp. 120-126; reprinted in Comm. Assoc. Comput. Mach., 26 (1983), pp. 96-99.
40. J. ROMPEL, One-way functions are necessary and sufficient for secure signatures, in Proc. 22nd Symposium on Theory of Computing (1990 STOC), ACM, New York, 1990, pp. 387-394.
41. R. SAFAVI-NAINI AND L. TOMBAK, Optimal authentication systems, in Proc. 1993 Eurocrypt, Lecture Notes in Comput. Sci. 765, Springer-Verlag, Berlin, 1994, pp. 12-27.
42. C. E. SHANNON, Communication in the presence of noise, Proc. Inst. Radio Engineers, 37 (1949), pp. 10-21.
43. C. E. SHANNON, Communication theory of secrecy systems, Bell System Technical J., 28 (1949), pp. 656-715.
44. M. WAIDNER AND B. PFITZMANN, The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability, in Proc. 1989 Eurocrypt, Lecture Notes in Comput. Sci. 434, Springer-Verlag, Berlin, 1990, p. 690.