乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T15:10:02Z","timestamp":1726672202417},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015646","name":"Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1016\/j.ins.2022.02.016","type":"journal-article","created":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T16:04:49Z","timestamp":1644854689000},"page":"54-69","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["A perfect secret sharing scheme for general access structures"],"prefix":"10.1016","volume":"595","author":[{"given":"Xingxing","family":"Jia","sequence":"first","affiliation":[]},{"given":"Yusheng","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Xiangyang","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Daoshun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chaoyang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2022.02.016_b0005","series-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security","first-page":"89","article-title":"Attribute-based encryption for fine-grained access control of encrypted data","author":"Goyal","year":"2006"},{"key":"10.1016\/j.ins.2022.02.016_b0010","doi-asserted-by":"crossref","unstructured":"Y. Ning, F. Miao, W. Huang, K. Meng, Y. Xiong, X. Wang, Constructing ideal secret sharing schemes based on Chinese Remainder Theorem, in: Advances in Cryptology-ASIACRYPTO 2018, Lecture Notes in Computer Science, Springer, 2018, pp. 310\u2013331.","DOI":"10.1007\/978-3-030-03332-3_12"},{"issue":"11","key":"10.1016\/j.ins.2022.02.016_b0015","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2022.02.016_b0020","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in: Proceedings of the 1979 AFIPS National Computer Conference, AFIPS Conference Proceedings, AFIPS Press, 1979, pp. 313\u2013318.","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"5","key":"10.1016\/j.ins.2022.02.016_b0025","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/TIFS.2014.2384393","article-title":"Randomized component and its application to (t,m,n)-group oriented secret sharing","volume":"10","author":"Miao","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.ins.2022.02.016_b0030","first-page":"116","article-title":"A reversible extended secret image sharing scheme based on chinese remainder theorem","volume":"95","author":"Meng","year":"2021","journal-title":"Signal Process.: Image Commun."},{"issue":"4","key":"10.1016\/j.ins.2022.02.016_b0035","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/TIFS.2016.2598533","article-title":"Information-theoretic secure multi-party computation with collusion deterrence","volume":"12","author":"Wang","year":"2017","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.ins.2022.02.016_b0040","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TIFS.2019.2929409","article-title":"Verifynet: Secure and verifiable federated learning","volume":"15","author":"Xu","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"10.1016\/j.ins.2022.02.016_b0045","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1109\/TCYB.2019.2963138","article-title":"GAN-based key secret-sharing scheme in blockchain","volume":"51","author":"Zheng","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.ins.2022.02.016_b0050","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1109\/JSYST.2019.2912415","article-title":"A dynamic membership data aggregation (DMDA) protocol for smart grid","volume":"14","author":"Song","year":"2020","journal-title":"IEEE Syst. J."},{"issue":"4","key":"10.1016\/j.ins.2022.02.016_b0055","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1007\/s11280-018-0575-0","article-title":"E-voting scheme using secret sharing and K-anonymity","volume":"22","author":"Liu","year":"2019","journal-title":"World Wide Web"},{"key":"10.1016\/j.ins.2022.02.016_b0060","unstructured":"M. Mignotte, How to share a secret, in: T. Beth (Ed.), Proceedings of the Workshop on Cryptography Burg Feuerstein, Germany, March 29\u2013April 2, 1982, Springer, Berlin Heidelberg, 1983, pp. 371\u2013375."},{"issue":"2","key":"10.1016\/j.ins.2022.02.016_b0065","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","article-title":"A modular approach to key safeguarding","volume":"29","author":"Asmuth","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ins.2022.02.016_b0070","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","article-title":"Hierarchical threshold secret sharing","volume":"20","author":"Tassa","year":"2007","journal-title":"J. Cryptol."},{"key":"10.1016\/j.ins.2022.02.016_b0075","doi-asserted-by":"crossref","unstructured":"Q. Chen, C. Tang, Z. Lin, Efficient explicit constructions of compartmented secret sharing schemes, in: Advances in Cryptology-ASIACRYPT 2019, Lecture Notes in Computer Science, Springer, 2019, pp. 505\u2013536.","DOI":"10.1007\/978-3-030-34621-8_18"},{"key":"10.1016\/j.ins.2022.02.016_b0080","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ins.2018.09.024","article-title":"A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem","volume":"473","author":"Jia","year":"2019","journal-title":"Inf. Sci."},{"issue":"8","key":"10.1016\/j.ins.2022.02.016_b0085","doi-asserted-by":"crossref","first-page":"3517","DOI":"10.1109\/TVT.2014.2310897","article-title":"Ideal forward error correction codes for high-speed rail multimedia communications","volume":"63","author":"Chang","year":"2014","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"3","key":"10.1016\/j.ins.2022.02.016_b0090","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.3934\/mbe.2019062","article-title":"A collaborative secret sharing scheme based on the Chinese Remainder Theorem","volume":"16","author":"Jia","year":"2019","journal-title":"Math. Biosci. Eng."},{"key":"10.1016\/j.ins.2022.02.016_b0095","doi-asserted-by":"crossref","unstructured":"M. Ito, A. Saito, T. Nishizeki, Secret sharing scheme realizing general access structure, in: Proceedings of the IEEE Global Telecommunications Conference, IEEE Press, 1987, pp. 56\u201364.","DOI":"10.1002\/ecjc.4430720906"},{"key":"10.1016\/j.ins.2022.02.016_b0100","doi-asserted-by":"crossref","unstructured":"J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in: CRYPTO 1988: Proceedings on Advances in Cryptology, Santa Barbara, California, USA, 1990, pp. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"issue":"1","key":"10.1016\/j.ins.2022.02.016_b0105","first-page":"103","article-title":"A new method of using (k, n)-threshold scheme to realize any access structure (in Chinese)","volume":"38","author":"Li","year":"2004","journal-title":"J. Shanghai Jiaotong Univ."},{"issue":"3","key":"10.1016\/j.ins.2022.02.016_b0110","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s10623-013-9879-3","article-title":"Optimal assignment schemes for general access structures based on linear programming","volume":"74","author":"Li","year":"2015","journal-title":"Des. Codes Crypt."},{"key":"10.1016\/j.ins.2022.02.016_b0115","doi-asserted-by":"crossref","unstructured":"M. Iwamoto, H. Yamamoto, H. Ogawa, Optimal multiple assignments based on integer programming in secret sharing schemes, in: International Symposium on Information Theory, 2004. ISIT 2004, 2004, pp. 16\u201316.","DOI":"10.1109\/ISIT.2004.1365053"},{"key":"10.1016\/j.ins.2022.02.016_b0120","doi-asserted-by":"crossref","unstructured":"M. Iwamoto, H. Yamamoto, H. Ogawa, Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures, IEICE transactions on fundamentals of electronics, communications and computer sciences E90-A (1) (2007) 101\u2013112.","DOI":"10.1093\/ietfec\/e90-a.1.101"},{"key":"10.1016\/j.ins.2022.02.016_b0125","doi-asserted-by":"crossref","unstructured":"S. Droste, New results on visual cryptography, in: Advances in Cryptology-CRYPTO 1996, Vol. 1109 of Lecture Notes in Computer Science, Springer, 1996, pp. 401\u2013415.","DOI":"10.1007\/3-540-68697-5_30"},{"issue":"3","key":"10.1016\/j.ins.2022.02.016_b0130","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TIFS.2011.2158096","article-title":"Optimum pixel expansions for threshold visual secret sharing schemes","volume":"6","author":"Shyu","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"5","key":"10.1016\/j.ins.2022.02.016_b0135","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1109\/TCSVT.2016.2631404","article-title":"Collaborative visual cryptography schemes","volume":"28","author":"Jia","year":"2018","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"10.1016\/j.ins.2022.02.016_b0140","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.ins.2016.06.006","article-title":"Realizing secret sharing with general access structure","volume":"367","author":"Harn","year":"2016","journal-title":"Inf. Sci."},{"volume":"vol. 73","year":"1998","author":"Hungerford","key":"10.1016\/j.ins.2022.02.016_b0145"},{"year":"1996","series-title":"Chinese Remainder Theorem: applications in computing, coding, cryptography","author":"Ding","key":"10.1016\/j.ins.2022.02.016_b0150"},{"issue":"9","key":"10.1016\/j.ins.2022.02.016_b0155","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ipl.2014.04.006","article-title":"Multilevel threshold secret sharing based on the Chinese Remainder Theorem","volume":"114","author":"Harn","year":"2014","journal-title":"Inf. Process. Lett."},{"issue":"21","key":"10.1016\/j.ins.2022.02.016_b0160","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","article-title":"Fast decipherment algorithm for RSA public-key cryptosystem","volume":"18","author":"Quisquater","year":"1982","journal-title":"Electron. Lett."},{"issue":"1","key":"10.1016\/j.ins.2022.02.016_b0165","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TNET.2011.2158442","article-title":"Improving energy saving and reliability in wireless sensor networks using a simple CRT-based packet-forwarding solution","volume":"20","author":"Campobello","year":"2012","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"2","key":"10.1016\/j.ins.2022.02.016_b0170","first-page":"34","article-title":"Changing thresholds in the absence of secure channels","volume":"5","author":"Martin","year":"1999","journal-title":"Austr. Comput. J."},{"year":"2003","series-title":"Combinatorial optimization","author":"Schrijver","key":"10.1016\/j.ins.2022.02.016_b0175"},{"issue":"5","key":"10.1016\/j.ins.2022.02.016_b0180","first-page":"593","article-title":"The map method for synthesis of combinational logic circuits","volume":"72","author":"Karnaugh","year":"1953","journal-title":"Trans. Am. Inst. Electr. Eng. Part I"},{"key":"10.1016\/j.ins.2022.02.016_b0185","unstructured":"Q. Li, Research and application of secure multiparty computation protocols (Ph.D. thesis), Shanghai Jiao Tong University, 2003."},{"issue":"270","key":"10.1016\/j.ins.2022.02.016_b0190","first-page":"1231","article-title":"A computational introduction to number theory and algebra","volume":"79","author":"Shoup","year":"2010","journal-title":"Math. Comput."},{"issue":"1","key":"10.1016\/j.ins.2022.02.016_b0195","first-page":"6","article-title":"An efficient and deterministic algorithm to determine irreducible and primitive polynomials over finite fields","volume":"48","author":"Wang","year":"2009","journal-title":"Acta Scientiarum Naturalium Universitatis Sunyatseni"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522001487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522001487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T14:31:40Z","timestamp":1726669900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025522001487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":39,"alternative-id":["S0020025522001487"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2022.02.016","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A perfect secret sharing scheme for general access structures","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2022.02.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}