DocumentCode
2392746
Title
Reducing oblivious string transfer to universal oblivious transfer
Author
Wolf, Stefan
Author_Institution
Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland
fYear
2000
fDate
2000
Firstpage
465
Abstract
It is shown that oblivious transfer of strings can be reduced to the weakest version of oblivious bit transfer, where the receiver can choose to obtain arbitrary (but incomplete) information about the pair of bits sent. This solves an open problem posed by Brassard and Crepeau (see Advances in Cryptography$EUROCRYPT´ 97, LNCS, vol.1233, p.334-45, Springer-Verlag, 1997)
Keywords
cryptography; encoding; protocols; correlated randomness; cryptographic primitives; cryptographic protocols; incomplete information; information-theoretic reduction; key agreement; noisy communication channels; oblivious bit transfer; oblivious string transfer reduction; open problem solution; receiver; secure message transmission; secure multi-party computation; universal oblivious transfer; Communication channels; Computer science; Cryptographic protocols; Cryptography; Error probability; Information security; Noise reduction; Privacy;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866763
Filename
866763
Link To Document