{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:19Z","timestamp":1742911519199,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030354220"},{"type":"electronic","value":"9783030354237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_11","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"216-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation"],"prefix":"10.1007","author":[{"given":"Sibi Raj B.","family":"Pillai","sequence":"first","affiliation":[]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-5303","authenticated-orcid":false,"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1880-570X","authenticated-orcid":false,"given":"Srivatsan","family":"Sridhar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-78375-8_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Applebaum","year":"2018","unstructured":"Applebaum, B., Holenstein, T., Mishra, M., Shayevitz, O.: The communication complexity of private simultaneous messages, revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 261\u2013286. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_9"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math. 4(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Inf. Process. Lett. 45(4), 205\u2013210 (1993)","journal-title":"Inf. Process. Lett."},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/cryptography-cryptology-and-coding\/secure-multiparty-computation-and-secret-sharing?format=HB&isbn=9781107043053"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-662-53008-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"I Damg\u00e5rd","year":"2016","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Polychroniadou, A., Raskin, M.: On the communication required for unconditionally secure multiplication. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 459\u2013488. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_16"},{"key":"11_CR6","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Polychroniadou, A., Raskin, M.A.: On the communication required for unconditionally secure multiplication. In: Advances in Cryptology - CRYPTO 2019\u201339th Annual International Cryptology Conference, Santa Barbara, CA, USA, Proceedings (2019)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Data, D., Prabhakaran, M., Prabhakaran, V.M.: On the communication complexity of secure computation. In: Advances in Cryptology - CRYPTO 2014\u201334th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Proceedings, Part II, pp. 199\u2013216 (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_12. Full version in IEEE Trans. Information Theory, 62(7) 2016","DOI":"10.1007\/978-3-662-44381-1_12"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Feige, U., Killian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 554\u2013563. ACM, New York (1994). https:\/\/doi.org\/10.1145\/195058.195408","DOI":"10.1145\/195058.195408"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: STOC, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp. 174\u2013183, June 1997. https:\/\/doi.org\/10.1109\/ISTCS.1997.595170","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: 30th Annual Symposium on Foundations of Computer Science, pp. 416\u2013421, October 1989. https:\/\/doi.org\/10.1109\/SFCS.1989.63512","DOI":"10.1109\/SFCS.1989.63512"},{"key":"11_CR13","unstructured":"Prabhakaran, M., Sahai, A. (eds.): Secure Multi-Party Computation, Cryptologyand Information Security Series, vol. 10. IOS Press, Amsterdam (2013)"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Sundara Rajan S, Rajakrishnan, S., Thangaraj, A., Prabhakaran, V.: Lower bounds and optimal protocols for three-party secure computation. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1361\u20131365, July 2016. https:\/\/doi.org\/10.1109\/ISIT.2016.7541521","DOI":"10.1109\/ISIT.2016.7541521"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:45:40Z","timestamp":1709833540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}