{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:57:29Z","timestamp":1766066249173,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642309540"},{"type":"electronic","value":"9783642309557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30955-7_14","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:17:22Z","timestamp":1340011042000},"page":"160-168","source":"Crossref","is-referenced-by-count":16,"title":["An Efficient Lattice-Based Secret Sharing Construction"],"prefix":"10.1007","author":[{"given":"Rachid","family":"El Bansarkhani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Meziani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"issue":"2","key":"14_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 Transactions on Information Theory\u00a029(2), 208\u2013210 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, pp. 313\u2013317. American Federation of Information Processing Societies (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - 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.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V. Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized Compact Knapsacks Are Collision Resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol.\u00a04052, pp. 144\u2013155. Springer, Heidelberg (2006)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Mahimkar, A.: Securedav: A secure data aggregation and verification protocol for sensor networks. In: Proceedings of the IEEE Global Telecommunications Conference, pp. 2175\u20132179 (2004)","DOI":"10.1109\/GLOCOM.2004.1378395"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-39466-4_27","volume-title":"Cryptography","author":"M. Mignotte","year":"1983","unstructured":"Mignotte, M.: How to Share a Secret? In: Beth, T. (ed.) Cryptography - EUROCRYPT 1982. LNCS, vol.\u00a0149, pp. 371\u2013375. Springer, Heidelberg (1983)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C. Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 145\u2013166. Springer, Heidelberg (2006)"},{"issue":"6","key":"14_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O. Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM\u00a056(6), 34:1\u201334:40 (2009)","journal-title":"J. ACM"},{"key":"14_CR11","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\u00a022, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1098\/rstl.1861.0016","volume":"151","author":"H.J.S. Smith","year":"1861","unstructured":"Smith, H.J.S.: On systems of linear indeterminate equations and congruences. Philosophical Transactions of the Royal Society of London\u00a0151, 293\u2013326 (1861)","journal-title":"Philosophical Transactions of the Royal Society of London"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.entcs.2007.01.065","volume":"186","author":"Sorin","year":"2007","unstructured":"Sorin, Iftene: General secret sharing based on the chinese remainder theorem with applications in e-voting. Electronic Notes in Theoretical Computer Science\u00a0186, 67\u201384 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30955-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T16:00:13Z","timestamp":1743523213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30955-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642309540","9783642309557"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30955-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}