{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:49:09Z","timestamp":1743000549300,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030780852"},{"type":"electronic","value":"9783030780869"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78086-9_35","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:45:53Z","timestamp":1625100353000},"page":"487-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Blindly Follow: SITS CRT and FHE for DCLSMPC of DUFSM (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stav","family":"Doolman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,1]]},"reference":[{"key":"35_CR1","unstructured":"Albrecht, M., et al.: (2018). https:\/\/eprint.iacr.org\/2019\/939.pdf"},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208\u2013210 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-29919-8_4","volume-title":"Algorithmic Aspects of Cloud Computing","author":"H Avni","year":"2016","unstructured":"Avni, H., Dolev, S., Gilboa, N., Li, X.: SSSDB: database with private information search. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds.) ALGOCLOUD 2015. LNCS, vol. 9511, pp. 49\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29919-8_4"},{"key":"35_CR4","first-page":"1024","volume":"2019","author":"D Bitan","year":"2019","unstructured":"Bitan, D., Dolev, S.: Optimal-round preprocessing-MPC via polynomial representation and distributed random matrix (extended abstract). IACR Cryptology ePrint Arch. 2019, 1024 (2019)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-36030-6_14","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 341\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_14"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Derbeko, P., Dolev, S.: Polydnn polynomial representation of NN for communication-less SMPC inference. In: Cyber Security Cryptography and Machine Learning - Fifth International Symposium, CSCML 2021, Be\u2019er Sheva, Israel, 8\u20139 July , 2021, Proceedings, volume 12716 of Lecture Notes in Computer Science. Springer (2021)","DOI":"10.1007\/978-3-030-78086-9_24"},{"key":"35_CR8","unstructured":"Dolev, H., Dolev, S.: Toward provable one way functions (2020)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, S., Doolman, S.: Blindly follow: Sits CRT and FHE for DCLSMPC of DUFSM. Cryptology ePrint Archive, Report 2021\/410 (2021)","DOI":"10.1007\/978-3-030-78086-9_35"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, S., et al.: Secure self-stabilizing computation, Brief announcement (2017)","DOI":"10.1145\/3087801.3087864"},{"key":"35_CR11","unstructured":"Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Secret sharing krohn-rhodes: private and perennial distributed computation. In: ITCS, pp. 32\u201344 (2011)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, S., Garay, J.A., Gilboa, N., Kolesnikov, V., Kumaramangalam, M.V.: Perennial secure multi-party computation of universal turing machine. Theor. Comput. Sci. 769, 43\u201362 (2019)","DOI":"10.1016\/j.tcs.2018.10.012"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1515\/jmc-2013-0039","volume":"9","author":"S Dolev","year":"2015","unstructured":"Dolev, S., Garay, J.A., Gilboa, N., Kolesnikov, V., Yuditsky, Y.: Towards efficient private distributed computation on unbounded input streams. J. Math. Cryptology 9(2), 79\u201394 (2015)","journal-title":"J. Math. Cryptology"},{"key":"35_CR14","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. Theor. Comput. Sci. 795, 81\u201399 (2019)","DOI":"10.1016\/j.tcs.2019.06.005"},{"issue":"7","key":"35_CR15","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/j.adhoc.2012.03.011","volume":"10","author":"S Dolev","year":"2012","unstructured":"Dolev, S., Lahiani, L., Yung, M.: Secret swarm unit: reactive k-secret sharing. Ad Hoc Netw. 10(7), 1291\u20131305 (2012)","journal-title":"Ad Hoc Netw."},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-29919-8_2","volume-title":"Algorithmic Aspects of Cloud Computing","author":"S Dolev","year":"2016","unstructured":"Dolev, S., Li, Y.: Secret shared random access machine. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds.) ALGOCLOUD 2015. LNCS, vol. 9511, pp. 19\u201334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29919-8_2"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/18.850672","volume":"46","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Ron, D., Sudan, M.: Chinese remaindering with errors. IEEE Trans. Inf. Theory 46(4), 1330\u20131338 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"35_CR19","unstructured":"Jaiswal, R.: Chinese remainder codes : using lattices to decode error correcting codes based on Chinese remaindering theorem (2007)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Fast paxos. Distrib. Comput. (2006)","DOI":"10.1007\/s00446-006-0005-x"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system Communication. ACM, July 1978","DOI":"10.1145\/359545.359563"},{"key":"35_CR22","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: FOCS, pp. 169\u2013179 (1978)"},{"issue":"11","key":"35_CR23","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 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Wang, H., Feng, Y., Ding, Y., Tang, S.: A homomorphic arithmetic model via Helib. J. Comput. Theor. Nanosci. 14, 5166\u20135173 (2017)","DOI":"10.1166\/jctn.2017.6690"}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78086-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T06:34:44Z","timestamp":1672641284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78086-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030780852","9783030780869"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78086-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security Cryptography and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~fradmin\/cscml21\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"22","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":"13","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":"46% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 keynote paper is also included.","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)"}}]}}