{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:59:03Z","timestamp":1760597943377,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T00:00:00Z","timestamp":1580083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T00:00:00Z","timestamp":1580083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672270","61602216"],"award-info":[{"award-number":["61672270","61602216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the IndustryUniversity-Research Cooperation Project of Jiangsu Province","award":["No. BY2018309"],"award-info":[{"award-number":["No. BY2018309"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s11036-019-01498-y","type":"journal-article","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T08:02:31Z","timestamp":1580112151000},"page":"1609-1615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity under Quantum Environment"],"prefix":"10.1007","volume":"26","author":[{"given":"Zhengjun","family":"Jing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunsheng","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunpeng","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peizhong","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,27]]},"reference":[{"key":"1498_CR1","doi-asserted-by":"publisher","unstructured":"Liu ZL, Li B, Huang Y, Li J, Xiang Y, Pedrycz W (2019) NewMCOS: towards a practical multi-cloud oblivious storage scheme. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2019.2891581","DOI":"10.1109\/TKDE.2019.2891581"},{"key":"1498_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jnca.2018.03.006","volume":"112","author":"J Li","year":"2018","unstructured":"Li J, Chen X, Chow SSM, Huang Q, Wong DS, Liu Z (2018) Multi-authority fine-grained access control with accountability and its application in cloud. J Netw Comput Appl 112:89\u201396","journal-title":"J Netw Comput Appl"},{"key":"1498_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.02.071","volume":"447","author":"ZL Liu","year":"2018","unstructured":"Liu ZL, Huang Y, Li J, Cheng X, Shen C (2018) DivORAM: towards a practical oblivious RAM with variable block size. Inf Sci 447:1\u201311","journal-title":"Inf Sci"},{"issue":"10","key":"1498_CR4","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1109\/TC.2015.2512870","volume":"65","author":"X Chen","year":"2016","unstructured":"Chen X, Li J, Weng J, Ma J, Lou W (2016) Verifiable computation over large database with incremental updates. IEEE Trans Comput 65(10):3184\u20133195","journal-title":"IEEE Trans Comput"},{"key":"1498_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.future.2017.02.024","volume":"78","author":"ZL Liu","year":"2018","unstructured":"Liu ZL, Li T, Li P, Jia C, Li J (2018) Verifiable searchable encryption with aggregate keys for data sharing system. Futur Gener Comput Syst 78:778\u2013788","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"1498_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.3390\/info10020075","volume":"10","author":"Y Ping","year":"2019","unstructured":"Ping Y, Wang B, Tian S, Zhou J, Ma H (2019) PKCHD: towards a probabilistic knap-sack public-key cryptosystem with high density. Information 10(2):75","journal-title":"Information"},{"key":"1498_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Die","year":"1976","unstructured":"Die W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22:644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"1498_CR8","doi-asserted-by":"crossref","unstructured":"Rivest RL, Shamir A, Adleman LM. A method for obtaining digital signatures and public-key cryptosystems (1978). Communications of the ACM, 21(2): 120\u2013126","DOI":"10.1145\/359340.359342"},{"key":"1498_CR9","doi-asserted-by":"crossref","unstructured":"ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms (1984). In CRYPTO 1984, LNCS 196, pp 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"key":"1498_CR10","doi-asserted-by":"crossref","unstructured":"Miller VS. Use of elliptic curves in cryptography (1985). In CRYPTO 1985, LNCS 218, pp 417\u2013426","DOI":"10.1007\/3-540-39799-X_31"},{"key":"1498_CR11","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484\u20131509","journal-title":"SIAM J Comput"},{"key":"1498_CR12","first-page":"88","volume":"9100","author":"Buchmann JA, Butin D. Post-Quantum Cryptography: State of the Art","year":"2016","unstructured":"Buchmann JA, Butin D. Post-Quantum Cryptography: State of the Art (2016) The new Codebreakers. LNCS 9100:88\u2013108","journal-title":"LNCS"},{"key":"1498_CR13","unstructured":"McEliece RJ. A public-key cryptosystem based on algebraic coding theory (1978). Deep Space Network Progress Report 44, pp 114\u2013116"},{"key":"1498_CR14","doi-asserted-by":"crossref","unstructured":"Peikert C. Lattice Cryptography for the Internet (2014). Post-quantum cryptography, LNCS 8772, pp 197\u2013219","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"1498_CR15","doi-asserted-by":"crossref","unstructured":"Stehle D, Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices(2011). EUROCRYPT 2011, LNCS 6632, pp 27\u201347","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"1498_CR16","first-page":"1","volume":"6110","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: EUROCRYPT 2010. LNCS 6110:1\u201323","journal-title":"LNCS"},{"key":"1498_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","volume":"2005","author":"O Regev","year":"2005","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. STOC 2005:84\u201393","journal-title":"STOC"},{"key":"1498_CR18","first-page":"231","volume":"7932","author":"C Tao","year":"2013","unstructured":"Tao C, Diene A, Tang S, Ding J (2013) Simple matrix scheme for encryption. In:PQCrypto 2013. LNCS 7932:231\u2013242","journal-title":"LNCS"},{"key":"1498_CR19","doi-asserted-by":"crossref","unstructured":"Petzoldt A, Chen M S, Yang BY, Tao C, Ding J (2015). Design principles for HFEv-based multivariate signature schemes. In: ASIACRYPT 2015, part I. LNCS 9452, pp311\u2013334","DOI":"10.1007\/978-3-662-48797-6_14"},{"key":"1498_CR20","doi-asserted-by":"publisher","first-page":"3824","DOI":"10.1103\/PhysRevA.54.3824","volume":"54","author":"CH Bennett","year":"1996","unstructured":"Bennett CH, DiVincenzo DP, Smolin JA, Wootters WK (1996) Mixed-state entanglement and quantum error correction. Phys Rev A 54:3824\u20133851","journal-title":"Phys Rev A"},{"key":"1498_CR21","first-page":"1","volume":"56","author":"JJ Shi","year":"2013","unstructured":"Shi JJ, Shi RH, Guo Y, Peng XQ, Tang Y (2013) Batch proxy quantum blind signature scheme. Science China Information Science 56:1\u20139","journal-title":"Science China Information Science"},{"issue":"3","key":"1498_CR22","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/s11432-010-0063-3","volume":"53","author":"XJ Lai","year":"2010","unstructured":"Lai XJ, Lu MX, Qin L, Han JS, Fang XW (2010) Asymmetric encryption and signature method with DNA technology. Science China Information Science 53(3):506\u2013514","journal-title":"Science China Information Science"},{"key":"1498_CR23","first-page":"1","volume":"58","author":"WQ Wu","year":"2015","unstructured":"Wu WQ, Zhang HG, Wang HZ, Mao SW, Jia JW, Liu JH (2015) A public key cryptosystem based on data complexity under quantum environment. Science China Information Science 58:1\u201311","journal-title":"Science China Information Science"},{"key":"1498_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814549","volume-title":"A computational introduction to number theory and algebra","author":"V Shoup","year":"2008","unstructured":"Shoup V (2008) A computational introduction to number theory and algebra. Cambridge University Press, London"},{"key":"1498_CR25","unstructured":"Goldwasser S, Bellare M (2008). Lecture Notes on Cryptography. http:\/\/cseweb.ucsd.edu\/mihir\/papers\/gb.html"},{"key":"1498_CR26","first-page":"64","volume":"6","author":"J Rosser","year":"1962","unstructured":"Rosser J, Schoeneld L (1962) Approximate formulas for some functions of prime numbers. Ill J Math 6:64\u201394","journal-title":"Ill J Math"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01498-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-019-01498-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01498-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:25:29Z","timestamp":1695666329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-019-01498-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,27]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1498"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01498-y","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2020,1,27]]},"assertion":[{"value":"27 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}