{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T21:22:57Z","timestamp":1751923377249},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_36","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"515-529","source":"Crossref","is-referenced-by-count":62,"title":["Strong Conditional Oblivious Transfer and Computing on Intervals"],"prefix":"10.1007","author":[{"given":"Ian F.","family":"Blake","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. 22nd ACM Symp. on Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Cachin, C., Camenisch, J., Kilian, J., Muller, J.: One-round secure computation and secure autonomous mobile agents. In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (2000)","DOI":"10.1007\/3-540-45022-X_43"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-48184-2_43","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, p. 462. Springer, Heidelberg (1988)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and time-released encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 74\u201389. Springer, Heidelberg (1999)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-39799-X_6","volume-title":"Advances in Cryptology","author":"Y. Desmedt","year":"1986","unstructured":"Desmedt, Y.: Unconditionally secure authentication schemes and practical and theoretical consequences. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 42\u201355. Springer, Heidelberg (1986)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Fischlin","year":"2001","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 457\u2013471. Springer, Heidelberg (2001)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"issue":"2","key":"36_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00145-001-0015-6","volume":"15","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D.: Elliptic curve paillier schemes. Journal of Cryptology\u00a015(2), 129\u2013138 (2002)","journal-title":"Journal of Cryptology"},{"key":"36_CR9","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"36_CR10","first-page":"365","volume-title":"Proc. 14th ACM Symp. on Theory of Computing","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proc. 14th ACM Symp. on Theory of Computing, San Francisco, pp. 365\u2013377. ACM, New York (1982)"},{"issue":"2","key":"36_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/PL00003821","volume":"12","author":"S. Halevi","year":"1999","unstructured":"Halevi, S.: Efficient commitment schemes with bounded sender and unbounded receiver. Journal of Cryptology: the journal of the International Association for Cryptologic Research\u00a012(2), 77\u201389 (1999)","journal-title":"Journal of Cryptology: the journal of the International Association for Cryptologic Research"},{"key":"36_CR12","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. In: ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, DMKD 2002 (2002)"},{"key":"36_CR13","first-page":"20","volume-title":"Proc. 20th ACM Symp. on Theory of Computing","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th ACM Symp. on Theory of Computing, Chicago, pp. 20\u201331. ACM, New York (1988)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 20\u201324. Springer, Heidelberg (2000)"},{"key":"36_CR15","unstructured":"Lindell, Y., Pinkas, B.: A proof of yao\u2019s protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004\/175 (2004), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1145\/380752.380855","volume-title":"Proceedings of the thirty-third annual ACM symposium on Theory of computing","author":"M. Naor","year":"2001","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 590\u2013599. ACM Press, New York (2001)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: 1st ACM Conf. on Electronic Commerce, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"36_CR19","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"36_CR20","unstructured":"Rogaway, P.: The round complexity of secure protocols. PhD thesis, MIT (1991)"},{"key":"36_CR21","first-page":"554","volume-title":"Proceedings 40th IEEE Symposium on Foundations of Computer Science","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC\n                  1. In: Proceedings 40th IEEE Symposium on Foundations of Computer Science, New York, pp. 554\u2013566. IEEE, Los Alamitos (1999)"},{"key":"36_CR22","first-page":"160","volume-title":"Proc. 23rd IEEE Symp. on Foundations of Comp. Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. 23rd IEEE Symp. on Foundations of Comp. Science, Chicago, pp. 160\u2013164. IEEE, Los Alamitos (1982)"},{"key":"36_CR23","first-page":"162","volume-title":"Proc. 27th IEEE Symp. on Foundations of Comp. Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. 27th IEEE Symp. on Foundations of Comp. Science, Toronto, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:12Z","timestamp":1605761952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}