{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:22Z","timestamp":1759637542301,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,4,14]],"date-time":"2015-04-14T00:00:00Z","timestamp":1428969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Natural Science Foundation of China","award":["61472146"],"award-info":[{"award-number":["61472146"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,4,14]]},"DOI":"10.1145\/2732516.2732526","type":"proceedings-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T16:27:14Z","timestamp":1428078434000},"page":"21-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation"],"prefix":"10.1145","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[{"name":"Ben Gurion University of Negev, Beer-Sheva, Israel"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben Gurion University of Negev, Beer-Sheva, Israel"}]},{"given":"Ximing","family":"Li","sequence":"additional","affiliation":[{"name":"South China Agricultural University, Guangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2015,4,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A full proof of the bgw protocol for perfectly-secure multiparty computation. IACR Cryptology ePrint Archive","author":"Asharov G.","year":"2011","unstructured":"G. Asharov and Y. Lindell . A full proof of the bgw protocol for perfectly-secure multiparty computation. IACR Cryptology ePrint Archive , 2011 :136, 2011. G. Asharov and Y. Lindell. A full proof of the bgw protocol for perfectly-secure multiparty computation. IACR Cryptology ePrint Archive, 2011:136, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"J. C.\n      Benaloh\n    .\n  Secret sharing homomorphisms: Keeping shares of a secret sharing\n  . In A. M. Odlyzko editor CRYPTO volume \n  263\n   of \n  Lecture Notes in Computer Science pages \n  251\n  --\n  260\n  . \n  Springer 1986\n  .   J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret sharing. In A. M. Odlyzko editor CRYPTO volume 263 of Lecture Notes in Computer Science pages 251--260. Springer 1986.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455526.1455529"},{"key":"e_1_3_2_1_5_1","volume-title":"International Workshop on, 0: 313","author":"Blakley G. R.","year":"1979","unstructured":"G. R. Blakley . Safeguarding cryptographic keys. Managing Requirements Knowledge , International Workshop on, 0: 313 , 1979 . G. R. Blakley. Safeguarding cryptographic keys. Managing Requirements Knowledge, International Workshop on, 0:313, 1979."},{"key":"e_1_3_2_1_6_1","volume-title":"Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC), 18:111","author":"Brakerski Z.","year":"2011","unstructured":"Z. Brakerski , C. Gentry , and V. Vaikuntanathan . Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC), 18:111 , 2011 . Z. Brakerski, C. Gentry, and V. Vaikuntanathan. Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC), 18:111, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient conversion of secret-shared values between different fields. IACR Cryptology ePrint Archive","author":"Damg\u00e5rd I.","year":"2008","unstructured":"I. Damg\u00e5rd and R. Thorbek . Efficient conversion of secret-shared values between different fields. IACR Cryptology ePrint Archive , 2008 :221, 2008. I. Damg\u00e5rd and R. Thorbek. Efficient conversion of secret-shared values between different fields. IACR Cryptology ePrint Archive, 2008:221, 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793974.1794220"},{"key":"e_1_3_2_1_10_1","first-page":"32","volume-title":"Secret sharing krohn-rhodes: Private and perennial distributed computation","author":"Dolev S.","year":"2011","unstructured":"S. Dolev , J. A. Garay , N. Gilboa , and V. Kolesnikov . Secret sharing krohn-rhodes: Private and perennial distributed computation . In B. Chazelle, editor, ICS, pages 32 -- 44 . Tsinghua University Press , 2011 . S. Dolev, J. A. Garay, N. Gilboa, and V. Kolesnikov. Secret sharing krohn-rhodes: Private and perennial distributed computation. In B. Chazelle, editor, ICS, pages 32--44. Tsinghua University Press, 2011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_43"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"S.\n      Dolev L.\n      Lahiani and \n      M.\n      Yung\n  . \n  Secret swarm unit reactive k-secret sharing\n  . In K. Srinathan C. P. Rangan and M. Yung editors INDOCRYPT volume \n  4859\n   of \n  Lecture Notes in Computer Science pages \n  123\n  --\n  137\n  . \n  Springer 2007\n  .   S. Dolev L. Lahiani and M. Yung. Secret swarm unit reactive k-secret sharing. In K. Srinathan C. P. Rangan and M. Yung editors INDOCRYPT volume 4859 of Lecture Notes in Computer Science pages 123--137. Springer 2007.","DOI":"10.1007\/978-3-540-77026-8_10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2012.03.011"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/508171.508174"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"C.\n      Gentry\n    .\n  Toward basing fully homomorphic encryption on worst-case hardness\n  . In T. Rabin editor CRYPTO volume \n  6223\n   of \n  Lecture Notes in Computer Science pages \n  116\n  --\n  137\n  . \n  Springer 2010\n  .   C. Gentry. Toward basing fully homomorphic encryption on worst-case hardness. In T. Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 116--137. Springer 2010.","DOI":"10.1007\/978-3-642-14623-7_7"},{"key":"e_1_3_2_1_18_1","volume-title":"Implementing gentry's fully-homomorphic encryption scheme. IACR Cryptology ePrint Archive","author":"Gentry C.","year":"2010","unstructured":"C. Gentry and S. Halevi . Implementing gentry's fully-homomorphic encryption scheme. IACR Cryptology ePrint Archive , 2010 :520, 2010. C. Gentry and S. Halevi. Implementing gentry's fully-homomorphic encryption scheme. IACR Cryptology ePrint Archive, 2010:520, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.94"},{"key":"e_1_3_2_1_20_1","first-page":"850","volume-title":"Safavi-Naini and Canetti {27}","author":"Gentry C.","unstructured":"C. Gentry , S. Halevi , and N. P. Smart . Homomorphic evaluation of the aes circuit . In Safavi-Naini and Canetti {27} , pages 850 -- 867 . C. Gentry, S. Halevi, and N. P. Smart. Homomorphic evaluation of the aes circuit. In Safavi-Naini and Canetti {27}, pages 850--867."},{"key":"e_1_3_2_1_21_1","volume-title":"Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . The Foundations of Cryptography - Volume 2 , Basic Applications . Cambridge University Press , 2004 . O. Goldreich. The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259405"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.43"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_25"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-0565-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516698"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_1_31_1","first-page":"218","volume-title":"Safavi-Naini and Canetti {27}","author":"Waters B.","unstructured":"B. Waters . Functional encryption for regular languages . In Safavi-Naini and Canetti {27} , pages 218 -- 235 . B. Waters. Functional encryption for regular languages. In Safavi-Naini and Canetti {27}, pages 218--235."},{"key":"e_1_3_2_1_32_1","volume-title":"Dec. 30","author":"Welch L. R.","year":"1986","unstructured":"L. R. Welch and E. R. Berlekamp . Error correction for algebraic block codes , Dec. 30 1986 . US Patent 4,633,470. L. R. Welch and E. R. Berlekamp. Error correction for algebraic block codes, Dec. 30 1986. US Patent 4,633,470."}],"event":{"name":"ASIA CCS '15: 10th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Singapore Republic of Singapore","acronym":"ASIA CCS '15"},"container-title":["Proceedings of the 3rd International Workshop on Security in Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732516.2732526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2732516.2732526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:10Z","timestamp":1750273450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732516.2732526"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2015,4,14]]},"references-count":31,"alternative-id":["10.1145\/2732516.2732526","10.1145\/2732516"],"URL":"https:\/\/doi.org\/10.1145\/2732516.2732526","relation":{},"subject":[],"published":{"date-parts":[[2015,4,14]]},"assertion":[{"value":"2015-04-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}