Abstract

Abstract. We describe slightly modified version (that we call the HOT protocol) of the Aiello-Ishai-Reingold oblivious transfer protocol from Eurocrypt 2001. In particular, the HOT protocol will be what we call weakly secure when coupled with many different homomorphic semantically secure public-key cryptosystems. Based on the HOT protocol, we construct an efficient verifiable oblivious transfer protocol and an efficient verifiable private equality test. As a concrete application of our results, we propose a novel protocol called proxy verifiable private equality test, and apply it to a cryptographic auction scheme to improve its security.

Citations

135	Efficient proofs that a committed number lies in an interval - Boudot - 2000
81	Priced oblivious transfer: How to sell digital goods - Aiello, Ishai, et al.
43	Committed Oblivious Transfer and Private Multi-Party Computation - Crépeau, Graaf, et al. - 1995
27	Paillier’s cryptosystem revisited - Catalano, Gennaro, et al. - 2001
26	A fair and efficient solution to the socialist millionaires’ problem - Boudot, Schoenmakers, et al.
20	Optimistic fair secure computation - Cachin, Camenisch - 2000
16	Cryptographic randomized response techniques - Ambainis, Jakobsson, et al. - 2004
10	Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments - Cramer, Damg˚ard - 1997
7	Comitted oblivious transfer and private multiparty commputation - Crepeau, Graaf, et al. - 1995
2	Linear zero-knowledge { a note on ecient zero-knowledge proofs and arguments - Cramer, Damgard - 1997
1	A Fair and Ecient Solution to the Socialist Millionaires - Boudot, Schoenmakers, et al. - 2001