How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 1, 2004, Pages 141-146

  Kurosawa, Kaoru ^a   Duong, Quang Viet ^b  

^a IBARAKI UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Diffie Hellman assumption; Oblivious transfer

Indexed keywords

COMPUTER SIMULATION; FUNCTION EVALUATION; INFORMATION ANALYSIS; INFORMATION THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA; THEOREM PROVING;

DIFFE-HELLMAN ASSUMPTION; OBLIVIOUS TRANSFER;

NETWORK PROTOCOLS;

EID: 0842267125     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (13)

1. M. Bellare, A. Boldyreva, and J. Staddon, "Randomness reuse in multi-recipient encryption scheme," Proc. PKC'03, LNCS, vol.2567, pp.85-99, 2003.
2. G. Brassard, C. Crépeau, and J.M. Robert, "Information theoretic reduction among disclosure problems," 27th IEEE Symposium on Foundations of Computer Science, pp.168-173, 1986.
3. G. Brassard, C. Crépeau, and J.M. Robert, "All-or-nothing disclosure of secrets," Proc. Crypto'86, LNCS, vol.263, pp.234-238, 1987.
4. C. Cachin, "On the foundations of oblivious transfer," Proc. Eurocrypt'98, LNCS, vol.1403, pp.361-374, 1998.
5. C. Crépeau, "Equivalence between two flavors of oblivious transfers," Proc. Crypto'87, LNCS, vol.293, pp.350-354, 1988.
6. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," Commun. ACM, vol.28, pp.637-647, 1985.
7. O. Goldreich and R. Vainish, "How to solve any protocol problem: An efficient improvement," Proc. Crypto'87, LNCS. vol.293, pp.73-86, 1988.
8. J. Kilian, "Founding cryptography on oblivious transfer," 20th ACM Symposium on Theory of Computing, pp.20-31, 1988.
9. K. Kurosawa, "Multi-recipient public-key encryption with shortened ciphertext," Proc. PKC'02, LNCS, vol.2274, pp.48-63, 2002.
10. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation," 31st ACM Symposium on Theory of Computing, pp.145-254, 1999.
11. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," 12th Annual Symposium on Discrete Algorithms (SODA), pp.448-457, 2001.
12. M. Rabin, "How to exchange secrets by oblivious transfer," Technical Report TR 81, Aiken Computation Lab., Harvard University, 1981.
13. W.G. Tzeng, "Efficient 1-out-n oblivious transfer schemes," Proc. PKC'02, LNCS, vol.2274, pp.159-171, 2002.