Robust t-out-of-n oblivious transfer mechanism based on CRT

Journal of Network and Computer Applications

Volumn 32, Issue 1, 2009, Pages 226-235

  Chang, Chin Chen ^a,b   Lee, Jung San ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Blind signature; Communication; CRT; Oblivious transfer; Privacy

Indexed keywords

COMMUNICATION; CRYPTOGRAPHY; ELECTRONIC COMMERCE; FLUORESCENT SCREENS; TELEPHONE EXCHANGES;

BLIND SIGNATURE; BLIND SIGNATURES; CHINESE REMAINDER THEOREMS; CRT; E COMMERCES; NOVEL METHODS; OBLIVIOUS TRANSFER; OBLIVIOUS TRANSFERS; PRIVACY; PRIVATE COMMUNICATIONS;

TELEVISION PICTURE TUBES;

EID: 56149118070     PISSN: 10848045     EISSN: 10958592     Source Type: Journal    
DOI: 10.1016/j.jnca.2008.03.004     Document Type: Article

References (27)

1. Aiello B., Ishai Y., and Reingold O. Priced oblivious transfer: how to sell digital goods. Proceedings of advances in EUROCRYPT'01, Aarhus, Denmark, May 21-23 (2001) 119-135
2. Bellare M., and Micali S. Non-interactive oblivious transfer and applications. Proc Adv Crypto'89 vol. 435 (1990) 547-557
3. Brassard G., Crepeau C., and Robert J.M. Information theoretic reduction among disclosure problems. IEEE Symp Found Comput Sci (1986) 168-173
4. Cachin C. On the foundations of oblivious transfer. Proceedings of advances in cryptography (EUROCRYPT '98), Espoo, Finland, May/June (1998) 361-374
5. Chang C.C., and Lai Y.P. A fast modular square computing method based on the generalized Chinese remainder theorem for prime module. Appl Math Comput 161 1 (2005) 181-194
6. Chaum D. Untraceable electronic mail, return addresses and digital pseudonyms. Commun ACM 24 2 (1981) 84-88
7. Chaum D. Blinding for unanticipated signatures. Proceedings of advances in EUROCRYPT'87, Berlin (1987) 227-233
8. Crescenzo G.D., Malkin T., and Ostrovsky R. Single database private information retrieval implies oblivious transfer. Proceedings of advances in EUROCRYPT'00, Bruges, Belgium, May (2000) 122-138
9. Davida G.I., Wells D.L., and Kam J.B. A database encryption system with subkeys. ACM Trans Database Syst 6 2 (1981) 312-328
10. Ding Y.Z. Oblivious transfer in the bounded storage model. Proceedings of advances in Crypto'01, Santa Barbara, CA, USA, August (2001) 155-170
11. Dodis Y., and Micali S. Lower bounds for oblivious transfer reductions. Proceedings of advances in Crypto'99, Santa Barbara, CA, USA, August (1999) 42-45
12. ElGamal T. A public-key cryptosystem and a signature protocol based on discrete logarithms. IEEE Trans Inf Theory 31 4 (1985) 469-472
13. Even S., Goldreich O., and Lempel A. A randomized protocol for signing contracts. Commun ACM (1985) 637-647
14. Garay J.A., and MacKenzie P.D. Concurrent oblivious transfer. Proceedings of the 41st symposium on foundations of computer science, Redondo Beach, CA, USA (2000) 314-324
15. Gramer R., and Shoup V. Signature schemes based on the strong RSA assumption. Proceedings of the sixth ACM conference on computer and communications security, Singapore (1999) 46-51
16. Kilian J. Founding cryptography on oblivious transfer. Proceedings of the 20th ACM symposium on theory of computing, Chicago, USA (1988) 20-31
17. Kurosawa K., and Duong Q.V. How to design efficient multiple-use 1-out-of-n oblivious transfer. IEICE Trans Fund Electron Commun, Comput Sci E87-A 1 (2004) 141-146
18. Lee N.Y., and Hwang T. On the security of blind signature protocol using oblivious transfer. Comput Commun (1999) 287-290
19. Mu Y., Zhang J., Varadharajan V., and Lin Y.X. Robust non-interactive oblivious transfer. IEEE Commun Lett 7 4 (2003) 153-155
20. Naor M., and Pinkas B. Oblivious transfer with adaptive queries. Proceedings of advances in Crypto'99, Santa Barbara, CA, USA, August (1999) 573-590
21. Naor M., and Pinkas B. Oblivious transfer and polynomial evaluation. Proceedings of the 31st ACM symposium on theory of computing, Atlanta, USA (1999) 245-254
22. Naor M., and Pinkas B. Distributed oblivious transfer. Proceedings of advances in Asiacrypt'00, Kyoto, Japan, December (2000) 205-219
23. Naor M., and Pinkas B. Efficient oblivious transfer protocols. Proceedings of the 12th annual symposium on discrete algorithms, Washington, USA (2001) 448-457
24. Rabin M. How to exchange secrets by oblivious transfer. Technical report, Aiken Computation Laboratory, Harvard University, 1981.
25. Rivest R.L., Shamir A., and Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21 2 (1977) 120-126
26. Tzeng W.G. Efficient 1-out-of-n oblivious transfer protocols with universally usable parameter. IEEE Trans Comput 53 2 (2004) 232-240
27. Wakaha O., and Ryota S. k-out-of-n oblivious transfer without random oracle. IEICE Trans Fund Electron Commun Comput Sci E87-A 1 (2004) 147-151