Generalized oblivious transfer by secret sharing

Designs, Codes, and Cryptography

Volumn 58, Issue 1, 2011, Pages 11-21

  Tassa, Tamir ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Access structures; Generalized oblivious transfer; Multiparty computation; Oblivious transfer; Secret sharing

Indexed keywords

COMPUTER APPLICATIONS; MATHEMATICAL TECHNIQUES;

ACCESS STRUCTURE; MULTIPARTY COMPUTATION; MULTIVARIATE POLYNOMIAL; OBLIVIOUS TRANSFER; SECRET SHARING;

CRYPTOGRAPHY;

EID: 79551472032     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-010-9378-8     Document Type: Article

References (20)

1. Aiello B., Ishai Y., Reingold O.: Priced oblivious transfer: how to sell digital goods. In: Proceeding of Eurocrypt601, LNCS 2045, pp. 119-135 (2001).
2. Beimel A., Tassa T., Weinreb E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Disc. Math. 22, 360-397 (2008). A preliminary version appeared in The Proceeding of TCC, pp. 600-619 (2005).
3. Ben-Ya'akov Y.: Oblivious evaluation of multivariate polynomials and applications. M.Sc. Thesis, The Open University of Israel (2007).
4. Brassard G., Crépeau C., Robert J.M.: All-or-nothing disclosure of secrets. Advances in Cryptology-Crypto '86. Lecture Notes in Computer Science (LNCS), vol. 263, pp. 234-238. Springer Verlag (1987).
5. G. Brassard C. Crépeau M. Sántha 1996 Oblivious transfers and intersecting codes IEEE Trans. Inform. Theory (special issue on coding and complexity) 42 1769 1780 0873.94015
6. E.F. Brickell 1989 Some ideal secret sharing schemes J. Combin. Math. Combin. Comput. 6 105 113 0685.94003 1025010
7. S. Even O. Goldreich A. Lempel 1985 A randomized protocol for signing contracts Commun. ACM 28 637 647 10.1145/3812.3818 800680 (Pubitemid 15569164)
8. R. Fagin M. Naor P. Winkler 1996 information without leaking it Commun. ACM 39 77 85 10.1145/229459.229469
9. Farràs O., Metcalf-Burton J.R., Padró C., Vázquez L.: On the Optimization of Bipartite Secret Sharing Schemes. In: ICITS (2009).
10. Gál A.: Combinatorial methods in Boolean function complexity. Ph.D. thesis, University of Chicago (1995).
11. O. Goldreich R. Vainish 1987 How to solve any protocol problem: an efficiency improvement Adv. Cryptol. (CRYPTO), LNCS. 293 73 86
12. Ishai Y., Kushilevitz E.: Private simultaneous messages protocols with applications. In: Proceeding of ISTCS97, IEEE Computer Society, pp. 174-184 (1997).
13. Killian J.: Founding cryptogrpahy on oblivious transfer. In: Proceeding of the 20th Annual ACM Symposium on Theory of Computing (STOC) pp. 20-31 (1988).
14. Mu Y., Zhang J., Varadharajan V.: m out of n oblivious transfer. ACISP 2002, LNCS, vol. 2384, pp. 395-405 (2002).
15. Naor M., Pinkas B.: Oblivious polynomial evaluation. In: Proceeding of the 31st Annual ACM Symposium on Theory of computing (STOC), pp. 245-254 (1999).
16. M. Naor B. Pinkas 2005 Computationally secure oblivious transfer J. Cryptol. 18 1 35 1075.68026 10.1007/s00145-004-0102-6 2117613 (Pubitemid 40963344)
17. Rabin M.O.: How to exchange secrets by oblivious transfer. Tech. Memo TR-81, Aiken Computation Laboratory (1981).
18. Shankar B., Srinathan K., Pandu Rangan C.: Alternative protocols for generalized oblivious transfer. In: Proceeding of ICDCN08, LNCS, vol. 4904, pp. 304-309 (2008).
19. Tassa T.: Hierarchical threshold secret sharing. J. Cryptol. 20, 237-264 (2007). An earlier version appeared in Proceeding of the First Theory of Cryptography Conference, pp. 473-490 (2004).
20. Yao A.C.: Protocols for secure computation. In: Proceeding of IEEE Foundations of Computer Science (FOCS), pp. 160-164 (1982).