{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:53:20Z","timestamp":1786982000219,"version":"3.56.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,9,23]],"date-time":"2015-09-23T00:00:00Z","timestamp":1442966400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11432-015-5385-8","type":"journal-article","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T15:07:56Z","timestamp":1443107276000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Memory leakage-resilient secret sharing schemes","\u6297\u5185\u5b58\u6cc4\u6f0f\u7684\u79d8\u94a5\u5171\u4eab\u4f53\u5236"],"prefix":"10.1007","volume":"58","author":[{"given":"ShuGuang","family":"Dai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"JinFeng","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"FangGuo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,23]]},"reference":[{"key":"5385_CR1","doi-asserted-by":"crossref","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: 612\u2013613","journal-title":"Commun ACM"},{"key":"5385_CR2","first-page":"313","volume-title":"Proceedings of Proceedings of AFIPS National Computer Conference","author":"G R Blakley","year":"1979","unstructured":"Blakley G R. Safeguarding cryptographic keys. In: Proceedings of Proceedings of AFIPS National Computer Conference, Arlington, 1979. 313\u2013317"},{"key":"5385_CR3","first-page":"110","volume-title":"Proceedings of Proceedings of 13th Annual International Cryptology Conference","author":"C Blundo","year":"1994","unstructured":"Blundo C, Cresti A, Santis A D, et al. Fully dynamic secret sharing schemes. In: Proceedings of Proceedings of 13th Annual International Cryptology Conference, Santa Barbara, 1994. 110\u2013125"},{"key":"5385_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito M, Saito A, Nishizeki T. Secret sharing scheme realizing any access structure. Electron Commun JPN III, 1989, 72: 56\u201364","journal-title":"Electron Commun JPN III"},{"key":"5385_CR5","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1016\/j.ins.2010.11.032","volume":"181","author":"C F Hsu","year":"2011","unstructured":"Hsu C F, Cheng Q, Tang X M, et al. An ideal multi-secret sharing scheme based on MSP. Inf Sci, 2011, 181: 1403\u20131409","journal-title":"Inf Sci"},{"key":"5385_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J He","year":"1995","unstructured":"He J, Dawson E. Multisecret-sharing scheme based on one-way function. Electron Lett, 1995, 31: 93\u201395","journal-title":"Electron Lett"},{"key":"5385_CR7","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.amc.2004.06.120","volume":"167","author":"L J Pang","year":"2005","unstructured":"Pang L J, Wang Y M. A new (t, n) multi-secret sharing scheme based on Shamir\u2019s secret sharing. Appl Math Comput, 2005, 167: 840\u2013848","journal-title":"Appl Math Comput"},{"key":"5385_CR8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/S0096-3003(03)00355-2","volume":"151","author":"C C Yang","year":"2004","unstructured":"Yang C C, Chang T Y, Hwang M S. A (t, n) multi-secret sharing scheme. Appl Math Comput, 2004, 151: 483\u2013490","journal-title":"Appl Math Comput"},{"key":"5385_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.amc.2004.08.023","volume":"168","author":"J Shao","year":"2005","unstructured":"Shao J, Cao Z F. A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Appl Math Comput, 2005, 168: 135\u2013140","journal-title":"Appl Math Comput"},{"key":"5385_CR10","doi-asserted-by":"crossref","first-page":"2262","DOI":"10.1016\/j.ins.2007.11.031","volume":"178","author":"M H Dehkordi","year":"2008","unstructured":"Dehkordi M H, Mashhadi S. New efficient and practical verifiable multi-secret sharing schemes. Inf Sci, 2008, 178: 2262\u20132274","journal-title":"Inf Sci"},{"key":"5385_CR11","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1016\/j.ins.2010.04.016","volume":"180","author":"L Harn","year":"2010","unstructured":"Harn L, Lin C. Strong (n, t, n) verifiable secret sharing scheme. Inf Sci, 2010, 180: 3059\u20133064","journal-title":"Inf Sci"},{"key":"5385_CR12","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1016\/j.jss.2012.01.027","volume":"85","author":"Y X Liu","year":"2012","unstructured":"Liu Y X, Harn L, Yang C N, et al. Efficient (n, t, n) secret sharing schemes. J Syst Softw, 2012, 85: 1325\u20131332","journal-title":"J Syst Softw"},{"key":"5385_CR13","first-page":"190","volume-title":"Proceedings of International Conference on the Theory and Application of Cryptographic Techniques","author":"M Stadler","year":"1996","unstructured":"Stadler M. Publicly verifiable secret sharing. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, 1996. 190\u2013199"},{"key":"5385_CR14","first-page":"148","volume-title":"Proceedings of 19th Annual International Cryptology Conference","author":"B Schoenmakers","year":"1999","unstructured":"Schoenmakers B. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Proceedings of 19th Annual International Cryptology Conference, Santa Barbara, 1999. 148\u2013164"},{"key":"5385_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ins.2013.03.047","volume":"240","author":"H C Lu","year":"2013","unstructured":"Lu H C, Fu H L. New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures. Inf Sci, 2013, 240: 83\u201394","journal-title":"Inf Sci"},{"key":"5385_CR16","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1007\/s11432-011-4480-8","volume":"55","author":"C M Tang","year":"2012","unstructured":"Tang C M, Gao S H. Leakproof secret sharing protocols with applications to group identification scheme. Sci China Inf Sci, 2012, 55: 1172\u20131185","journal-title":"Sci China Inf Sci"},{"key":"5385_CR17","first-page":"513","volume-title":"Proceedings of 17th Annual International Cryptology Conference","author":"E Biham","year":"1997","unstructured":"Biham E, Shamir A. Differential fault analysis of secret key cryptosystems. In: Proceedings of 17th Annual International Cryptology Conference, Santa Barbara, 1997. 513\u2013525"},{"key":"5385_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1506409.1506429","volume":"52","author":"J A Halderman","year":"2009","unstructured":"Halderman J A, Schoen S D, Heninger N, et al. Lest we remember: cold boot attacks on encryption keys. Commun ACM, 2009, 52: 45\u201360","journal-title":"Commun ACM"},{"key":"5385_CR19","first-page":"104","volume-title":"Proceedings of 16th Annual International Cryptology Conference","author":"P C Kocher","year":"1996","unstructured":"Kocher P C. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Proceedings of 16th Annual International Cryptology Conference, Santa Barbara, 1996. 104\u2013113"},{"key":"5385_CR20","first-page":"388","volume-title":"Proceedings of 19th Annual International Cryptology Conference","author":"P C Kocher","year":"1999","unstructured":"Kocher P C, Jaffe J, Jun B. Differential power analysis. In: Proceedings of 19th Annual International Cryptology Conference, Santa Barbara, 1999. 388\u2013397"},{"key":"5385_CR21","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-45418-7_17","volume-title":"Proceedings of Smart Card Programming and Security: International Conference on Research in Smart Cards","author":"J J Quisquater","year":"2001","unstructured":"Quisquater J J, Samyde D. Electromagnetic analysis (EMA): measures and counter-measures for smart cards. In: Proceedings of Smart Card Programming and Security: International Conference on Research in Smart Cards. Berlin\/Heidelberg: Springer, 2001. 200\u2013210"},{"key":"5385_CR22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Proceedings of 1st Theory of Cryptography Conference","author":"S Micali","year":"2004","unstructured":"Micali S, Reyzin I. Physically observable cryptography. In: Proceedings of 1st Theory of Cryptography Conference, Cambridge, 2004. 278\u2013296"},{"key":"5385_CR23","first-page":"18","volume-title":"Proceedings of 29th Annual International Cryptology Conference","author":"M Naor","year":"2009","unstructured":"Naor M, Segev G. Public-key cryptosystems resilient to key leakage. In: Proceedings of 29th Annual International Cryptology Conference, Santa Barbara, 2009. 18\u201335"},{"key":"5385_CR24","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-19571-6_6","volume-title":"Proceedings of 8th IACR Theory of Cryptography Conference","author":"A B Lewko","year":"2011","unstructured":"Lewko A B, Rouselakis Y, Waters B. Achieving leakage resilient through dual system encryption. In: Proceedings of 8th IACR Theory of Cryptography Conference, Providence, 2011. 70\u201388"},{"key":"5385_CR25","first-page":"117","volume-title":"Proceedings of 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"T H Yuen","year":"2012","unstructured":"Yuen T H, Chow S S M, Zhang Y, et al. Identity-based encryption resilient to continual auxiliary leakage. In: Proceedings of 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, 2012. 117\u2013134"},{"key":"5385_CR26","first-page":"703","volume-title":"Proceedings of 15th International Conference on the Theory and Application of Cryptology and Information Security","author":"J Katz","year":"2009","unstructured":"Katz J, Vaikuntanathan V. Signature schemes with bounded leakage resilient. In: Proceedings of 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, 2009. 703\u2013720"},{"key":"5385_CR27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-642-19571-6_7","volume-title":"Proceedings of 8th IACR Theory of Cryptography Conference","author":"T Malkin","year":"2011","unstructured":"Malkin T, Teranishi I, Vahlis Y, et al. Signatures resilient to continual leakage on memory and computation. In: Proceedings of 8th IACR Theory of Cryptography Conference, Providence, 2011. 89\u2013106"},{"key":"5385_CR28","first-page":"297","volume-title":"Proceedings of 31st Annual Cryptology Conference","author":"S Garg","year":"2011","unstructured":"Garg S, Jain A, Sahai A. Leakage-resilient zero knowledge. In: Proceedings of 31st Annual Cryptology Conference, Santa Barbara, 2011. 297\u2013315"},{"key":"5385_CR29","first-page":"1235","volume-title":"Proceedings of the 44th Annual ACM Symposium on Theory of Computing","author":"E Boyle","year":"2012","unstructured":"Boyle E, Goldwasser S, Jain A, et al. Multiparty computation secure against continual memory leakage. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing. New York: ACM, 2012. 1235\u20131254"},{"key":"5385_CR30","first-page":"316","volume-title":"Proceedings of 33rd Annual Cryptology Conference","author":"E Boyle","year":"2013","unstructured":"Boyle E, Goldwasser S, Jain A, et al. Secure computation against adaptive auxiliary information. In: Proceedings of 33rd Annual Cryptology Conference, Santa Barbara, 2013. 316\u2013334"},{"key":"5385_CR31","first-page":"164","volume-title":"Proceedings of 34th Annual Cryptology Conference","author":"P Ananth","year":"2014","unstructured":"Ananth P, Goyal V, Omkant P. Interactive proofs under continual memory leakage. In: Proceedings of 34th Annual Cryptology Conference, Santa Barbara, 2014. 164\u2013182"},{"key":"5385_CR32","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Proceedings of 6th Theory of Cryptography Conference","author":"A Akavia","year":"2009","unstructured":"Akavia A, Goldwasser S, Vaikuntanathan V. Simultaneous hardcore bits and cryptography against memory attacks. In: Proceedings of 6th Theory of Cryptography Conference, San Francisco, 2009. 474\u2013495"},{"key":"5385_CR33","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R S Pappu","year":"2002","unstructured":"Pappu R S, Recht B, Taylor J, et al. Physical one-way functions, Science, 2002, 297: 2026\u20132030","journal-title":"Science"},{"key":"5385_CR34","first-page":"51","volume":"2011","author":"C Brzuska","year":"2011","unstructured":"Brzuska C, Fischlin M, Schr\u00f6der H, et al. Physically uncloneable functions in the universal composition framework. In: Proceedings of 31st Annual Cryptology Conference, Santa Barbara, 2011, 2011. 51\u201370","journal-title":"Proceedings of 31st Annual Cryptology Conference"},{"key":"5385_CR35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis Y, Ostrovsky R, Reuzin L, et al. Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J Comput, 2008, 38: 97\u2013139","journal-title":"SIAM J Comput"},{"key":"5385_CR36","first-page":"685","volume-title":"Proceedings of 15th International Conference on the Theory and Application of Cryptology and Information Security","author":"F Armknecht","year":"2009","unstructured":"Armknecht F, Maes R, Sadeghi A R, et al. Memory leakage-resilient encryption based on physically unclonable functions. In: Proceedings of 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, 2009. 685\u2013702"},{"key":"5385_CR37","first-page":"136","volume-title":"Proceedings of 13th Annual International Cryptology Conference","author":"H Krawczyk","year":"1993","unstructured":"Krawczyk H. Secret sharing made short. In: Proceedings of 13th Annual International Cryptology Conference, Santa Barbara, 1993. 136\u2013146"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5385-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5385-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:38:02Z","timestamp":1559389082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5385-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,23]]},"references-count":37,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["5385"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5385-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,23]]}}}