{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:29:46Z","timestamp":1772724586699,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Systems Journal"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/jsyst.2012.2221931","type":"journal-article","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T19:03:08Z","timestamp":1353092588000},"page":"249-261","source":"Crossref","is-referenced-by-count":37,"title":["Constant-Size Dynamic $k$-Times Anonymous Authentication"],"prefix":"10.1109","volume":"7","author":[{"given":"Man Ho","family":"Au","sequence":"first","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"nguyen","year":"2005","journal-title":"Cryptographic privacy enhancing technologies"},{"key":"ref38","first-page":"81","article-title":"Robust receipt-free election system with ballot secrecy and verifiability","author":"chow","year":"2008","journal-title":"Proc Symp Netw Distrib Syst Security"},{"key":"ref33","first-page":"416","article-title":"A verifiable random function with short proofs and keys","volume":"lncs 3386","author":"dodis","year":"2005","journal-title":"Proc PKC"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","article-title":"Efficient group signature schemes for large groups (extended abstract)","volume":"lncs 1294","author":"camenisch","year":"1997","journal-title":"Proc Adv Cryptology (Crypto)"},{"key":"ref31","first-page":"186","article-title":"How to prove yourself: Practical solutions to identification and signature problems","volume":"lncs 263","author":"fiat","year":"1986","journal-title":"Proc Adv Cryptology (Crypto)"},{"key":"ref30","first-page":"291","article-title":"The knowledge complexity of interactive proof-systems (extended abstract)","author":"goldwasser","year":"1985","journal-title":"Proc ACM Symp Theory Comput"},{"key":"ref37","first-page":"431","article-title":"Efficient proofs that a committed number lies in an interval","volume":"lncs 1807","author":"boudot","year":"2000","journal-title":"Proc Advances in Cryptology (EUROCRYPT '98)"},{"key":"ref36","author":"camenisch","year":"1998","journal-title":"Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem"},{"key":"ref35","first-page":"275","article-title":"Accumulators from bilinear pairings and applications","volume":"lncs 3376","author":"nguyen","year":"2005","journal-title":"Proc CT-RSA"},{"key":"ref34","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume":"lncs 576","author":"pedersen","year":"1991","journal-title":"Proc Adv Cryptology (Crypto)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_26"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21554-4_11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_6"},{"key":"ref12","first-page":"66","volume":"6052","author":"camenisch","year":"2010","journal-title":"Financial Cryptography"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1920261.1920271"},{"key":"ref14","first-page":"192","volume":"6571","author":"camenisch","year":"2011","journal-title":"Public Key Cryptography"},{"key":"ref15","first-page":"246","article-title":"Efficient proofs of attributes in pairing-based anonymous credential system","volume":"lncs 6794","author":"sudarsono","year":"2011","journal-title":"Proc PETS"},{"key":"ref16","article-title":"BLACR: TTP-free blacklistable anonymous credentials with reputation","author":"au","year":"2012","journal-title":"Proc 10th Annu Netw Distrib Syst Security Symp"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382294"},{"key":"ref18","first-page":"234","article-title":"Efficient protocols for set membership and range proofs","volume":"lncs 5350","author":"camenisch","year":"2008","journal-title":"Proc Advances in Cryptology (ASIACRYPT)"},{"key":"ref19","author":"acar","year":"0","journal-title":"Accumulators and U-prove revocation"},{"key":"ref28","first-page":"223","article-title":"Event-oriented <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-times revocable-iff-linked group signatures","volume":"lncs 4058","author":"au","year":"2006","journal-title":"Proc ACISP"},{"key":"ref4","first-page":"268","article-title":"A signature scheme with efficient protocols","volume":"lncs 2576","author":"camenisch","year":"2002","journal-title":"Proc SCN"},{"key":"ref27","first-page":"175","article-title":"Escrowed linkability of ring signatures and its applications","volume":"lncs 4341","author":"chow","year":"2006","journal-title":"Proc Int Conf VIETCRYPT"},{"key":"ref3","first-page":"318","article-title":"Dynamic <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-times anonymous authentication","volume":"lncs 3531","author":"nguyen","year":"2005","journal-title":"Proc ACNS"},{"key":"ref6","first-page":"41","article-title":"Short group signatures","volume":"lncs 3152","author":"boneh","year":"2004","journal-title":"Proc Adv Cryptology (Crypto)"},{"key":"ref29","first-page":"56","article-title":"Short signatures without random oracles","volume":"lncs 3027","author":"boneh","year":"2004","journal-title":"Proc Advances in Cryptology (EUROCRYPT '98)"},{"key":"ref5","first-page":"679","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\rm PE}({\\rm AR})^{2}$<\/tex><\/formula>: Privacy-enhanced anonymous authentication with reputation and revocation","volume":"lncs 7459","author":"yu","year":"2012","journal-title":"Proc ESORICS"},{"key":"ref8","first-page":"72","article-title":"Blacklistable anonymous credentials: Blocking misbehaving users without TTPs","author":"tsang","year":"2007","journal-title":"Proc 14th ACM Conf Comput Commun Security"},{"key":"ref7","first-page":"56","article-title":"Signature schemes and anonymous credentials from bilinear maps","volume":"lncs 3152","author":"camenisch","year":"2004","journal-title":"Proc Adv Cryptology (Crypto)"},{"key":"ref2","first-page":"308","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-times anonymous authentication (extended abstract)","volume":"lncs 3329","author":"teranishi","year":"2004","journal-title":"Proc Advances in Cryptology - Asiacrypt '96"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653679"},{"key":"ref1","first-page":"111","article-title":"Constant-size dynamic <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-TAA","volume":"lncs 4116","author":"au","year":"2006","journal-title":"Proc SCN"},{"key":"ref20","first-page":"481","article-title":"An Accumulator based on bilinear maps and efficient revocation for anonymous credentials","volume":"lncs 5443","author":"camenisch","year":"2009","journal-title":"Proc PKC"},{"key":"ref22","first-page":"571","article-title":"Traceable signatures","volume":"lncs 3027","author":"kiayias","year":"2004","journal-title":"Proc Advances in Cryptology (EUROCRYPT '98)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","article-title":"Dynamic accumulators and application to efficient revocation of anonymous credentials","volume":"lncs 2442","author":"camenisch","year":"2002","journal-title":"Proc Advances in Cryptology (CRYPTO 2002)"},{"key":"ref23","first-page":"525","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-Times anonymous authentication with a constant proving cost","volume":"lncs 3958","author":"teranishi","year":"2006","journal-title":"Proc PKC"},{"key":"ref26","first-page":"499","article-title":"Efficient identity based ring signature","volume":"lncs 3531","author":"chow","year":"2005","journal-title":"Proc ACNS"},{"key":"ref25","first-page":"302","article-title":"Compact E-cash","volume":"lncs 3494","author":"camenisch","year":"2005","journal-title":"Proc Advances in Cryptology (EUROCRYPT '98)"}],"container-title":["IEEE Systems Journal"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4267003\/6504497\/06355604.pdf?arnumber=6355604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:28:13Z","timestamp":1638217693000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6355604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":40,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsyst.2012.2221931","relation":{},"ISSN":["1932-8184","1937-9234"],"issn-type":[{"value":"1932-8184","type":"print"},{"value":"1937-9234","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}