Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
Round Efficiency: Each part of the scheme consists of a single round.
Low Communication: The number of bits required for the commitment equals the security parameter of the system, regardless of the length of the string which is being committed to.
Fast Implementation: The time taken to commit to a string is linear in the length of the string and almost linear in the security parameter of the system.
- [BC91]G. Brassard and C. Crèpeau. Quantum bit commitment and coin tossing protocols. In A.J. Menezes and S. A. Vanstone, editors, Proceedings CRYPTO 90, pages 49–61. Springer-Verlag, 1991. Lecture Notes in Computer Science No. 537.Google Scholar
- [Blu82]M. Blum. Coin flipping by telephone. In Proc. IEEE Spring COMPCOM, pages 133–137. IEEE, 1982.Google Scholar
- [BM81]M. Blum and S. Micali. Coin flipping into a well. Unpublished, 1981.Google Scholar
- [BMO90]M. Bellare, S. Micali, and R. Ostrovsky. The (true) complexity of statistical zero-knowledge. In Proc. 22nd ACM Symposium on Theory of Computing, pages 494–502, Baltimore, Maryland, 1990. ACM.Google Scholar
- [Dam88]I.B. Damgård. Collision free hash functions and public key signature schemes. In David Chaum and Wyn L. Price, editors, Proceedings of EUROCRYPT 87, pages 203–216. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 304.Google Scholar
- [DPP94]I.B. Damgård, T.P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Douglas R. Stinson, editor, Proceedings CRYPTO 93, pages 250–265. Springer, 1994. Lecture Notes in Computer Science No. 773.Google Scholar
- [IOS94]T. Itoh, Y. Ohta, and H. Shizuya. Language dependent secure bit commitment. In Yvo G. Desmedt, editor, Proceedings CRYPTO 94, pages 188–201. Springer, 1994. Lecture Notes in Computer Science No. 839.Google Scholar
- [NOVY92]M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for np can be based on general complexity assumptions. In Ernest F. Brickell, editor, Proceedings CRYPTO 92, pages 196–214. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740.Google Scholar