Abstract
In this paper we present an efficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits a 0 and a 1 and Bob is committed to b, they both want Bob to learn and commit to a b without Alice learning b nor Bob learning a b. Our protocol, based on the properties of error correcting codes, uses Bit Commitment (BC) and one-out-of-two Oblivious Transfer (OT) as black boxes. Consequently the protocol may be implemented with or without a computational assumption, depending on the kind of BC and OT used by the participants. Assuming a Broadcast Channel is also available, we exploit this result to obtain a protocol for Private Multi-Party Computation, without making assumptions about a specific number or fraction of participants being honest. We analyze the protocol’s efficiency in terms of BCs and OTs performed. Our approach connects Zero Knowledge proofs on BCs, Oblivious Circuit Evaluation and Private Multi-Party Computations in a conceptually simple and eficient way.
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
C.H. Bennett, G. Brassard, J.-M. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, Vol. 17, No.2, 1988, pp. 210–229.
C.H. Bennett, G. Brassard, C. Crépeau, M.-H. Skubiszewska, Practical Quantum Oblivious Transfer, Advances in Cryptology — CRYPTO’91, Springer-Verlag, 1992, pp. 351–366.
G. Brassard, C. Crépeau, R. Jozsa, D. Langlois, A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties, 34th IEEE Symposium on Foundation of Computer Science, 1993, pp. 362–371.
J. L. Carter and M. N. Wegman, Universal Classes of hash function, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143–154.
D. Chaum, I. 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, Springer-Verlag, 1988, pp. 87–119.
R. Cleve, Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, Advances in Cryptology — CRYPTO’89, Springer-Verlag, 1991, pp. 573–590.
C. Crépeau, Equivalence Between Two Flavours of Oblivious Transfer, Advances in Cryptology — CRYPTO’87, Springer-Verlag, 1988, pp. 350–354.
Crépeau, C., Verifiable Disclosure of Secrets and Applications, Advances in Cryptology — Eurocrypt’89, Springer-Verlag, 1990, pp. 181–191.
C. Crépeau, Correct and Private Reductions Among Oblivious Transfers, Ph.D. thesis, MIT, 1990.
C. Crépeau, Quantum Oblivious Transfer, Journal of Modern Optics, vol. 41, No. 12, 1994.
C. Crépeau, J. Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions, 29th IEEE Symposium on Foundation of Computer Science, 1988, pp. 42–52.
C. Crépeau, Cryptographic protocol based on noisy channel, in preparation, 1995.
S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM, Vol 28, 1985, pp. 637–647.
Forney, G. D., Concatenated Codes, The M.I.T. Press, 1966.
M. Franklin, Complexity and security of distributed protocols, Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993.
O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, or: A completeness theorem for protocols with honest majority, 19th ACM Symposium on Theory of Computing, 1987, pp. 218–229.
O. Goldreich, R. Vainish, How to solve any protocol problem — an efficiency improvement, Advances in Cryptology — CRYPTO’87, Springer-Verlag, 1988, pp. 73–86.
S. Goldwasser, L. Levin, Fair computation of general functions in presence of moral majority, Advances in Cryptology — CRYPTO’90, Springer-Verlag, 1991, pp. 77–93.
J. Kilian, Founding cryptography on Oblivious transfer, 20th ACM Symposium on Theory of Computation, 1988, pp. 20–31.
J. Kilian, Uses of Randomness in Algorithms and Protocols, MIT Press, 1990.
J. Kilian, A note on efficient zero-knowledge proofs and arguments, 24th ACM Symposium on Theory of Computation, 1992, pp. 723–732.
J. Kilian, On the complexity of bounded-interaction and noninteractive zero-knowledge proofs, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 466–477.
E. Kushilevitz, S. Micali, R. Ostrovski, Reducibility and completeness in multiparty private computations, 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 478–489.
F. J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.
M. Naor, Bit Commitment using Pseudo-Randomness, Advances in Cryptology — CRYPTO’89, Springer-Verlag, 1989, pp. 128–136.
M. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
D. Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes, 27th ACM Symposium on Theory of Computing, 1995, pp. 388–397.
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
Crépeau, C., van de Graaf, J., Tapp, A. (1995). Committed Oblivious Transfer and Private Multi-Party Computation. 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_9
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_9
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