Abstract
A commitment multiplication proof, CMP for short, allows a player who is committed to secrets s, s′ and s″ = s·s′, to prove, without revealing s, s′ or s″, that indeed s″ = ss′. CMP is an important building block for secure general multi-party computation as well as threshold cryptography.
In the standard cryptographic model, a CMP is typically done interactively using zero-knowledge protocols. In the random oracle model it can be done non-interactively by removing interaction using the Fiat-Shamir heuristic. An alternative non-interactive solution in the distributed setting, where at most a certain fraction of the verifiers are malicious, was presented in [1] for Pedersen’s discrete log based commitment scheme. This CMP essentially consists of a few invocations of Pedersen’s verifiable secret sharing scheme (VSS) and is secure in the standard model.
In the first part of this paper, we improve that CMP by arguing that a building block used in its construction in fact already constitutes a CMP. This not only leads to a simplified exposition, but also saves on the required number of invocations of Pedersen’s VSS. Next we show how to construct non-interactive proofs of partial knowledge [8] in this distributed setting. This allows for instance to prove non-interactively the knowledge of ℓ out of m given secrets, without revealing which ones. We also show how to construct efficient non-interactive zero-knowledge proofs for circuit satisfiability in the distributed setting.
In the second part, we investigate generalizations to other homomorphic commitment schemes, and show that on the negative side, Pedersen’s VSS cannot be generalized to arbitrary (black-box) homomorphic commitment schemes, while on the positive side, commitment schemes based on q-one-way-group-homomorphism [7], which cover wide range of currently used schemes, suffice.
Basic Research in Computer Science (www. brics. dk), funded by the Danish National Research Foundation.
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
Masayuki Abe. Robust distributed multiplication without interaction. In Advances in Cryptology-CRYPTO’ 99, volume 1666 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2), 1988.
Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2), 1991.
Mihir Bellare, and Oded Goldreich. On Defining Proofs of Knowledge. In Advances in Cryptology-CRYPTO’ 92, volume 740 of Lecture Notes in Computer Science. Springer, 1998.
Joan F. Boyar, Mark W. Krentel, and Stuart A. Kurtz. A discrete logarithm implementation of zero-knowledge blobs. Technical Report TR-87-02, Department of Computer Science, University of Chicago, 1987.
Ronald Cramer and Ivan Damgård. L Linear zero-knowledge: A note on efficient zero-knowledge proofs and arguments. In 29th ACM Symposium on Theory of Computing. ACM Press, 1997.
Ronald Cramer and Ivan Damgård. Zero-knowledge proofs for finite field arithmetic or: Can zero-knowledge be for free? In Advances in Cryptology-CRYPTO’ 98, volume 1462 of Lecture Notes in Computer Science. Springer, 1998.
Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology-CRYPTO’ 94, volume 839 of Lecture Notes in Computer Science. Springer, 1994.
Ronald Cramer and Serge Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Advances in Cryptology-CRYPTO’ 02, volume 2442 of Lecture Notes in Computer Science. Springer, 2002.
Ronald Cramer, Matthew Franklin, Berry Schoenmakes, and Moti Yung. Multiauthority secret-ballot elections with linear work. In Advances in Cryptology-EUROCRYPT’ 96, volume 1070 of Lecture Notes in Computer Science. Springer, 1996.
Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science. IEEE, 1985.
Rosario Gennaro, Michael O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM Symposium on Principles of Distributed Computing, 1998.
Martin Hirt and Ueli Maurer Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In 16th ACM Symposium on Principles of Distributed Computing, 1997. Final version appeared in Journal of Cryptology 2000.
Maurizio Karchmer and Avi Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory. IEEE, 1993.
Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-EUROCRYPT’ 99, Lecture Notes in Computer Science. Springer, 1999.
Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology-CRYPTO’ 91, volume 576 of Lecture Notes in Computer Science. Springer, 1991.
Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11), 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abe, M., Cramer, R., Fehr, S. (2002). Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive