{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:52:43Z","timestamp":1778064763403,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T00:00:00Z","timestamp":1568678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T00:00:00Z","timestamp":1568678400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00145-019-09334-y","type":"journal-article","created":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T16:04:56Z","timestamp":1568736296000},"page":"917-953","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The Communication Complexity of Private Simultaneous Messages, Revisited"],"prefix":"10.1007","volume":"33","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Holenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,17]]},"reference":[{"key":"9334_CR1","unstructured":"W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: how to sell digital goods, in EUROCRYPT (2001), pp. 119\u2013135"},{"key":"9334_CR2","doi-asserted-by":"crossref","unstructured":"B. Applebaum, Garbled circuits as randomized encodings of functions: a primer, in Y. Lindell, editor, Tutorials on the Foundations of Cryptography (Springer, Cham, 2017), pp. 1\u201344","DOI":"10.1007\/978-3-319-57048-8_1"},{"key":"9334_CR3","unstructured":"B. Applebaum, B. Arkis, Conditional disclosure of secrets and d-uniform secret sharing with constant information rate, in Electronic Colloquium on Computational Complexity (ECCC), vol. 24 (2017), p. 189"},{"key":"9334_CR4","unstructured":"B. Applebaum, B. Arkis, P. Raykov, P.N. Vasudevan, Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations, in CRYPTO (2017), pp. 727\u2013757"},{"key":"9334_CR5","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography in $$\\text{NC}^{\\text{0 }}$$, in FOCS (2004), pp. 166\u2013175"},{"key":"9334_CR6","unstructured":"B. Applebaum, P. Raykov, From private simultaneous messages to zero-information arthur-merlin protocols and back, in Theory of Cryptography\u201413th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10\u201313, 2016, Proceedings, Part II (2016), pp. 65\u201382"},{"issue":"2","key":"9334_CR7","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/050641958","volume":"37","author":"B Barak","year":"2007","unstructured":"B. Barak, S.J. Ong, S.P. Vadhan, Derandomization in cryptography. SIAM J. Comput., 37(2), 380\u2013400 (2007)","journal-title":"SIAM J. Comput."},{"key":"9334_CR8","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols (extended abstract), in STOC (1990), pp. 503\u2013513"},{"key":"9334_CR9","unstructured":"A. Beimel, Y. Ishai, R. Kumaresan, E. Kushilevitz, On the cryptographic complexity of the worst functions, in TCC (2014), pp. 317\u2013342"},{"key":"9334_CR10","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC (1988), pp. 1\u201310"},{"issue":"2","key":"9334_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"Ernest F Brickell","year":"1991","unstructured":"E.F. Brickell, D.M. Davenport, On the classification of ideal secret sharing schemes. J. Cryptol., 4(2), 123\u2013134 (1991)","journal-title":"J. Cryptol."},{"issue":"3","key":"9334_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"Renato M Capocelli","year":"1993","unstructured":"R.M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro, On the size of shares for secret sharing schemes. J. Cryptol., 6(3), 157\u2013167 (1993)","journal-title":"J. Cryptol."},{"key":"9334_CR13","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in STOC (1988), pp. 11\u201319"},{"issue":"6","key":"9334_CR14","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"Benny Chor","year":"1998","unstructured":"B. Chor, E. Kushilevitz, O. Goldreich, M. Sudan, Private information retrieval. J. ACM, 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"issue":"7","key":"9334_CR15","doi-asserted-by":"publisher","first-page":"3901","DOI":"10.1109\/TIT.2016.2568207","volume":"62","author":"Deepesh Data","year":"2016","unstructured":"D. Data, V.M. Prabhakaran, M.M. Prabhakaran, Communication and randomness lower bounds for secure computation. IEEE Trans. Inf. Theory, 62(7), 3901\u20133929 (2016)","journal-title":"IEEE Trans. Information Theory"},{"key":"9334_CR16","unstructured":"U. Feige, J. Kilian, M. Naor, A minimal model for secure computation (extended abstract), in STOC (1994), pp. 554\u2013563"},{"key":"9334_CR17","doi-asserted-by":"crossref","unstructured":"R. Gay, I. Kerenidis, H. Wee, Communication complexity of conditional disclosure of secrets and attribute-based encryption. in R. Gennaro, M. Robshaw, editors, Advances in Cryptology\u2014CRYPTO 2015\u201435th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2015, Proceedings, Part II. Volume 9216 of Lecture Notes in Computer Science (Springer, 2015), pp. 485\u2013502","DOI":"10.1007\/978-3-662-48000-7_24"},{"issue":"3","key":"9334_CR18","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Yael Gertner","year":"2000","unstructured":"Y. Gertner, Y. Ishai, E. Kushilevitz, T. Malkin, Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci., 60(3), 592\u2013629 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"9334_CR19","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"9334_CR20","doi-asserted-by":"crossref","unstructured":"V. Goyal, O. Pandey, A. Sahai, B. Waters, Attribute-based encryption for fine-grained access control of encrypted data, in A. Juels, R.N. Wright, S. De\u00a0Capitani di\u00a0Vimercati, editors, Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30\u2013November 3, 2006 (ACM, 2006), pp. 89\u201398","DOI":"10.1145\/1180405.1180418"},{"issue":"3\u20134","key":"9334_CR21","first-page":"85","volume":"12","author":"Dan Gutfreund","year":"2003","unstructured":"D. Gutfreund, R. Shaltiel, A. Ta-Shma, Uniform hardness versus randomness tradeoffs for arthur-merlin games. Comput. Complex, 12(3-4), 85\u2013130 (2003)","journal-title":"Comput. Complex."},{"key":"9334_CR22","unstructured":"Y. Ishai, Randomization techniques for secure computation, in M. Prabhakaran, A. Sahai, editors, Secure Multi-Party Computation. Volume\u00a010 of Cryptology and Information Security Series (IOS Press, 2013), pp. 222\u2013248"},{"key":"9334_CR23","unstructured":"Y. Ishai, E. Kushilevitz, Private simultaneous messages protocols with applications, in ISTCS (Israel Symposium on Theory of Computing and Systems) (1997), pp. 174\u2013184"},{"key":"9334_CR24","unstructured":"Y. Ishai, E. Kushilevitz, Randomizing polynomials: a new representation with applications to round-efficient secure computation, in FOCS (2000), pp. 294\u2013304"},{"key":"9334_CR25","unstructured":"Y. Ishai, H. Wee, Partial garbling schemes and their applications, in J. Esparza, P. Fraigniaud, T. Husfeldt, E. Koutsoupias, editors, Automata, Languages, and Programming\u201441st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8\u201311, 2014, Proceedings, Part I. Volume 8572 of Lecture Notes in Computer Science (Springer, 2014), pp. 650\u2013662"},{"key":"9334_CR26","volume-title":"Communication complexity","author":"Eyal Kushilevitz","year":"1997","unstructured":"E. Kushilevitz, N. Nisan, Communication complexity (Cambridge University Press, Cambridge, 1997)"},{"key":"9334_CR27","unstructured":"T. Liu, V. Vaikuntanathan, H. Wee, Conditional disclosure of secrets via non-linear reconstruction, in CRYPTO (2017), pp. 758\u2013790"},{"key":"9334_CR28","unstructured":"P.B. Miltersen, N.V. Vinodchandran, Derandomizing arthur-merlin games using hitting sets, in FOCS (1999), pp. 71\u201380"},{"key":"9334_CR29","unstructured":"A. Sahai, B. Waters, Fuzzy identity-based encryption, in R. Cramer, editor, Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. Volume 3494 of Lecture Notes in Computer Science (Springer, 2005), pp. 457\u2013473"},{"key":"9334_CR30","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"Claude E Shannon","year":"1949","unstructured":"C.E. Shannon, Communication theory of secrecy systems. Bell Syst. Tech. J., 28, 656\u2013715 (1949)","journal-title":"Bell Systems Technical Journal"},{"key":"9334_CR31","unstructured":"H.-M. Sun, S.-P. Shieh, Secret sharing in graph-based prohibited structures, in Proceedings IEEE INFOCOM \u201997, the Conference on Computer Communications, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Kobe, Japan, April 7\u201312, 1997 (IEEE, 1997), pp. 718\u2013724"},{"key":"9334_CR32","doi-asserted-by":"crossref","unstructured":"B. Waters, Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization, in D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi, editors, Public Key Cryptography\u2014PKC 2011\u201414th International Conference on Practice and Theory in Public Key Cryptography, Taormina, Italy, March 6\u20139, 2011. Proceedings. Volume 6571 of Lecture Notes in Computer Science (Springer, 2011), pp. 53\u201370","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"9334_CR33","unstructured":"A.C.-C. Yao, Protocols for secure computations (extended abstract), in FOCS (1982), pp. 160\u2013164"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09334-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T23:05:35Z","timestamp":1600211135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09334-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,17]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9334"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09334-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,17]]},"assertion":[{"value":"21 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}