iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1016/J.INS.2023.119488
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T04:13:07Z","timestamp":1730520787445,"version":"3.28.0"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"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","award":["2022PD0AC02","62072133","62172181","62272189"],"id":[{"id":"10.13039\/501100001809","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":[[2023,11]]},"DOI":"10.1016\/j.ins.2023.119488","type":"journal-article","created":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T15:50:27Z","timestamp":1691682627000},"page":"119488","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Ideal dynamic threshold Multi-secret data sharing in smart environments for sustainable cities"],"prefix":"10.1016","volume":"647","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3847-7659","authenticated-orcid":false,"given":"Chingfang","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Lein","family":"Harn","sequence":"additional","affiliation":[]},{"given":"Man Ho","family":"Au","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1447-8761","authenticated-orcid":false,"given":"Jianqun","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Zhuo","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2023.119488_b0005","doi-asserted-by":"crossref","unstructured":"Singh S, Pise A, Alfarraj O, et al. A cryptographic approach to prevent network incursion for enhancement of QoS in sustainable smart city using MANET[J]. Sustainable Cities and Society, 2022, 79: 103483.","DOI":"10.1016\/j.scs.2021.103483"},{"key":"10.1016\/j.ins.2023.119488_b0020","doi-asserted-by":"crossref","unstructured":"Deebak B D, Memon F H, Cheng X, et al. Seamless privacy-preservation and authentication framework for IoT-enabled smart eHealth systems[J]. Sustainable Cities and Society, 2022, 80: 103661.","DOI":"10.1016\/j.scs.2021.103661"},{"key":"10.1016\/j.ins.2023.119488_b0075","doi-asserted-by":"crossref","unstructured":"L. Harn, Z. Xia, C. Hsu, Y. Liu, Secret sharing with secure secret reconstruction, Information Sciences, Vol. 519, May 2 (2020), pp. 1-8.","DOI":"10.1016\/j.ins.2020.01.038"},{"key":"10.1016\/j.ins.2023.119488_b0030","doi-asserted-by":"crossref","unstructured":"Mishra A K, Puthal D, Tripathy A K. GraphCrypto: Next generation data security approach towards sustainable smart city building[J]. Sustainable Cities and Society, 2021, 72: 103056.","DOI":"10.1016\/j.scs.2021.103056"},{"key":"10.1016\/j.ins.2023.119488_b0085","first-page":"1","article-title":"How to Share Secret Efficiently over Networks","volume":"2017","author":"Harn","year":"2017","journal-title":"Security and Communication Networks"},{"issue":"4","key":"10.1016\/j.ins.2023.119488_b0040","doi-asserted-by":"crossref","first-page":"3535","DOI":"10.1109\/TDSC.2022.3203874","article-title":"A practical lightweight anonymous authentication and key establishment scheme for resource-asymmetric smart environments[J]","volume":"20","author":"Bai","year":"2023","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"4","key":"10.1016\/j.ins.2023.119488_b0045","doi-asserted-by":"crossref","first-page":"2318","DOI":"10.1109\/TDSC.2021.3055495","article-title":"Enabling (End-to-End) Encrypted Cloud Emails With Practical Forward Secrecy","volume":"19","author":"Wei","year":"2022","journal-title":"IEEE Transactions on Dependable and Secure Computing."},{"key":"10.1016\/j.ins.2023.119488_b0050","doi-asserted-by":"crossref","unstructured":"Jing Pan, Xiaofeng Chen, Fangguo Zhang, Willy Susilo: Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy. ASIACRYPT (4) 2021: 156-186.","DOI":"10.1007\/978-3-030-92068-5_6"},{"key":"10.1016\/j.ins.2023.119488_b0055","doi-asserted-by":"crossref","unstructured":"Jegadeesan S, Azees M, Kumar P M, et al. An efficient anonymous mutual authentication technique for providing secure communication in mobile cloud computing for smart city applications[J]. Sustainable Cities and Society, 2019, 49: 101522.","DOI":"10.1016\/j.scs.2019.101522"},{"key":"10.1016\/j.ins.2023.119488_b0060","doi-asserted-by":"crossref","unstructured":"Sarosh P, Parah S A, Bhat G M, et al. Secret sharing-based personal health records management for the Internet of Health Things[J]. Sustainable Cities and Society, 2021, 74: 103129.","DOI":"10.1016\/j.scs.2021.103129"},{"issue":"11","key":"10.1016\/j.ins.2023.119488_b0160","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.2023.119488_b0010","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS\u201979 Nat. Computer Conf. (1979); 48: 313\u2013317, AFIPS Press.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10.1016\/j.ins.2023.119488_b0145","first-page":"34","article-title":"Changing thresholds in the absence of secure channels","volume":"31","author":"Martin","year":"1999","journal-title":"J. Aust. Comput."},{"key":"10.1016\/j.ins.2023.119488_b0170","doi-asserted-by":"crossref","unstructured":"R. Steinfeld, H. Wang, J. Pieprzyk, Lattice-based threshold changeability for standard Shamir secret-sharing schemes, in: Advances in Cryptology, ASIACRYPT\u201904, in: Lecture Notes in Computer Science, vol. 3329, (2004) 170-186.","DOI":"10.1007\/978-3-540-30539-2_13"},{"key":"10.1016\/j.ins.2023.119488_b0190","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.tcs.2011.09.027","article-title":"Threshold changeable SSs revisited","volume":"418","author":"Zhang","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2023.119488_b0140","doi-asserted-by":"crossref","unstructured":"K.M. Martin, J. Pieprzyk, R. Safavi-Nain, H. Wang, Changing thresholds in the absence of secure channels, in: Proceedings of ACISP\u201999, in: Lecture Notes in Computer Science, vol. 1587, (1999) 177-191.","DOI":"10.1007\/3-540-48970-3_15"},{"key":"10.1016\/j.ins.2023.119488_b0135","doi-asserted-by":"crossref","unstructured":"T. Lou, C. Tartary, Analysis and design of multiple threshold changeable secret sharing, in: Proceedings of CANS\u201908, in: Lecture Notes in Computer Science, vol. 5339, Springer-Verlag (2008) 196-213.","DOI":"10.1007\/978-3-540-89641-8_14"},{"key":"10.1016\/j.ins.2023.119488_b0110","first-page":"13","volume":"473","author":"Jia","year":"2019","journal-title":"A new threshold changeable SS based on the Chinese Remainder Theorem"},{"key":"10.1016\/j.ins.2023.119488_b0185","doi-asserted-by":"crossref","unstructured":"X. Zhang, M. He, Collusion attack resistance and practice-oriented threshold changeable SSs, in: Proc. 2010 24th IEEE International Conference on Advanced Information Networking and Applications, (2010) 745-752.","DOI":"10.1109\/AINA.2010.56"},{"key":"10.1016\/j.ins.2023.119488_b0070","doi-asserted-by":"crossref","unstructured":"L. Harn, Secure secret reconstruction and multi-SSs with unconditional security,Security and Communication Networks,Vol. 7,Iss. 3, (2015) 567-573.","DOI":"10.1002\/sec.758"},{"issue":"11","key":"10.1016\/j.ins.2023.119488_b0080","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.ipl.2015.06.014","article-title":"Dynamic threshold secret reconstruction and its application to the threshold cryptography","volume":"115","author":"Harn","year":"2015","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ins.2023.119488_b0100","first-page":"1099","article-title":"Security analysis of a dynamic threshold SS using linear subspace method","volume":"2017","author":"Jamshidpour","year":"2017","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"10.1016\/j.ins.2023.119488_b0180","doi-asserted-by":"crossref","unstructured":"L. Yuan, M\/ Li, C. Guo, K.-K. R. Choo, Y. Ren, Novel threshold changeable SSs based on polynomial interpolation, PLOS ONE | DOI:10.1371\/journal.pone.0165512 October 28 (2016).","DOI":"10.1371\/journal.pone.0165512"},{"key":"10.1016\/j.ins.2023.119488_b0150","doi-asserted-by":"crossref","unstructured":"K. Meng, F. Miao, W. Huang, Y. Xiong, Threshold changeable secret sharing with secure secret reconstruction. Information Processing LettersVol. 157, May (2020), 105928.","DOI":"10.1016\/j.ipl.2020.105928"},{"issue":"7","key":"10.1016\/j.ins.2023.119488_b0095","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1016\/j.ins.2010.11.032","article-title":"An ideal multi-secret sharing scheme based on MSP[J]","volume":"181","author":"Hsu","year":"2011","journal-title":"Information Sciences"},{"issue":"1","key":"10.1016\/j.ins.2023.119488_b0195","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","article-title":"A mathematical theory of communication[J]","volume":"5","author":"Shannon","year":"2001","journal-title":"ACM SIGMOBILE mobile computing and communications review"},{"issue":"1","key":"10.1016\/j.ins.2023.119488_b0165","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 Systems Journal"},{"issue":"9","key":"10.1016\/j.ins.2023.119488_b0115","doi-asserted-by":"crossref","first-page":"9390","DOI":"10.1109\/TVT.2020.2971254","article-title":"Unified Biometric Privacy Preserving Three-factor Authentication and Key Agreement for Cloud-assisted Autonomous Vehicles","volume":"69","author":"Jiang","year":"2020","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"2","key":"10.1016\/j.ins.2023.119488_b0120","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1109\/TETC.2019.2949137","article-title":"Optimized Fuzzy Commitment based Key Agreement Protocol for Wireless Body Area Network","volume":"9","author":"Jiang","year":"2021","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"issue":"9","key":"10.1016\/j.ins.2023.119488_b0175","doi-asserted-by":"crossref","first-page":"4081","DOI":"10.1109\/TII.2018.2834351","article-title":"Measuring Two-Factor Authentication Schemes for Real-Time Data Access in Industrial Wireless Sensor Networks","volume":"14","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"6","key":"10.1016\/j.ins.2023.119488_b0035","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans Inf Theory"},{"key":"10.1016\/j.ins.2023.119488_b0090","doi-asserted-by":"crossref","unstructured":"Hsu C, Harn L, Xia Z, et al. Construction of Lightweight Authenticated Joint Arithmetic Computation for 5G IoT Networks[J]. The Computer Journal, 2021.","DOI":"10.1093\/comjnl\/bxab155"},{"volume":"vol. 2","year":"1981","author":"Knuth","key":"10.1016\/j.ins.2023.119488_b0130"},{"key":"10.1016\/j.ins.2023.119488_b0025","doi-asserted-by":"crossref","unstructured":"Candan C. An efficient filtering structure for Lagrange interpolation[J]. IEEE Signal Process. Lett., 2007, 14(1): 17-19.","DOI":"10.1109\/LSP.2006.881528"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025523010733?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025523010733?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:54:18Z","timestamp":1730487258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025523010733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":34,"alternative-id":["S0020025523010733"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.ins.2023.119488","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ideal dynamic threshold Multi-secret data sharing in smart environments for sustainable cities","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2023.119488","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"119488"}}