{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T03:36:40Z","timestamp":1779334600380,"version":"3.51.4"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N028295\/1"],"award-info":[{"award-number":["EP\/N028295\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tifs.2019.2919926","type":"journal-article","created":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:41:12Z","timestamp":1559245272000},"page":"223-236","source":"Crossref","is-referenced-by-count":21,"title":["Anonymous Single Sign-On With Proxy Re-Verification"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-9452","authenticated-orcid":false,"given":"Jinguang","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2680-4907","authenticated-orcid":false,"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8365-6993","authenticated-orcid":false,"given":"Steve","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helen","family":"Treharne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Wesemeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"205","article-title":"Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions","volume":"3621","author":"abdalla","year":"2005","journal-title":"Advances in CryptologyCRYPTO'97"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-45572-3_1","article-title":"Anonymous attestation using the strong diffie hellman assumption revisited","volume":"9824","author":"camenisch","year":"2016","journal-title":"Proc 4th Int Conf on Trust and Trustworthy Computing"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/0406010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.010"},{"key":"ref30","article-title":"Anonymous single sign-on with proxy re-verification","author":"han","year":"2018","journal-title":"arXiv 1811 07642"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11832072_8","article-title":"Constant-size dynamic k-TAA","volume":"4116","author":"au","year":"2006","journal-title":"Security and Cryptography for Networks"},{"key":"ref36","first-page":"425","article-title":"On the portability of generalized schnorr proofs","volume":"5479","author":"camenisch","year":"2009","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref35","first-page":"410","article-title":"Efficient group signature schemes for large groups","volume":"1294","author":"camenisch","year":"1997","journal-title":"Adv Cryptology"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"ref28","year":"2018","journal-title":"Identity Mixer"},{"key":"ref27","first-page":"198","article-title":"A formal model of identity mixer","volume":"6371","author":"camenisch","year":"2010","journal-title":"Proc 16th Int Workshop Formal Methods Ind Critical Syst"},{"key":"ref29","first-page":"318","article-title":"Dynamic k-times anonymous authentication","volume":"3531","author":"nguyen","year":"2005","journal-title":"Proc ACNS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7521"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1179529.1179532"},{"key":"ref20","first-page":"189","article-title":"Identity-based proxy re-encryption without random oracles","volume":"4779","author":"chu","year":"2007","journal-title":"Proc ISCAS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.11.1008"},{"key":"ref21","first-page":"143","article-title":"Designated verifier proofs and their applications","volume":"1070","author":"jakobsson","year":"1996","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn"},{"key":"ref24","first-page":"308","article-title":"k-times anonymous authentication (extended abstract)","author":"teranishi","year":"2004","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99136-8_22"},{"key":"ref26","first-page":"268","article-title":"A signature scheme with efficient Protocols","volume":"2576","author":"camenisch","year":"2002","journal-title":"Proc SCN"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"ref10","year":"2016","journal-title":"Regulation EU 2016\/679 General Data Protection Regulation"},{"key":"ref11","first-page":"614","article-title":"Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions","volume":"2656","author":"bellare","year":"2003","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"ref12","first-page":"54","article-title":"Proxy cryptosystems: Delegation of the power to decrypt ciphertexts","volume":"e80","author":"mambo","year":"1997","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref13","first-page":"127","article-title":"Divertible protocols and atomic proxy cryptography","volume":"1403","author":"blaze","year":"1998","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn"},{"key":"ref14","first-page":"47","article-title":"Identity-based cryptosystems and signature schemes","volume":"196","author":"shamir","year":"1984","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref15","first-page":"213","article-title":"Identity-based encryption from the weil pairing","author":"boneh","year":"2001","journal-title":"Proc Crypto"},{"key":"ref16","first-page":"288","article-title":"Identity-based proxy re-encryption","volume":"4521","author":"green","year":"2007","journal-title":"Proc Int Conf Appl Cryptogr Netw Secur"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.26"},{"key":"ref18","first-page":"247","article-title":"Proxy re-encryption systems for identity-based encryption","volume":"4575","author":"matsuo","year":"2007","journal-title":"Proc Pairing Based Cryptography Conf"},{"key":"ref19","first-page":"383","article-title":"Identity-based proxy cryptosystems with revocability and hierarchical confidentialities","volume":"6476","author":"wang","year":"2010","journal-title":"Proc ICICS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1504\/IJMC.2008.019824"},{"key":"ref3","author":"kerberos","year":"2017","journal-title":"Kerberos The Network Authentication Protocol"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INCoS.2013.104"},{"key":"ref5","first-page":"181","article-title":"A generic construction of dynamic single sign-on with strong security","volume":"50","author":"han","year":"2010","journal-title":"Proc Int Conf Secur Privacy Commun Syst"},{"key":"ref8","first-page":"470","article-title":"Anonymous single-sign-on for n designated services with traceability","volume":"11098","author":"han","year":"2018","journal-title":"Proc ESORICS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2015.2471095"},{"key":"ref49","year":"2017","journal-title":"Case Study Contactless Payments Travel Well in London"},{"key":"ref9","year":"2012","journal-title":"The Future Railway—The Industry’s Rail Technical Strategy"},{"key":"ref46","author":"camenisch","year":"2018","journal-title":"FIDO ECDAA algorithm implementation draft"},{"key":"ref45","first-page":"319","article-title":"Pairing-friendly elliptic curves of prime order","volume":"3897","author":"barreto","year":"2005","journal-title":"Proc SAC"},{"key":"ref48","first-page":"543","article-title":"Extended tower number field sieve: A new complexity for the medium prime case","volume":"9814","author":"kim","year":"2016","journal-title":"Adv Cryptology"},{"key":"ref47","article-title":"Updating key size estimations for pairings","author":"barbulescu","year":"2018","journal-title":"Journal Cryptology"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"ref41","year":"2017","journal-title":"Benchmark E-Ticketing Systems"},{"key":"ref44","year":"2013","journal-title":"Bouncy Castle Crypto APIs"},{"key":"ref43","author":"lynn","year":"2006","journal-title":"The pairing-based cryptography library"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8833568\/08726406.pdf?arnumber=8726406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:00:41Z","timestamp":1651078841000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8726406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tifs.2019.2919926","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}