乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:40Z","timestamp":1740114460345,"version":"3.37.3"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003696","name":"ETRI","doi-asserted-by":"publisher","award":["15ZS1500"],"id":[{"id":"10.13039\/501100003696","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1016\/j.tcs.2015.11.047","type":"journal-article","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T12:02:10Z","timestamp":1450180930000},"page":"45-60","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Revocable hierarchical identity-based encryption via history-free approach"],"prefix":"10.1016","volume":"615","author":[{"given":"Jae Hong","family":"Seo","sequence":"first","affiliation":[]},{"given":"Keita","family":"Emura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2015.11.047_br0010","series-title":"ACM CCS","first-page":"417","article-title":"Identity-based encryption with efficient revocation","author":"Boldyreva","year":"2008"},{"key":"10.1016\/j.tcs.2015.11.047_br0020","series-title":"EUROCRYPT 2004","first-page":"223","article-title":"Efficient selective-ID identity based encryption without random oracles","volume":"vol. 3027","author":"Boneh","year":"2004"},{"key":"10.1016\/j.tcs.2015.11.047_br0030","series-title":"EUROCRYPT 2005","first-page":"440","article-title":"Hierarchical identity based encryption with constant size ciphertexts","volume":"vol. 3494","author":"Boneh","year":"2005"},{"author":"Boneh","key":"10.1016\/j.tcs.2015.11.047_br0040"},{"key":"10.1016\/j.tcs.2015.11.047_br0050","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/S0097539701398521","article-title":"Identity-based encryption from the Weil pairing","volume":"32","author":"Boneh","year":"2003","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2015.11.047_br0060","series-title":"TCC 2011","first-page":"253","article-title":"Functional encryption: definitions and challenges","author":"Boneh","year":"2011"},{"key":"10.1016\/j.tcs.2015.11.047_br0070","series-title":"CRYPTO 2006","first-page":"290","article-title":"Anonymous hierarchical identity-based encryption (without random oracles)","volume":"vol. 4117","author":"Boyen","year":"2006"},{"key":"10.1016\/j.tcs.2015.11.047_br0080","series-title":"EUROCRYPT 2003","article-title":"A forward-secure public-key encryption scheme","volume":"vol. 2656","author":"Canetti","year":"2003"},{"key":"10.1016\/j.tcs.2015.11.047_br0090","series-title":"ACISP 2012","first-page":"390","article-title":"Revocable identity-based encryption from lattices","volume":"vol. 7372","author":"Chen","year":"2012"},{"key":"10.1016\/j.tcs.2015.11.047_br0100","series-title":"The Digital Rights Management Workshop 2002","first-page":"61","article-title":"Public key broadcast encryption for stateless receivers","volume":"vol. 2696","author":"Dodis","year":"2002"},{"key":"10.1016\/j.tcs.2015.11.047_br0110","series-title":"CT-RSA","first-page":"148","article-title":"Anonymity from asymmetry: new constructions for anonymous hibe","volume":"vol. 5985","author":"Ducas","year":"2010"},{"key":"10.1016\/j.tcs.2015.11.047_br0120","series-title":"ACM Conference on Computer and Communications Security 2006","first-page":"89","article-title":"Attribute-based encryption for fine-grained access control of encrypted data","author":"Goyal","year":"2006"},{"key":"10.1016\/j.tcs.2015.11.047_br0130","series-title":"EUROCRYPT 2002","first-page":"466","article-title":"Towards hierarchical identity-based encryption","volume":"vol. 2332","author":"Horwitz","year":"2002"},{"key":"10.1016\/j.tcs.2015.11.047_br0140","series-title":"EUROCRYPT 2008","article-title":"Predicate encryption supporting disjunctions, polynomial equations, and inner products","volume":"vol. 4965","author":"Katz","year":"2008"},{"key":"10.1016\/j.tcs.2015.11.047_br0150","unstructured":"K. Lee, D.H. Lee, J.H. Park, Efficient revocable identity-based encryption via subset difference methods, eprint.iacr.org\/2014\/132 (2014)."},{"key":"10.1016\/j.tcs.2015.11.047_br0160","series-title":"EUROCRYPT 2011","first-page":"547","article-title":"Unbounded HIBE and attribute-based encryption","volume":"vol. 6632","author":"Lewko","year":"2011"},{"key":"10.1016\/j.tcs.2015.11.047_br0170","series-title":"CT-RSA","first-page":"1","article-title":"Adaptive-ID secure revocable identity-based encryption","volume":"vol. 5473","author":"Libert","year":"2009"},{"key":"10.1016\/j.tcs.2015.11.047_br0180","series-title":"PKC","first-page":"235","article-title":"Towards black-box accountable authority IBE with short ciphertexts and private keys","volume":"vol. 5443","author":"Libert","year":"2009"},{"key":"10.1016\/j.tcs.2015.11.047_br0190","series-title":"CRYPTO 2001","first-page":"41","article-title":"Revocation and tracing schemes for stateless receivers","volume":"vol. 2139","author":"Naor","year":"2001"},{"key":"10.1016\/j.tcs.2015.11.047_br0200","series-title":"ASIACRYPT","first-page":"214","article-title":"Hierarchical predicate encryption for inner-products","volume":"vol. 5912","author":"Okamoto","year":"2009"},{"key":"10.1016\/j.tcs.2015.11.047_br0210","series-title":"ACM CCS 2013","first-page":"463","article-title":"Practical constructions and new proof methods for large universe attribute-based encryption","author":"Rouselakis","year":"2013"},{"key":"10.1016\/j.tcs.2015.11.047_br0220","series-title":"EUROCRYPT 2005","first-page":"457","article-title":"Fuzzy identity-based encryption","volume":"vol. 3494","author":"Sahai","year":"2005"},{"key":"10.1016\/j.tcs.2015.11.047_br0230","series-title":"CT-RSA 2013","first-page":"343","article-title":"Efficient delegation of key generation and revocation functionalities in identity-based encryption","volume":"vol. 7779","author":"Seo","year":"2013"},{"key":"10.1016\/j.tcs.2015.11.047_br0240","series-title":"PKC 2013","first-page":"216","article-title":"Revocable identity-based encryption revisited: security model and construction","volume":"vol. 7778","author":"Seo","year":"2013"},{"key":"10.1016\/j.tcs.2015.11.047_br0250","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.tcs.2014.04.031","article-title":"Revocable hierarchical identity-based encryption","volume":"542","author":"Seo","year":"2014","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.11.047_br0260","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TIFS.2014.2327758","article-title":"Revocable identity-based cryptosystem revisited: security models and constructions","volume":"9","author":"Seo","year":"2014","journal-title":"IEEE Trans. Inform. Forensics Secur."},{"key":"10.1016\/j.tcs.2015.11.047_br0270","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1587\/transfun.E97.A.1806","article-title":"Revocable identity-based encryption with rejoin functionality","volume":"97-A","author":"Seo","year":"2014","journal-title":"IEICE Trans."},{"key":"10.1016\/j.tcs.2015.11.047_br0280","series-title":"CT-RSA 2015","first-page":"106","article-title":"Revocable hierarchical identity-based encryption: history-free update, security against insiders, and short ciphertexts","volume":"vol. 9048","author":"Seo","year":"2015"},{"key":"10.1016\/j.tcs.2015.11.047_br0290","series-title":"PKC","first-page":"215","article-title":"Anonymous hierarchical identity-based encryption with constant size ciphertexts","volume":"vol. 5443","author":"Seo","year":"2009"},{"key":"10.1016\/j.tcs.2015.11.047_br0300","series-title":"Anonymous Hierarchical Identity-based Encryption with Short Ciphertexts, vol. 94-A(1)","first-page":"45","author":"Seo","year":"2011"},{"key":"10.1016\/j.tcs.2015.11.047_br0310","series-title":"CRYPTO 1984","first-page":"47","article-title":"Identity-based cryptosystems and signature schemes","author":"Shamir","year":"1984"},{"key":"10.1016\/j.tcs.2015.11.047_br0320","doi-asserted-by":"crossref","first-page":"299","DOI":"10.15388\/Informatica.2014.16","article-title":"RHIBE: constructing revocable hierarchical ID-based encryption from HIBE","volume":"25","author":"Tsai","year":"2014","journal-title":"Informatica (Vilnius)"},{"key":"10.1016\/j.tcs.2015.11.047_br0330","series-title":"EUROCRYPT 2005","first-page":"114","article-title":"Efficient identity-based encryption without random oracles","volume":"vol. 3494","author":"Waters","year":"2005"},{"key":"10.1016\/j.tcs.2015.11.047_br0340","series-title":"CRYPTO","first-page":"619","article-title":"Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions","volume":"vol. 5677","author":"Waters","year":"2009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515011354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515011354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T20:24:58Z","timestamp":1581711898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515011354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":34,"alternative-id":["S0304397515011354"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.11.047","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2016,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Revocable hierarchical identity-based encryption via history-free approach","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.11.047","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}