Statistical secrecy and multibit commitments

IEEE Transactions on Information Theory

Volumn 44, Issue 3, 1998, Pages 1143-1151

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

^a AALBORG UNIVERSITY   (Denmark)

^b Cryptomathic AS   (Denmark)

^c TU DORTMUND UNIVERSITY   (Germany)

^d SAARLAND UNIVERSITY   (Germany)

Author keywords

Cryptology; Multibit commitment; Protocols; Shannon theory; Similarity of ensembles of distributions; Statistically hiding; Unconditional security; Zero knowledge

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; INFORMATION THEORY; PROBABILITY; STATISTICAL METHODS;

CRYPTOLOGIC PROTOCOLS; SHANNON THEORY;

NETWORK PROTOCOLS;

EID: 0032073057     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.669255     Document Type: Article

References (27)

1. C. H. Bennett, G. Brassard, C. Créeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans. Inform. Theory, vol. 41, pp. 1915-1923, Nov. 1995.
2. G. Bleumer, B. Pfitzmann, and M. Waidner, "A remark on a signature scheme where forgery can be proved," in Advances in Cryptology - Proc. EUROCRYPT '90. Berlin: Springer-Verlag, 1991, pp. 441-445.
3. J. Bos, D. Chaum, and G. Purdy, "A voting scheme," unpublished manuscript, presented at the rump session at Crypto '88.
4. J. Boyar, S. A. Kurtz, and M. W. Krentel, "A discrete logarithm implementation of perfect zero-knowledge blobs," J. Cryptol., vol. 2, no. 2, pp. 63-76, 1990.
5. G. Brassard and C. Crépeau, "Nontransitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond," in Proc. 27th IEEE Symp. Foundations of Computer Science, 1986, pp. 188-195.
6. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," J. Comp. Syst. Sci, vol. 18, pp. 143-154, 1979.
7. D. Chaum, I. B. Damgård, and J. van de Graaf, "Multiparty computations ensuring privacy of each party's input and correctness of the result," in Advances in Cryptology-Proc. CRYPTO '87. Berlin: Springer-Verlag, 1988, pp. 87-119.
8. D. Chaum, E. v. Heijst, and B. Pfitzmann, "Cryptographically strong undeniable signatures, unconditionally secure for the signer," in Advances in Cryptology-Proc. CRYPTO '91. Berlin: Springer-Verlag, 1992, pp. 470-484.
9. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
10. I. B. Damgård, "Collision free hash functions and public key signature schemes," in Advances in Cryptology - Proc. EUROCRYPT '87. Berlin: Springer-Verlag, 1988, pp. 203-216.
11. _, "A design principle for hash functions," in Advances in Cryptology-Proc. CRYPTO '89. Berlin: Springer-Verlag, 1990, pp. 416-427.
12. H. Dobbertin, A. Bosselaers, and B. Preneel, "RIPEMD-160: A strengthened version of RIPEMD," in Proc. 3rd Fast Software Encryption Workshop. Berlin: Springer-Verlag, 1996, pp. 71-82.
13. W. Feller, An Introduction to Probability Theory and Its Applications - Volume II, 2nd ed. New York: Wiley, 1971.
14. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
15. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comp. Syst. Sci., vol. 28, pp. 270-299, 1984.
16. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. Comp., vol. 18, no. 1, pp. 186-208, 1989.
17. J. Kilian, S. Micali, and R. Ostrovsky, "Minimum resource zero-knowledge proofs," in Proc. 30th IEEE Symp. Foundations of Computer Science, 1989, pp. 474-79.
18. S. Micali, C. Rackoff, and B. Sloan, "The notion of security for probabilistic cryptosystems," SIAM J. Comp., vol. 17, no. 2, pp. 412-426, 1988.
19. M. Naor, "Bit commitment using randomness," J. Cryptol., vol. 4, no. 2, pp. 151-158, 1991.
20. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, "Zero-knowledge arguments for N P can be based on general complexity assumptions," in Advances in Cryptology-Proc. CRYPTO '92. Berlin: Springer-Verlag, 1993, pp. 196-214.
21. M. Naor and M. Yung, "Universal one-way hash functions and their cryptographic applications," in Proc. 21st Annual ACM Symp. Theory of Computing, 1989, pp. 33-43.
22. Y. Oren, "On the cunning power of cheating verifiers: Some observations about zero-knowledge proofs," in Proc. 28th IEEE Symp. Foundations of Computer Science, 1987, pp. 462-471.
23. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Advances in Cryptology - Proc. CRYPTO '91. Berlin: Springer-Verlag, 1992, pp. 129-140.
24. Secure Hash Standard, Fed. Inform. Processing Stds. Pub. FIPS PUB 180-1, 1995.
25. M. Tompa and H. Woll, "Random self-reducibility and zero knowledge proofs of possession of information," in Proc. 28th IEEE Symp. Foundations of Computer Science, 1987, pp. 472-482.
26. A. C. Yao, "Theory and applications of trapdoor functions," in Proc. 23rd IEEE Symp. Foundations of Computer Science, 1982, pp. 80-91.
27. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.