{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:52:17Z","timestamp":1746600737861},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"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-09330-2","type":"journal-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T23:26:12Z","timestamp":1569540372000},"page":"824-873","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing"],"prefix":"10.1007","volume":"33","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohad","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"9330_CR1","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in Simon [22], pp. 1\u201310"},{"key":"9330_CR2","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, Computing small discrete logarithms faster, in S.D. Galbraith, M. Nandi, editors, Progress in Cryptology\u2014INDOCRYPT 2012, 13th International Conference on Cryptology in India, Kolkata, India, December 9\u201312, 2012. Proceedings. Volume 7668 of Lecture Notes in Computer Science (Springer, 2012), pp. 317\u2013338","DOI":"10.1007\/978-3-642-34931-7_19"},{"key":"9330_CR3","doi-asserted-by":"crossref","unstructured":"D. Boneh, E. Goh, K. Nissim, Evaluating 2-DNF formulas on ciphertexts, in J. Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10\u201312, 2005, Proceedings. Volume 3378 of Lecture Notes in Computer Science (Springer, 2005), pp. 325\u2013341","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"9330_CR4","doi-asserted-by":"crossref","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, M. Orr\u00f9, Homomorphic secret sharing: optimizations and applications, in B.M. Thuraisingham, D. Evans, T. Malkin, D. Xu, editors, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017 (ACM, 2017), pp. 2105\u20132122","DOI":"10.1145\/3133956.3134107"},{"key":"9330_CR5","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai ,Breaking the circuit size barrier for secure computation under DDH, in M. Robshaw, J. Katz, editors, Advances in Cryptology\u2014CRYPTO 2016\u201436th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part I. Volume 9814 of Lecture Notes in Computer Science (Springer, 2016), pp. 509\u2013539","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"9330_CR6","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, Group-based secure computation: optimizing rounds, communication, and computation, in J. Coron, J.B. Nielsen, editors, Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30\u2013May 4, 2017, Proceedings, Part II. Volume 10211 of Lecture Notes in Computer Science (2017), pp. 163\u2013193"},{"key":"9330_CR7","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, H. Lin, S. Tessaro, Foundations of homomorphic secret sharing, in A.R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11\u201314, 2018, Cambridge, MA, USA. Volume\u00a094 of LIPIcs (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018), pp. 21:1\u201321:21"},{"key":"9330_CR8","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in Simon [22], pp. 11\u201319"},{"issue":"6","key":"9330_CR9","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"B. Chor, E. Kushilevitz, O. Goldreich, M. Sudan, Private information retrieval. J. ACM\u00a045(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"9330_CR10","doi-asserted-by":"crossref","unstructured":"I. Dinur, N. Keller, O. Klein, An optimal distributed discrete log protocol with applications to homomorphic secret sharing, in H. Shacham, A. Boldyreva, editors, Advances in Cryptology\u2014CRYPTO 2018\u201438th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part III. Volume 10993 of Lecture Notes in Computer Science (Springer, 2018), pp. 213\u2013242","DOI":"10.1007\/978-3-319-96878-0_8"},{"key":"9330_CR11","doi-asserted-by":"crossref","unstructured":"N. Fazio, R. Gennaro, T. Jafarikhah, W.E. Skeith III, Homomorphic secret sharing from paillier encryption, in T. Okamoto, Y. Yu, M.H. Au, Y. Li, editors, Provable Security\u201411th International Conference, ProvSec 2017, Xi\u2019an, China, October 23\u201325, 2017, Proceedings. Volume 10592 of Lecture Notes in Computer Science (Springer, 2017), pp. 381\u2013399","DOI":"10.1007\/978-3-319-68637-0_23"},{"issue":"282","key":"9330_CR12","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1090\/S0025-5718-2012-02641-X","volume":"82","author":"SD Galbraith","year":"2013","unstructured":"S.D. Galbraith, J.M. Pollard, R.S. Ruprai, Computing discrete logarithms in an interval. Math. Comput.\u00a0 82(282), 1181\u20131195 (2013)","journal-title":"Math. Comput."},{"key":"9330_CR13","doi-asserted-by":"crossref","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, in M. Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31\u2013June 2, 2009 (ACM, 2009), pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"issue":"1","key":"9330_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"DM Gordon","year":"1993","unstructured":"D.M. Gordon, Discrete logarithms in GF(P) using the number field sieve. SIAM J. Discrete Math.\u00a06(1), 124\u2013138 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"9330_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"R.A. Horn, C.R. Johnson, Matrix Analysis (Paperback ed.) (Cambridge University Press, Cambridge, 1985)","edition":"Paperback"},{"key":"9330_CR16","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, H.W, Lenstra, The Development of the Number Field Sieve. Number 1554 in Lecture Notes in Mathematics (Springer, Berlin, 1993)","DOI":"10.1007\/BFb0091534"},{"key":"9330_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"R. O\u2019Donnell, Analysis of Boolean Functions (Cambridge University Press, Cambridge, 2014)"},{"issue":"143","key":"9330_CR18","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"J.M. Pollard, Monte Carlo methods for index computation ($$\\text{ mod }p$$). Math. Comput.\u00a032(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"issue":"4","key":"9330_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"JM Pollard","year":"2000","unstructured":"J.M. Pollard, Kangaroos, monopoly and discrete logarithms. J. Cryptol.\u00a013(4), 437\u2013447 (2000)","journal-title":"J. Cryptol."},{"key":"9330_CR20","unstructured":"R.L. Rivest, L. Adleman, M.L. Dertouzos, On data banks and privacy homomorphisms, in Foundations of Secure Computation (1978), pp. 169\u2013179"},{"key":"9330_CR21","doi-asserted-by":"crossref","unstructured":"V. Shoup, Lower bounds for discrete logarithms and related problems, in W. Fumy, editor, Advances in Cryptology\u2014EUROCRYPT \u201997, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11\u201315, 1997, Proceeding. Volume 1233 of Lecture Notes in Computer Science (Springer, 1997), pp. 256\u2013266","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9330_CR22","unstructured":"J. Simon, editor, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA (ACM, 1988)"},{"key":"9330_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability with Martingales","author":"D Williams","year":"1991","unstructured":"D. Williams, Probability with Martingales (Cambridge University Press, Cambridge, 1991)"},{"key":"9330_CR24","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for secure computations (extended abstract), in 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982 (IEEE Computer Society, 1982), pp. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09330-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09330-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09330-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T01:22:07Z","timestamp":1664500927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09330-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9330"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09330-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,26]]},"assertion":[{"value":"5 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}