{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:37Z","timestamp":1740181537120,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s42979-022-01073-5","type":"journal-article","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T15:02:48Z","timestamp":1645801368000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communicationless Evaluation of Quadratic Functions over Secret Shared Dynamic Database"],"prefix":"10.1007","volume":"3","author":[{"given":"Daniel","family":"Berend","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9295-6541","authenticated-orcid":false,"given":"Dor","family":"Bitan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,25]]},"reference":[{"key":"1073_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum B, Brakerski Z, Tsabary R. Perfect secure computation in two rounds. In: Theory of cryptography conference. New York: Springer; 2018. p. 152\u2013174.","DOI":"10.1007\/978-3-030-03807-6_6"},{"key":"1073_CR2","volume-title":"Setup-free secure search on encrypted data: faster and post-processing free","author":"A Akavia","year":"2018","unstructured":"Akavia A, Gentry C, Halevi S, Leibovich M. Setup-free secure search on encrypted data: faster and post-processing free. New York: Technical report. Cryptology ePrint Archive Report; 2018."},{"issue":"4","key":"1073_CR3","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00145-010-9056-z","volume":"23","author":"O Barkol","year":"2010","unstructured":"Barkol O, Ishai Y, Weinreb E. On d-multiplicative secret sharing. J Cryptol. 2010;23(4):580\u201393.","journal-title":"J Cryptol."},{"key":"1073_CR4","doi-asserted-by":"crossref","unstructured":"Beaver D. Efficient multiparty protocols using circuit randomization. In: Annual international cryptology conference. New York: Springer; 1991. p. 420\u2013432.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"1073_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali . 2019. p. 351\u2013371.","DOI":"10.1145\/3335741.3335756"},{"key":"1073_CR6","doi-asserted-by":"crossref","unstructured":"Bitan D, Dolev S. Invited paper: Homomorphic operations techniques yielding communication efficiency. In: Devismes S, Mittal N editors. Stabilization, safety, and security of distributed systems\u201422nd international symposium, SSS 2020, Austin, TX, USA, November 18\u201321, 2020, proceedings. Lecture notes in computer science, vol 12514. New York: Springer; 2020. p. 16\u201328.","DOI":"10.1007\/978-3-030-64348-5_2"},{"key":"1073_CR7","doi-asserted-by":"crossref","unstructured":"Blakley GR. Safeguarding cryptographic keys. In: 1979 international workshop on managing requirements knowledge (MARK). New York: IEEE; 1979. p. 313\u2013318.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1073_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E-J, Nissim K. Evaluating 2-dnf formulas on ciphertexts. In: Theory of cryptography conference. New York: Springer; 2005. p. 325\u2013341.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"1073_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Perlman R. Lattice-based fully dynamic multi-key the with short ciphertexts. In: Annual cryptology conference. New York: Springer; 2016. p. 190\u2013213.","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"1073_CR10","doi-asserted-by":"crossref","unstructured":"Chaum D, Cr\u00e9peau C, Damgard I. Multiparty unconditionally secure protocols. In: Proceedings of the twentieth annual ACM symposium on theory of computing. New York: ACM; 1988. p. 11\u201319.","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"1073_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0167-4048(94)90097-3","volume":"13","author":"E Dawson","year":"1994","unstructured":"Dawson E, Donovan D. The breadth of Shamir\u2019s secret-sharing scheme. Comput Secur. 1994;13(1):69\u201378.","journal-title":"Comput Secur"},{"key":"1073_CR12","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Ishai Y. Constant-round multiparty computation using a black-box pseudorandom generator. In: Annual international cryptology conference. New York: Springer; 2005. p. 378\u2013394.","DOI":"10.1007\/11535218_23"},{"key":"1073_CR13","doi-asserted-by":"crossref","unstructured":"Dolev S, Li Y. Secret shared random access machine. In: Algorithmic aspects of cloud computing. New York: Springer; 2016. p 19\u201334.","DOI":"10.1007\/978-3-319-29919-8_2"},{"key":"1073_CR14","doi-asserted-by":"crossref","unstructured":"Dolev S, Lahiani L, Yung M. Secret swarm unit reactive $k$-secret sharing. In: International conference on cryptology in India. New York: Springer; 2007. p. 123\u2013137.","DOI":"10.1007\/978-3-540-77026-8_10"},{"key":"1073_CR15","doi-asserted-by":"crossref","unstructured":"Dolev S, Gilboa N, Li X. Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. In: Proceedings of the 3rd international workshop on security in cloud computing. New York: ACM; 2015. p. 21\u201329.","DOI":"10.1145\/2732516.2732526"},{"key":"1073_CR16","unstructured":"Gentry C. A fully homomorphic encryption scheme. Stanford: Stanford University; 2009."},{"key":"1073_CR17","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP. Fully homomorphic encryption with polylog overhead. In: Annual international conference on the theory and applications of cryptographic techniques. New York: Springer; 2012. p. 465\u2013482.","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"1073_CR18","unstructured":"Gentry CB, Halevi S, Smart NP. Homomorphic evaluation including key switching, modulus switching, and dynamic noise management. US Patent 9281941. 2016."},{"key":"1073_CR19","doi-asserted-by":"crossref","unstructured":"Gray RM et\u00a0al. Toeplitz and circulant matrices: a review. Found Trends\u00ae Commun Inf Theory 2006; 2(3):155\u2013239.","DOI":"10.1561\/0100000006"},{"key":"1073_CR20","unstructured":"Goldreich O. Foundations of cryptography. Vol. 2. Basic applications. Cambridge: Cambridge University Press; 2009."},{"key":"1073_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A. How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on theory of computing. New York: ACM; 1987. p. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"11","key":"1073_CR22","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML, et al. On data banks and privacy homomorphisms. Found Secur Comput. 1978;4(11):169\u201380.","journal-title":"Found Secur Comput"},{"key":"1073_CR23","doi-asserted-by":"crossref","unstructured":"Sander T, Young A, Yung M. Non-interactive cryptocomputing for nc\/sup 1. In: 40th annual symposium on foundations of computer science (Cat. No. 99CB37039). New York: IEEE; 1999. p. 554\u2013566.","DOI":"10.1109\/SFFCS.1999.814630"},{"issue":"11","key":"1073_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM. 1979;22(11):612\u20133.","journal-title":"Commun ACM"},{"key":"1073_CR25","doi-asserted-by":"crossref","unstructured":"Smart Nigel\u00a0P, Vercauteren Frederik. Fully homomorphic encryption with relatively small key and ciphertext sizes. In International Workshop on Public Key Cryptography, pages 420\u2013443. Springer, 2010.","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"1073_CR26","doi-asserted-by":"crossref","unstructured":"Van\u00a0DM, Gentry C, Halevi S, Vaikuntanathan V. Fully homomorphic encryption over the integers. In: Annual international conference on the theory and applications of cryptographic techniques. New York: Springer; 2010. p. 24\u201343.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"1073_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jnca.2018.01.014","volume":"107","author":"J Xu","year":"2018","unstructured":"Xu J, Wei L, Zhang Y, Wang A, Zhou F, Gao C. Dynamic fully homomorphic encryption-based Merkle tree for lightweight streaming authenticated data structures. J Netw Comput Appl. 2018;107:113\u201324.","journal-title":"J Netw Comput Appl"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01073-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01073-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01073-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T08:30:06Z","timestamp":1726734606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01073-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,25]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1073"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01073-5","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,2,25]]},"assertion":[{"value":"20 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"174"}}