Abstract
In this paper we address the problem of commitment schemes where the sender is bounded to polynomial time and the receiver may be all powerful. We present a scheme for committing to a (possibly long) string. Our scheme is efficient in the following three ways:
-
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156–189, 1988.
M. Blum. Coin flipping by telephone. In Proc. IEEE Spring COMPCOM, pages 133–137. IEEE, 1982.
M. Blum and S. Micali. Coin flipping into a well. Unpublished, 1981.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing, 13(4):850–863, November 1984.
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.
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.
I.B. Damgård. On the existence of a bit commitment schemes and zero-knowledge proofs. In G. Brassard, editor, Proceedings CRYPTO 89, pages 17–29. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
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.
S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28(2):270–299, April 1984.
S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281–308, April 1988.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691–729, 1991.
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.
M. Naor. Bit commitment using pseudo-randomness. In G. Brassard, editor, Proceedings CRYPTO 89, pages 128–137. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halevi, S. (1995). Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive