Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 434))
Included in the following conference series:
3466Accesses
Abstract
A (\( (_1^2 ) \))-Oblivious Bit Transfer protocol is a way for a party Rachel to get one bit from a pairb0,b1 that another party Sam offers her. The difficulty is that Sam should not find out which secret Rachel is getting while Rachel should not be able to get partial information about more than one of the bits. This paper shows a way to make “verifiable” this protocol (v-(\( (_1^2 ) \))-Oblivious Bit Transfer) and shows that it can be used to directly achieve oblivious circuit evaluation [Ki] and fair exchange of bits [MRL], assuming the existence of a non-verifiable version of the protocol.
Research supported in part by an N.S.E.R.C. postgraduate scholarship. Some of this research was done while visiting Århus University.
Chapter PDF
Similar content being viewed by others
10 References
Blum, Manuel. “Three applications of the oblivious transfer: Part I: Coin flipping by telephone; Part II: How to exchange secrets; Part III: How to send certified electronic mail”, Department of EECS, University of California, Berkeley, CA, 1981.
Brassard, Gilles, David Chaum, and Claude Crépeau. “Minimum disclosure proofs of knowledge” (revised version),Technical Report PM-R8710, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands, 1987.
Brassard, Gilles, Claude Crépeau, and Jean-Marc Robert. “All-or-Nothing Disclosure of Secrets,”Proceedings Crypto 86, Springer-Verlag, 1987.
Brassard, Gilles, Claude Crépeau, and Jean-Marc Robert. “Information Theoretic Reductions Among Disclosure Problems,”Proceedings of the 27thFOCS, IEEE, 1986, 168–173.
Crépeau Claude, “Equivalence Between Two Flavours of Oblivious Transfer”,Proceedings of Crypto 87, 1988, Springer-Verlag.
Chaum David, Ivan Damgård, and Jeroen 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, 87–119.
Goldreich, Oded, Silvio Micali, and Avi Wigderson. “How to play any mental game, or: A completeness theorem for protocols with honest majority”,Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, 218–229.
Goldreich, Oded, Vainish.Advances in Cryptology CRYPTO’ 87 Proceedings, Springer-Verlag, 1988.
Kilian, Joe, “On The Power of Oblivious Transfer,”Proceedings of the 20thSTOC, ACM, 1988.
Micali, Silvio, Charles Rackoff, Mike Luby, “How to Simultaneously Exchange a Secret Bit by flipping Assymetrically Biased coins”,Proceedings of the 24thFOCS, IEEE, 1983, 11–21.
Rabin, Michael, “How to exchange secrets by oblivious transfer,” Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
Author information
Authors and Affiliations
MIT-Laboratory for Computer Science, 545 Technology Square, Cambridge, MA, 02139, USA
Claude Crépeau
- Claude Crépeau
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Philips Research Laboratory, Avenue Albert Einstein 4, B-1348, Louvain-la-Neuve, Belgium
Jean-Jacques Quisquater
ESAT Laboratory, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium
Joos Vandewalle
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crépeau, C. (1990). Verifiable Disclosure of Secrets and Applications (Abstract). In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_17
Download citation
Published:
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-53433-4
Online ISBN:978-3-540-46885-1
eBook Packages:Springer Book Archive
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative