{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:53:23Z","timestamp":1743915203662,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031565823"},{"type":"electronic","value":"9783031565830"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56583-0_4","type":"book-chapter","created":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T05:02:23Z","timestamp":1712034143000},"page":"54-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lattice-Based Secret Sharing Scheme (Chinese Remainder Theorem)"],"prefix":"10.1007","author":[{"given":"Songshou","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqing","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuguang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,3]]},"reference":[{"issue":"11","key":"4_CR1","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"},{"issue":"5","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1109\/TIT.1998.705566","volume":"44","author":"A Beimel","year":"1998","unstructured":"Beimel, A., Chor, B.: Secret sharing with public reconstruction. IEEE Trans. Inf. Theory 44(5), 1887\u20131896 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, p. 313. IEEE Computer Society (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Asmuth, C.A., Blakley, G.R.: Pooling, splitting, and restituting information to overcome total failure of some channels of communication. In: 1982 IEEE Symposium on Security and Privacy, p. 156. IEEE (1982)","DOI":"10.1109\/SP.1982.10019"},{"issue":"2","key":"4_CR5","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":"4_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00129769","volume":"9","author":"WA Jackson","year":"1996","unstructured":"Jackson, W.A., Martin, K.M.: Perfect secret sharing schemes on five participants. Des. Codes Crypt. 9, 267\u2013286 (1996)","journal-title":"Des. Codes Crypt."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., et al.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 383\u2013395. IEEE (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"4_CR8","unstructured":"Shieh, S.P., Sun, H.M.: On constructing secret sharing schemes. In: Infocom 94 Networking for Global Communications. IEEE (1994)"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(94)90127-9","volume":"52","author":"HM Sun","year":"1994","unstructured":"Sun, H.M., Shieh, S.P.: On dynamic threshold schemes. Inf. Process. Lett. 52(4), 201\u2013206 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1049\/ip-cdt:19990708","volume":"146","author":"TY Lin","year":"1999","unstructured":"Lin, T.Y., Wu, T.C.: (t, n) threshold verifiable multisecret sharing scheme based on the factorisation intractability and discrete logarithm modulo a composite problem. IEE Proc.-Comput. Digit. Tech. 146(5), 264\u2013268 (1999)","journal-title":"IEE Proc.-Comput. Digit. Tech."},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1049\/ip-cdt:19952015","volume":"142","author":"TC Wu","year":"1995","unstructured":"Wu, T.C., Wu, T.S.: Cheating detection and cheater identification in secret sharing schemes. IEE Proc.-Comput. Digit. Tech. 142(5), 367\u2013369 (1995)","journal-title":"IEE Proc.-Comput. Digit. Tech."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 427\u2013438. IEEE (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"4_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"CRYPTO 1991","author":"TP Pedersen","year":"2001","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"4_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Cramer R: Introduction to secure computation. In: Damg\u00e5rd, I.B. (ed.) Lectures on Data Security. EEF School 1998. LNCS, vol. 1561, pp. 16\u201362. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48969-X_2","DOI":"10.1007\/3-540-48969-X_2"},{"key":"4_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-49264-X_14","volume-title":"EUROCRYPT 1995","author":"R Gennaro","year":"1995","unstructured":"Gennaro, R., Micali, S.: Verifiable secret sharing as secure computation. In: Guillou, L.C., Quisquater, J.J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 168\u2013182. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_14"},{"key":"4_CR17","unstructured":"Gennaro, R.: Theory and practice of verifiable secret sharing. Massachusetts Institute of Technology (1996)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM, New York (1989)","DOI":"10.1145\/73007.73014"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307\u2013328. ACM, New York (2019)","DOI":"10.1145\/3335741.3335759"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354\u2013371. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_31"},{"key":"4_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-48910-x_21","volume-title":"EUROCRYPT 1999","author":"R Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., et al.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295\u2013310. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_21"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111. ACM, Puerto Vallarta (1998)","DOI":"10.1145\/277697.277716"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190\u2013199. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_17"},{"key":"4_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"EUROCRYPT 1998","author":"E Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32\u201346. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054115"},{"key":"4_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"CRYPTO 1999","author":"B Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148\u2013164. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10"},{"key":"4_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"CRYPTO 1986","author":"JC Benaloh","year":"2000","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"key":"4_CR27","unstructured":"Georgescu A: A LWE-based secret sharing scheme. Netw. Secur. Cryptogr. (2011)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-30955-7_14","volume-title":"WISTP 2012","author":"R El Bansarkhani","year":"2012","unstructured":"El Bansarkhani, R., Meziani, M.: An efficient lattice-based secret sharing construction. In: Askoxylakis, I., P\u00f6hls, H.C., Posegga, J. (eds.) WISTP 2012. Lecture Notes in Computer Science, vol. 7322, pp. 160\u2013168. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30955-7_14"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Khorasgani, H.A., Asaad, S., Eghlidos, T., et al.: A lattice-based threshold secret sharing scheme. In: 2014 11th International ISC Conference on Information Security and Cryptology, pp. 173\u2013179. IEEE, Tehran (2014)","DOI":"10.1109\/ISCISC.2014.6994043"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Asaad, S., Khorasgani, H.A., Eghlidos, T., et al.: Sharing secret using lattice construction. In: 7th International Symposium on Telecommunications (IST 2014), pp. 901\u2013906. IEEE, Tehran (2014)","DOI":"10.1109\/ISTEL.2014.7000831"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"4_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-11799-2_13","volume-title":"TCC 2010","author":"R Bendlin","year":"2010","unstructured":"Bendlin, R., Damg\u00e5rd, I.: Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 201\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_13"},{"key":"4_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"ACNS 2013","author":"R Bendlin","year":"2013","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H) IBE. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 218\u2013236. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14"},{"issue":"1","key":"4_CR34","first-page":"2","volume":"14","author":"H Pilaram","year":"2015","unstructured":"Pilaram, H., Eghlidos, T.: An efficient lattice based multi-stage secret sharing scheme. IEEE Trans. Dependable Secure Comput. 14(1), 2\u20138 (2015)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Yang, Z., He, D., Qu, L., et al.: On the security of a lattice-based multi-stage secret sharing scheme. IEEE Trans. Dependable Secure Comput. (2022)","DOI":"10.1109\/TDSC.2022.3209011"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Kiamari, N., Hadian, M., Mashhadi, S.: Non-interactive verifiable LWE-based multi secret sharing scheme. Multimed. Tools Appl. 1\u201313 (2022)","DOI":"10.1007\/s11042-022-13347-4"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_1"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_10"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"33986","DOI":"10.1109\/ACCESS.2018.2847411","volume":"6","author":"X Lu","year":"2018","unstructured":"Lu, X., Yin, W., Wen, Q., et al.: A lattice-based unordered aggregate signature scheme based on the intersection method. IEEE Access 6, 33986\u201333994 (2018)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Digital Forensics and Cyber Crime"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56583-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T10:03:39Z","timestamp":1724925819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56583-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031565823","9783031565830"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56583-0_4","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDF2C","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Digital Forensics and Cyber Crime","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdf2c2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"105","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":"41","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":"0","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":"39% - 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":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}