Analysis on A 1-out-n Security Protocol Based on Threshold Idea

Article Preview

Abstract:

In a 1-out-n oblivious transfer model, the sender sends n messages to the receiver. But the receiver can only get 1 message from the n messages, and the sender does not know which message the receiver has gotten. In this paper, we proposed a multiple-use 1-out-n oblivious transfer protocol based on threshold idea. It is more efficient than Naor-Pinkas protocol[1] and Tzeng protocol[2].

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 605-607)

Pages:

2329-2332

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. Naor and B. Pinkas, Efficient oblivious transfer protocols, 12th Annual Symposium on Discrete Algorithms (SODA), pp.448-457, (2001).

Google Scholar

[2] W.G. Tzeng, Efficient 1-out-n oblivious transfer schemes, " Proc. PKC, 02, LNCS, vol. 2274, pp.159-171, (2002).

Google Scholar

[3] M. Rabin, How to exchange secrets by oblivious transfer, Technical Report TR 81, Aliken Computation Lab, Harvard University.

Google Scholar

[4] S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Commun. ACM, vol. 28, pp.637-647, (1985).

DOI: 10.1145/3812.3818

Google Scholar

[5] G. Brassard, C. Crepeau, and J.M. Robert, All-or-nothing disclosure of secrets, " Proc. Crypto, 86, LNCS, vol. 263, pp.234-238, (1987).

DOI: 10.1007/3-540-47721-7_17

Google Scholar

[6] M. Naor, B. Pinkas, Privacy preserving auctions and mechanism design, in: Proc. Of the 1st ACM Conf. On Electronic Commerce, 1999, pp.129-139.

DOI: 10.1145/336992.337028

Google Scholar