A secure and efficient t-out-of-n oblivious transfer based on the generalized Aryabhata remainder theorem

Journal of Information Hiding and Multimedia Signal Processing

Volumn 5, Issue 2, 2014, Pages 223-233

  Liu, Yanjun ^a,b   Chang, Chin Chen ^b,c   Chang, Shih Chang ^d  

^a ANHUI UNIVERSITY   (China)

^b ASIA UNIVERSITY   (Taiwan)

^c FENG CHIA UNIVERSITY   (Taiwan)

^d NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

BAN logic; Efficiency; Generalized aryabhata remainder theorem (GART); Oblivious transfer (OT); Security

Indexed keywords

EFFICIENCY; MULTIMEDIA SIGNAL PROCESSING; PATTERN RECOGNITION;

BAN LOGIC; CHINESE REMAINDER THEOREM; ELECTRONIC CONTRACT SIGNING; OBLIVIOUS TRANSFER; REMAINDER THEOREM; SECURITY; TWO-PARTY PROTOCOLS; WIRELESS COMMUNICATIONS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 84896029505     PISSN: 20734212     EISSN: 20734239     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. B. Aiello, Y. Ishai, and O. Reingold, Priced oblivious transfer: how to sell digital goods, Proc. of EUROCRYPT, LNCS 2045, pp. 119-135, 2001.
2. M. Bellare, and S. Micali, Non-interactive oblivious transfer and application, Proc. of CRYPTO, LNCS 435, pp. 547-557, 1989.
3. G. Brassard, C. Crepeau, and J. M. Robert, Information theoretic reductions among disclosure problems, Proc. of the 27th Annual Symposium on Foundations of Computer Science, pp. 168-173, 1986.
4. M. Burrows, M. Abadi, and R. Needham, A logic of authentication, ACM Trans. Computer Systems, vol. 8, no. 1, pp. 18-36, 1990.
5. C. Cachin, On the foundations of oblivious transfer, Proc. of EUROCRYPT, LNCS 1403, pp. 361-374, 1998.
6. G. D. Crescenzo, T. MalkinOn, and R. Ostrovsky, Single database private information retrieval implies oblivious transfer, Proc. of EUROCRYPT, LNCS 1807, pp. 122-138, 2000.
7. C. C. Chang, and Y. P. Lai, A fast modular square computing method based on the generalized Chinese remainder theorem for prime module, Journal of Applied Mathematics and Computation, vol. 161, no. 1, pp. 181-194, 2005.
8. C. C. Chang, and H. C. Lee, A new generalized group-oriented cryptoscheme without trusted centers, IEEE Journal on Selected Areas in Communications, vol. 11, no. 5, pp. 725-729, 2006.
9. C. C. Chang, and J. S. Lee, Robust t-out-of-n oblivious transfer mechanism based on CRT, Journal of Network and Computer Applications, vol. 32, no. 1, pp. 226-235, 2009.
10. C. C. Chang, J. S. Yeh, and J. H. Yang, Generalized Aryabhata remainder theorem, International Journal of Innovative Computing, Information and Control, vol. 6, no. 4, pp. 1865-1871, 2010.
11. Y. Z. Ding, Oblivious transfer in the bounded storage model, Proc. of CRYPTO, LNCS 2139, pp. 155-170, 2001.
12. Y. Dodis, and S. Micali, Lower bounds for oblivious transfer reductions, Proc. of EUROCRYPT, LNCS 1592, pp. 42-55, 1999.
13. S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM, vol. 28, no. 6, pp. 637-647, 1985.
14. J. A. Garay, and P. D. MacKenzie, Concurrent oblivious transfer, Proc. of the 41st Annual Symposium on Foundations of Computer Science, pp. 314-324, 2000.
15. J. Kilian, Founding cryptography on oblivious transfer, Proc. of the 20th annual ACM symposium on Theory of computing, pp. 20-31, 1988.
16. Y. P. Lai, and C. C. Chang, Parallel computational algorithms for generalized Chinese remainder theorem, Journal of Computers and Electrical Engineering, vol. 29, no. 8, pp. 801-811, 2003.
17. J. S. Lee, and C. C. Chang, Choosing t-out-of-n secrets by oblivious transfer, Journal of INFORMATION & SECURITY, vol. 18, no. 8, pp. 67-84, 2006.
18. N. Y. Lee, and T. Hwang, On the security of fair blind signature scheme using oblivious transfer, Journal of Computer Communications, vol. 22, no. 3, pp. 287-290, 1999.
19. M. Naor, and B. Pinkas, Efficient oblivious transfer protocols, Proc. of the 12th annual ACM-SIAM symposium on Discrete algorithms, pp. 448-457, 2001.
20. M. Naor, and B. Pinkas, Oblivious transfer and polynomial evaluation, Proc. of the 31st annual ACM symposium on Theory of computing, pp. 245-254, 1999.
21. M. O. Rabin, How to exchange secrets by oblivious transfer, Technical Report TR-81, Aiken Computation Laboratory, Harvard University, USA, 1981.
22. T. R. N. Rao, and C. H. Yang, Aryabhata remainder theorem: relevance to public-key Cryptoalgorithms, Journal of Circuits, Systems and Signal Processing, vol. 25, no. 1, pp. 1-5, 2004.
23. W. G. Tzeng, Efficient 1-out-of-n oblivious transfer protocols with universally usable parameter, IEEE Trans. Computers, vol. 53, no. 2, pp. 232-240, 2004.
24. O. Wakaha, and S. Ryota, K-out-of-n oblivious transfer without random oracles, Journal of IEICE Trans Fundam Electron Commun Comput Sci, vol. E87-A, no. 1, pp. 147-151, 2004.
25. Q. H. Wu, J. H. Zhang, and Y. M. Wang, Practical t-out-n oblivious transfer and its applications, Journal of Information and Communications Security, LNCS 2836, pp. 226-237, 2003.