{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:18:11Z","timestamp":1777940291681,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,14]],"date-time":"2010-03-14T00:00:00Z","timestamp":1268524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10623-010-9378-8","type":"journal-article","created":{"date-parts":[[2010,3,13]],"date-time":"2010-03-13T11:35:37Z","timestamp":1268480137000},"page":"11-21","source":"Crossref","is-referenced-by-count":50,"title":["Generalized oblivious transfer by secret sharing"],"prefix":"10.1007","volume":"58","author":[{"given":"Tamir","family":"Tassa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,14]]},"reference":[{"key":"9378_CR1","unstructured":"Aiello B., Ishai Y., Reingold O.: Priced oblivious transfer: how to sell digital goods. In: Proceeding of Eurocrypt601, LNCS 2045, pp. 119\u2013135 (2001)."},{"key":"9378_CR2","unstructured":"Beimel A., Tassa T., Weinreb E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Disc. Math. 22, 360\u2013397 (2008). A preliminary version appeared in The Proceeding of TCC, pp. 600\u2013619 (2005)."},{"key":"9378_CR3","unstructured":"Ben-Ya\u2019akov Y.: Oblivious evaluation of multivariate polynomials and applications. M.Sc. Thesis, The Open University of Israel (2007)."},{"key":"9378_CR4","unstructured":"Brassard G., Cr\u00e9peau C., Robert J.M.: All-or-nothing disclosure of secrets. Advances in Cryptology\u2014Crypto \u201986. Lecture Notes in Computer Science (LNCS), vol. 263, pp. 234\u2013238. Springer Verlag (1987)."},{"key":"9378_CR5","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard G., Cr\u00e9peau C., S\u00e1ntha M.: Oblivious transfers and intersecting codes. IEEE Trans. Inform. Theory (special issue on coding and complexity) 42, 1769\u20131780 (1996)","journal-title":"IEEE Trans. Inform. Theory (special issue on coding and complexity)"},{"key":"9378_CR6","first-page":"105","volume":"6","author":"E.F. Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 6, 105\u2013113 (1989)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"9378_CR7","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even S., Goldreich O., Lempel A.: A randomized protocol for signing contracts. Commun. ACM 28, 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9378_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin R., Naor M., Winkler P.: information without leaking it. Commun. ACM 39, 77\u201385 (1996)","journal-title":"Commun. ACM"},{"key":"9378_CR9","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O., Metcalf-Burton J.R., Padr\u00f3 C., V\u00e1zquez L.: On the Optimization of Bipartite Secret Sharing Schemes. In: ICITS (2009).","DOI":"10.1007\/978-3-642-14496-7_8"},{"key":"9378_CR10","unstructured":"G\u00e1l A.: Combinatorial methods in Boolean function complexity. Ph.D. thesis, University of Chicago (1995)."},{"key":"9378_CR11","first-page":"73","volume":"293","author":"O. Goldreich","year":"1987","unstructured":"Goldreich O., Vainish R.: How to solve any protocol problem: an efficiency improvement. Adv. Cryptol. (CRYPTO), LNCS. 293, 73\u201386 (1987)","journal-title":"Adv. Cryptol. (CRYPTO), LNCS."},{"key":"9378_CR12","unstructured":"Ishai Y., Kushilevitz E.: Private simultaneous messages protocols with applications. In: Proceeding of ISTCS97, IEEE Computer Society, pp. 174\u2013184 (1997)."},{"key":"9378_CR13","doi-asserted-by":"crossref","unstructured":"Killian J.: Founding cryptogrpahy on oblivious transfer. In: Proceeding of the 20th Annual ACM Symposium on Theory of Computing (STOC) pp. 20\u201331 (1988).","DOI":"10.1145\/62212.62215"},{"key":"9378_CR14","unstructured":"Mu Y., Zhang J., Varadharajan V.: m out of n oblivious transfer. ACISP 2002, LNCS, vol. 2384, pp. 395\u2013405 (2002)."},{"key":"9378_CR15","doi-asserted-by":"crossref","unstructured":"Naor M., Pinkas B.: Oblivious polynomial evaluation. In: Proceeding of the 31st Annual ACM Symposium on Theory of computing (STOC), pp. 245\u2013254 (1999).","DOI":"10.1145\/301250.301312"},{"key":"9378_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","volume":"18","author":"M. Naor","year":"2005","unstructured":"Naor M., Pinkas B.: Computationally secure oblivious transfer. J. Cryptol. 18, 1\u201335 (2005)","journal-title":"J. Cryptol."},{"key":"9378_CR17","unstructured":"Rabin M.O.: How to exchange secrets by oblivious transfer. Tech. Memo TR-81, Aiken Computation Laboratory (1981)."},{"key":"9378_CR18","unstructured":"Shankar B., Srinathan K., Pandu Rangan C.: Alternative protocols for generalized oblivious transfer. In: Proceeding of ICDCN08, LNCS, vol. 4904, pp. 304\u2013309 (2008)."},{"key":"9378_CR19","unstructured":"Tassa T.: Hierarchical threshold secret sharing. J. Cryptol. 20, 237\u2013264 (2007). An earlier version appeared in Proceeding of the First Theory of Cryptography Conference, pp. 473\u2013490 (2004)."},{"key":"9378_CR20","doi-asserted-by":"crossref","unstructured":"Yao A.C.: Protocols for secure computation. In: Proceeding of IEEE Foundations of Computer Science (FOCS), pp. 160\u2013164 (1982).","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9378-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9378-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9378-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:48:08Z","timestamp":1739969288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9378-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,14]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9378"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9378-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,14]]}}}