{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:49:43Z","timestamp":1755838183605,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219354"},{"type":"electronic","value":"9783540246763"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24676-3_3","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T04:33:13Z","timestamp":1280896393000},"page":"40-55","source":"Crossref","is-referenced-by-count":59,"title":["Secure Computation of the k th -Ranked Element"],"prefix":"10.1007","author":[{"given":"Gagan","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Nina","family":"Mishra","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. 22nd Annual ACM Symposium on the Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Ishai, Y., Kumar, R., Reiter, M., Rubinfeld, R., Wright, R.: Selective private function evaluation with applications to private statistics. In: Proc. of 20th ACM Symposium on Principles of Distributed Computing, pp. 293\u2013304 (2001)","DOI":"10.1145\/383962.384047"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two party computation. In: Proc. 34th ACM Symp. on the Theory of Computing, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"3_CR7","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\u2013472. Springer, Heidelberg (2001)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation (extended abstract). In: Proc. 24th ACM Symp. on the Theory of Computing, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"3_CR9","unstructured":"Gibbons, P., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. In: Proc. 23rd Int. Conf. Very Large Data Bases, pp. 466\u2013475 (1997)"},{"key":"3_CR10","unstructured":"Goldreich, O.: Secure multi-party computation. In: Theory of Cryptography Library (1998)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"3_CR12","unstructured":"Jagadish, H., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., Suel, T.: Optimal histograms with quality guarantees. In: Proc. 24th Int. Conf. Very Large Data Bases, pp. 275\u2013286 (1998)"},{"key":"3_CR13","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proc. 33rd Annual ACM Symposium on Theory of Computing, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"issue":"4","key":"3_CR16","first-page":"5","volume":"22","author":"V. Poosala","year":"1999","unstructured":"Poosala, V., Ganti, V., Ioannidis, Y.: Approximate query answering using histograms. IEEE Data Engineering Bulletin\u00a022(4), 5\u201314 (1999)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(82)90045-9","volume":"24","author":"M. Rodeh","year":"1982","unstructured":"Rodeh, M.: Finding the median distributively. Journal of Computer and Systems Sciences\u00a024, 162\u2013166 (1982)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24676-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T19:43:16Z","timestamp":1740339796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24676-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219354","9783540246763"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24676-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}