Abstract
Bit commitment schemes are central to all zero-knowledge protocols [GMR89] for NP-complete problems [GMW86, BC86a, BC86b, BCC88, BCY89, FS89, etc.]. One-way group actions is a natural and powerful primitive for the implementation of bit commitment schemes. It is a generalization of the one-way group homomorphism [IY88], which was not powerful enough to capture the bit commitment scheme based on graph isomorphism [BC86b]. It provides a unified theory for all the known bit commitment schemes that offer unconditional protection for the originator of the commitments, and for many of those that offer her statistical protection. (Unconditional protection means that the value of the bit committed to is always perfectly concealed. Statistical protection either means that this is almost always the case, or that only an arbitrarily small probabilistic bias about this bit can leak; in either cases, statistical protection must hold even against unlimited computing power.)
Bit commitment schemes based on one-way group actions automatically have the chameleon property [BCC88] (also called trap-door [FS89]), which is useful for the parallelization of zero-knowledge protocols [BCY89, FS89]. Moreover, these bit commitment schemes allow the originator of two commitments to convince the receiver that they are commitments to the same bit, provided that this is so, without disclosing any information about which bit this is.
In addition, one-way group actions are also a natural primitive for the implementation of claw-free pairs of functions [GMRi88].
Supported in part by Canada NSERC grant A4107.
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
Abadi, M., J. Feigenbaum, and J. Kilian, “On hiding information from an oracle”, Journal of Computer and System Sciences, Vol. 39, 1989, pp. 21–50.
Angluin, D. and D. Lichtenstein, “Provable security of cryptosystems: A survey”, Technical Report Yaleu/dcs/tr-288, Department of Computer Science, Yale University, 1983.
Bellare, M., S. Micali, and R. Ostrovsky, “Perfect zero-knowledge in constant rounds”, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 482–493.
Bennett, C.H. and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing”, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India, December 1984, pp. 175–179.
Blum, M. and S. Kannan, “Designing programs that check their work”, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 86–97.
Blum, M. and S. Micali, “How to generate cryptographically strong sequences of pseudo-random bits”, SIAM Journal on Computing, Vol. 13, 1984, pp. 850–864.
Boyar, J. F., M. W. Krentel, and S. A. Kurtz, “A discrete logarithm implementation of zero-knowledge blobs”, Journal of Cryptology, Vol. 2, no. 2, 1990.
Brassard, G., “Cryptology column — Bit commitment schemes”, Sigact News, in preparation, 1991.
Brassard, G., D. Chaum, and C. Crépeau, “Minimum disclosure proofs of knowledge”, Journal of Computer and System Sciences, Vol. 37, no. 2, 1988, pp. 156–189.
Brassard, G. and C. Crépeau, “Zero-knowledge simulation of Boolean circuits”, Advances in Cryptology: CRYPTO’ 86 Proceedings, Springer-Verlag, 1987, pp. 224–233.
Brassard, G. and C. Crépeau, “Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 188–195.
Brassard, G. and C. Crépeau, “Quantum bit commitment and coin tossing protocols”, Advances in Cryptology: these CRYPTO’ 90 Proceedings, Springer-Verlag.
Brassard, G., C. Crépeau, and M. Yung, “Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds”, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Springer-Verlag, 1989, pp. 123–136. Final paper to appear in Theoretical Computer Science under the title of “Constant-round perfect zero-knowledge computationally convincing protocols”.
Burmester, M. V. D., Y. G. Desmedt, F. Piper, and M. Walker, “A meta zero-knowledge scheme”, Proceedings of CO89 Combinatorial Optimization Conference, University of Leeds, July 1989. Submitted for journal publication.
Chaum, D., “Demonstrating that a public predicate can be satisfied without revealing any information about how”, Advances in Cryptology: CRYPTO’ 86 Proceedings, Springer-Verlag, 1987, pp. 195–199.
Chaum, D., I. B. Damgård, and J. van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result”, Advances in Cryptology: CRYPTO’ 87 Proceedings, Springer-Verlag, 1988, pp. 87–119.
Feige, U. and A. Shamir, “Zero knowledge proofs of knowledge in two rounds”, Advances in Cryptology: CRYPTO’ 89 Proceedings, Springer-Verlag, 1990, pp. 526–544.
Feigenbaum, J., S. Kannan, and N. Nisan, “Lower bounds on random self-reducibility”, Proceedings of the 5th IEEE Structure in Complexity Theory Conference, 1990.
Goldreich, O., S. Micali, and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design”, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 174–187.
Goldwasser, S., S. Micali, and C. Rackoff, “The knowledge complexity of interactive proof systems”, SIAM Journal on Computing, Vol. 18, no. 1, 1989, pp. 186–208.
Goldwasser, S., S. Micali, and R. Rivest, “A secure digital signature scheme”, SIAM Journal on Computing, Vol. 17, no. 2, 1988, pp. 281–308.
Håstad, J., “Pseudo-random generators under uniform assumptions”, Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 395–404.
Impagliazzo, R., L. Levin, and M. Luby, “Pseudo-random generation from one-way functions”, Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 12–24.
Impagliazzo, R. and M. Luby, “One-way functions are essential for complexity based cryptography”, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 230–235.
Impagliazzo, R. and M. Naor, “Efficient cryptographic schemes provably as secure as subset sum”, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 236–241.
Impagliazzo, R. and M. Yung, “Direct minimum-knowledge computations”, Advances in Cryptology: CRYPTO’ 87 Proceedings, Springer-Verlag, 1988, pp. 40–51.
Kranakis, E., Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.
Maurer, U. M., “Fast generation of secure RSA-moduli with almost maximal diversity”, Advances in Cryptology: EUROCRYPT’ 89 Proceedings, Springer-Verlag, to appear.
Naor, M., “Bit commitment using pseudo-randomness”, Advances in Cryptology: CRYPTO’ 89 Proceedings, Springer-Verlag, 1990, pp. 128–136.
Naor, M., R. Ostrovsky, R. Venkatesan, and M. Yung, manuscript, 1990.
Ostrovsky, R., R. Venkatesan, and M. Yung, manuscript, 1990.
Pohlig, S. and M. E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Transactions on Information Theory, Vol. IT-24, 1978, pp. 106–110.
Shizuya, H. and T. Itoh, “A group-theoretic interface to random self-reducibility”, Transactions of the Institute of Electronics, Information and Communication Engineers (IEICE) of Japan, Section E, Vol. E73, no. 7, July 25, 1990.
Tompa, M. and H. Woll, “Random self-reducibility and zero-knowledge proofs of possession of knowledge”, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 472–482.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brassard, G., Yung, M. (1991). One-Way Group Actions. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive