{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:28:07Z","timestamp":1725560887695},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206095"},{"type":"electronic","value":"9783540245827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24582-7_12","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:30:09Z","timestamp":1280388609000},"page":"162-176","source":"Crossref","is-referenced-by-count":25,"title":["On the Power of Computational Secret Sharing"],"prefix":"10.1007","author":[{"given":"V.","family":"Vinod","sequence":"first","affiliation":[]},{"given":"Arvind","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"K.","family":"Srinathan","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"Kwangjo","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-49264-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"P. Beguin","year":"1995","unstructured":"Beguin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 194\u2013208. Springer, Heidelberg (1995)"},{"key":"12_CR2","unstructured":"Beimel, A., Ishai, Y.: On the Power of Non-Linear Secret Sharing. In: Proceedings of 16th IEEE Structure in Complexity Theory (2001)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201336. Springer, Heidelberg (1990)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivous transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 547\u2013557. Springer, Heidelberg (1990)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cachin: On-line secret sharing. In: IMA: IMA Conference on Cryptography and Coding, LNCS lately (earlier: Cryptography and Coding II, Clarendon Press, 1992) (1995)","DOI":"10.1007\/3-540-60693-9_22"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party. In: ACM Conference on Computer and Communications Security, pp. 1\u20135 (1997)","DOI":"10.1145\/266420.266424"},{"key":"12_CR7","series-title":"London Mathematical Society Lecture Note Series","volume-title":"PATBOOL: Boolean Function Complexity","author":"Grigni","year":"1992","unstructured":"Grigni, Sipser: Monotone Complexity. In: PATBOOL: Boolean Function Complexity. London Mathematical Society Lecture Note Series, vol.\u00a0169, Cambridge University Press, Cambridge (1992)"},{"key":"12_CR8","first-page":"99","volume-title":"Proceedings of IEEE Globecom 1987","author":"M. Ito","year":"1987","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings of IEEE Globecom 1987, pp. 99\u2013102. IEEE, Los Alamitos (1987)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the 8 th Annual IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 136\u2013146. Springer, Heidelberg (1994)"},{"key":"12_CR11","unstructured":"Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: SODA 2001, pp. 448\u2013457 (2001)"},{"key":"12_CR12","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. Rabin","year":"1989","unstructured":"Rabin, M.: Efficient dispersal of information for security, load-balancing and faulttolerance. JACM\u00a036, 335\u2013348 (1989)","journal-title":"JACM"},{"issue":"6","key":"12_CR14","first-page":"887","volume":"37","author":"A. Razborov","year":"1985","unstructured":"Razborov, A.: A lower bound on the monotone network complexity of the logical permanent. Mat. Zametki\u00a037(6), 887\u2013900 (1985) (in russian)","journal-title":"Mat. Zametki"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. of STOC, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24582-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:40:08Z","timestamp":1559346008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24582-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206095","9783540245827"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24582-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}