{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:38:29Z","timestamp":1767339509300,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T00:00:00Z","timestamp":1570752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T00:00:00Z","timestamp":1570752000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Aerospace Science Foundation of China","award":["61802214"],"award-info":[{"award-number":["61802214"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019BF009","ZR2018LF007"],"award-info":[{"award-number":["ZR2019BF009","ZR2018LF007"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2017MF0","ZR2016YL011"],"award-info":[{"award-number":["ZR2017MF0","ZR2016YL011"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014103","name":"Key Technology Research and Development Program of Shandong","doi-asserted-by":"crossref","award":["Nos. 2018GGX101005","2017CXGC0701"],"award-info":[{"award-number":["Nos. 2018GGX101005","2017CXGC0701"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014103","name":"Key Technology Research and Development Program of Shandong","doi-asserted-by":"crossref","award":["2016GGX109001"],"award-info":[{"award-number":["2016GGX109001"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s12652-019-01529-2","type":"journal-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T15:05:07Z","timestamp":1570806307000},"page":"3337-3347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting post-quantum hash proof systems over lattices for Internet of Thing authentications"],"prefix":"10.1007","volume":"11","author":[{"given":"Zengpeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7078-3771","authenticated-orcid":false,"given":"Jiuru","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"1529_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010a) Efficient lattice (h)ibe in the standard model. In: Proceedings of EUROCRYPT 2010, Springer, pp 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1529_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010b) Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Proceedings of CRYPTO 2010, Springer, pp 98\u2013115","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"1529_CR3","doi-asserted-by":"crossref","unstructured":"Akavia A, Goldwasser S, Vaikuntanathan V (2009) Simultaneous hardcore bits and cryptography against memory attacks.  In: Proceedings of TCC 2009, Springer, pp 474\u2013495","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"1529_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum B, Cash D, Peikert C, Sahai A (2009) Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Proceedings of CRYPTO 2009, Springer, pp 595\u2013618","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"1529_CR5","doi-asserted-by":"crossref","unstructured":"Boyen X (2013) Attribute-based functional encryption on lattices theory of cryptography conference, pp 122\u2013142","DOI":"10.1007\/978-3-642-36594-2_8"},{"key":"1529_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical gapsvp.  In: Proceedings of CRYPTO 2012, Springer, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"1529_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Efficient fully homomorphic encryption from (standard) lwe. In: Proceedings of IEEE FOCS 2011, pp 97\u2013106","DOI":"10.1109\/FOCS.2011.12"},{"key":"1529_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2016) Circuit-abe from lwe: unbounded attributes and semi-adaptive security. In: Proceedings of CRYPTO 2016, Springer, pp 363\u2013384","DOI":"10.1007\/978-3-662-53015-3_13"},{"key":"1529_CR9","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: Proceedings of EUROCRYPT 2010, Springer, pp 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"1529_CR10","doi-asserted-by":"crossref","unstructured":"Cramer R, Shoup V (2001) Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Proceedings of EUROCRYPT 2002, Springer, pp 45\u201364","DOI":"10.7146\/brics.v8i37.21697"},{"key":"1529_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of ACM STOC 2009, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"1529_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of ACM STOC 2008, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"1529_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Proceedings of CRYPTO 2013, Springer, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1529_CR14","doi-asserted-by":"crossref","unstructured":"Gorbunov S, Vaikuntanathan V, Wee H (2013) Attribute-based encryption for circuits. In: Proceedings of ACM STOC 2013, pp 545\u2013554","DOI":"10.1145\/2488608.2488677"},{"key":"1529_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo R, Levin LA, Luby M (1989) Pseudo-random generation from one-way functions.  In: Proceedings of ACM STOC 1989, pp 12\u201324","DOI":"10.1145\/73007.73009"},{"key":"1529_CR16","doi-asserted-by":"crossref","unstructured":"Katz J, Vaikuntanathan V (2009) Smooth projective hashing and password-based authenticated key exchange from lattices, pp 636\u2013652","DOI":"10.1007\/978-3-642-10366-7_37"},{"key":"1529_CR34","unstructured":"Li Z, Wang D (2018) Two-round PAKE protocol over lattices without NIZK. In: Information Security and Cryptology\u201414th International Conference, Inscrypt 2018, pp 138\u2013159"},{"key":"1529_CR17","doi-asserted-by":"crossref","unstructured":"Li Z, Galbraith SD, Ma C (2016a) Preventing adaptive key recovery attacks on the gsw levelled homomorphic encryption scheme.  In: Proceedings of Provsec 2016, Springer, pp 373\u2013383","DOI":"10.1007\/978-3-319-47422-9_22"},{"key":"1529_CR18","doi-asserted-by":"crossref","unstructured":"Li Z, Ma C, Morais E, Du G (2016b) Multi-bit leveled homomorphic encryption via dual.lwe-based.  In: Proceedings of Inscrypt 2016, Springer, pp 221\u2013242","DOI":"10.1007\/978-3-319-54705-3_14"},{"key":"1529_CR19","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2764082","author":"Z Li","year":"2017","unstructured":"Li Z, Ma C, Wang D (2017a) Achieving multi-hop pre via branching program. IEEE Trans Cloud Comput. \nhttps:\/\/doi.org\/10.1109\/TCC.2017.2764082","journal-title":"IEEE Trans Cloud Comput"},{"key":"1529_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2726554","author":"Z Li","year":"2017","unstructured":"Li Z, Ma C, Wang D (2017b) Leakage resilient leveled fhe on multiple bit message. IEEE Trans Big Data. \nhttps:\/\/doi.org\/10.1109\/TBDATA.2017.2726554","journal-title":"IEEE Trans Big Data"},{"key":"1529_CR21","first-page":"5973285:1","volume":"2018","author":"Z Li","year":"2018","unstructured":"Li Z, Xiang C, Wang C (2018) Oblivious transfer via lossy encryption from lattice-based cryptography. Wirel Commun Mob Comput 2018:5973285:1\u20135973285:1","journal-title":"Wirel Commun Mob Comput"},{"key":"1529_CR22","doi-asserted-by":"crossref","unstructured":"Lindner R, Peikert C (2011) Better key sizes (and attacks) for lwe-based encryption.  In: Proceedings of CT-RSA 2011, Springer, pp 319\u2013339","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"1529_CR23","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Proceedings of EUROCRYPT 2012, Springer, pp 738\u2013755","DOI":"10.1007\/978-3-642-29011-4_43"},{"issue":"6","key":"1529_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013) On ideal lattices and learning with errors over rings. J ACM 60(6):43","journal-title":"J ACM"},{"key":"1529_CR25","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece RJ (1978) A public-key cryptosystem based on algebraic. Coding Thv 4244:114\u2013116","journal-title":"Coding Thv"},{"key":"1529_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: simpler, tighter, faster, smaller. In: Proceedings of EUROCRYPT 2012, Springer, pp 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"1529_CR27","doi-asserted-by":"crossref","unstructured":"Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem.  In: Proceedings of ACM STOC 2009, ACM, pp 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"issue":"6","key":"1529_CR28","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"Peikert C, Waters B (2011) Lossy trapdoor functions and their applications. SIAM J Comput 40(6):1803\u20131844","journal-title":"SIAM J Comput"},{"key":"1529_CR29","doi-asserted-by":"crossref","unstructured":"Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer.  In: Proceedings of CRYPTO 2008, Springer, pp 554\u2013571","DOI":"10.1007\/978-3-540-85174-5_31"},{"issue":"6","key":"1529_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34","journal-title":"J ACM"},{"key":"1529_CR31","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: In: Proceedings of IEEE FOCS 1994, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"3","key":"1529_CR32","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1504\/IJWGS.2017.085168","volume":"13","author":"XA Wang","year":"2017","unstructured":"Wang XA, Ma J, Xhafa F, Qin B, Zhang M (2017) New efficient chosen ciphertext secure elgamal encryption schemes for secure cloud storage service. Int J Web Grid Serv 13(3):246\u2013269","journal-title":"Int J Web Grid Serv"},{"issue":"7","key":"1529_CR33","doi-asserted-by":"publisher","first-page":"72103","DOI":"10.1007\/s11432-016-5535-7","volume":"60","author":"F Wei","year":"2017","unstructured":"Wei F, Ma J, Zhang R, Ma C, Wang XA (2017) An efficient and practical threshold gateway-oriented password-authenticated key exchange protocol in the standard model. Sci China Ser F Inf Sci 60(7):72103","journal-title":"Sci China Ser F Inf Sci"},{"issue":"5","key":"1529_CR35","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s12652-015-0260-4","volume":"7","author":"M Zhang","year":"2016","unstructured":"Zhang M, Wu L, Wang XA, Yang X (2016) Unidirectional ibpre scheme from lattice for cloud computation. Ambient Intell 7(5):623\u2013631","journal-title":"Ambient Intell"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-019-01529-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-019-01529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T23:24:01Z","timestamp":1602285841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-019-01529-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,11]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1529"],"URL":"https:\/\/doi.org\/10.1007\/s12652-019-01529-2","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2019,10,11]]},"assertion":[{"value":"7 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}