Abstract
A (21)-Oblivious Bit Transfer protocol is a way for a party Rachel to get one bit from a pair b0, 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-(21)-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.
Cite
CITATION STYLE
Crépeau, C. (1990). Verifiable disclosure of secrets and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 434 LNCS, pp. 150–154). Springer Verlag. https://doi.org/10.1007/3-540-46885-4_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
