On the existence of statistically hiding bit commitment schemes and fail-stop signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 773 LNCS, Issue , 1994, Pages 250-265

  Damgård, Ivan B ^a   Pedersen, Torben P ^a   Pfitzmann, Birgit ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

BIT COMMITMENT; COMMITMENT SCHEME; FAIL-STOP SIGNATURES; IMPROVE-A; ONE-WAY PERMUTATION; PUBLIC VERIFICATIONS; SECRET KEY;

AUTHENTICATION;

EID: 85016692748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_22     Document Type: Conference Paper

References (16)

1. C. H. Bennett, G. Brassard, C. Crepeau, U. Maurer: Privacy Amplification Against Probabilistic Information. In preparation.
2. C. H. Bennett, G. Brassard, J.-M. Robert: Privacy Amplification by Public Dis-cussion. SIAM Journal on Computing, vol 17, no. 2, 1988, pp. 210-229.
3. J. L. Carter, M. N. Wegman: Universal Classes of Hash Functions. Journal of Computer and System Sciences 18, 1979, pp. 143-154.
4. I. B. Damgärd: A Design Principle for Hash Functions. Proceedings of Crypto’89, LNCS 435, pp. 416-427, 1990.
5. E. van Heyst, T. P. Pedersen: How to Make Efficient Fail-Stop Signatures. Presented at Eurocrypt’92, Balatonfiired, Hungary, 1992.
6. E. van Heyst, T. P. Pedersen, B. Pfitzmann: New Constructions of Fail-Stop Sig-natures and Lower Bounds. Presented at Crypto’92, Santa Barbara, 1992.
7. R. Rivest: The MDJ message-digest algorithm, Proc. of Crypto 90.
8. R. C. Merkle: Protocols for Public Key Cryptosystems. In: Secure Communications and Asymmetric Cryptosystems, AAAS Selected Symposium 69, G. J. Simmons (ed.); Westview Press, Boulder 1982, pp. 73-104.
9. R. C. Merkle: A digital signature based on a conventional encryption function. Proceedings of Crypto’87, LNCS 293, Springer-Verlag, Berlin 1988, pp. 369-378.
10. M. Naor, M. Yung: Universal One-Way Hash Functions and their Cryptographic Applications. Proceedings of 21‘st STOC, pp. 33-43, 1989.
11. M. Naor, R. Ostrovsky, R. Venkatesan, M. Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. Presented at Crypto’92, Santa Barbara, 1992.
12. T. P. Pedersen, B. Pfitzmann: Fail-Stop Signatures. Manuscript, February 1993.
13. B. Pfitzmann, M. Waidner: Formal Aspects of Fail-Stop Signatures. Internal report 22/90, Fakultät für Informatik, Universität Karlsruhe.
14. B. Pfitzmann, M. Waidner: Fail-Stop Signatures and their Application. Securicom 91, Paris, pp. 145-160.
15. Specifications for a Secure Hash Standard, Federal Information Processing Standards Publication YY, 1992.
16. M. Waidner, B. Pfitzmann: The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability Proceedings of Eurocrypt’89, LNCS 434, page 690, 1990.