{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:39:12Z","timestamp":1774946352878,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,12,26]],"date-time":"2008-12-26T00:00:00Z","timestamp":1230249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Institute for Security Technology Studies","award":["BJA-2005-DD-BX-1091"],"award-info":[{"award-number":["BJA-2005-DD-BX-1091"]}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0524695"],"award-info":[{"award-number":["CNS-0524695"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>\n            Several anonymous authentication schemes allow servers to revoke a misbehaving user's ability to make future accesses. Traditionally, these schemes have relied on powerful Trusted Third Parties (TTPs) capable of deanonymizing (or linking) users' connections. Such TTPs are undesirable because users' anonymity is not guaranteed, and users must trust them to judge misbehaviors fairly. Recent schemes such as\n            <jats:italic>Blacklistable Anonymous Credentials (BLAC)<\/jats:italic>\n            and\n            <jats:italic>Enhanced Privacy ID (EPID)<\/jats:italic>\n            support \u201cprivacy-enhanced revocation\u201d\u2014 servers can revoke misbehaving users without a TTP's involvement, and without learning the revoked users' identities.\n          <\/jats:p>\n          <jats:p>\n            In BLAC and EPID, however, the computation required for authentication at the server is\n            <jats:italic>linear in the size (L) of the revocation list<\/jats:italic>\n            , which is impractical as the size approaches thousands of entries. We propose PEREA, a new anonymous authentication scheme for which this bottleneck computation is\n            <jats:italic>independent of the size of the revocation list<\/jats:italic>\n            . Instead, the time complexity of authentication is linear in the size of a\n            <jats:italic>revocation window<\/jats:italic>\n            <jats:italic>K<\/jats:italic>\n            \u226a\n            <jats:italic>L<\/jats:italic>\n            , the number of subsequent authentications before which a user's misbehavior must be recognized if the user is to be revoked. We extend PEREA to support more complex revocation policies that take the\n            <jats:italic>severity<\/jats:italic>\n            of misbehaviors into account. Users can authenticate anonymously if their\n            <jats:italic>naughtiness<\/jats:italic>\n            , i.e., the sum of the severities of their blacklisted misbehaviors, is below a certain naughtiness threshold. We call our extension PEREA-Naughtiness. We prove the security of our constructions, and validate their efficiency as compared to BLAC analytically and quantitatively.\n          <\/jats:p>","DOI":"10.1145\/2043628.2043630","type":"journal-article","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T15:22:22Z","timestamp":1324999342000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["PEREA"],"prefix":"10.1145","volume":"14","author":[{"given":"M. Ho","family":"Au","sequence":"first","affiliation":[{"name":"University of Wollongong, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. P.","family":"Tsang","sequence":"additional","affiliation":[{"name":"Dartmouth College, Hanover, NH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Kapadia","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,12,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.759593"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765278.1765292"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ateniese G.\n     and \n      Tsudik G\n  . \n  1999\n  . Some open issues and new directions in group signatures. In Proceedings of the International Conference on Financial Cryptography. M. K. Franklin Ed. Lecture Notes in Computer Science vol. \n  1648 Springer 196--211.   Ateniese G. and Tsudik G. 1999. Some open issues and new directions in group signatures. In Proceedings of the International Conference on Financial Cryptography. M. K. Franklin Ed. Lecture Notes in Computer Science vol. 1648 Springer 196--211.","DOI":"10.1007\/3-540-48390-X_15"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Annual Cryptology Conference (EUROCRYPT). 480--494","author":"Bari N."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/648184.749735"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Boneh D. Boyen X. and \n      Shacham H\n  . \n  2004\n  . Short group signatures. In Proceedings of the Annual Cryptology Conference (CRYPTO). M. K Franklin Ed. Lecture Notes in Computer Science vol. \n  3152 Springer 41--55.  Boneh D. Boyen X. and Shacham H. 2004. Short group signatures. In Proceedings of the Annual Cryptology Conference (CRYPTO). M. K Franklin Ed. Lecture Notes in Computer Science vol. 3152 Springer 41--55.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756212"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704437"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766811.1766838"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706305"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the Annual Cryptology Conference (CRYPTO). 199--203","author":"Chaum D.","year":"1982"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Annual Cryptology Conference (EUROCRYPT). 257--265","author":"Chaum D."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Cramer R. Damg\n    &angst;rd I. and \n      Schoenmakers B\n  . \n  1994\n  . Proofs of partial knowledge and simplified design of witness hiding protocols. In Proceedings of the Annual Cryptology Conference (CRYPTO). Y Desmedt Ed. Lecture Notes in Computer Science vol. \n  839 Springer 174--187.   Cramer R. Damg&angst;rd I. and Schoenmakers B. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proceedings of the Annual Cryptology Conference (CRYPTO). Y Desmedt Ed. Lecture Notes in Computer Science vol. 839 Springer 174--187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Usenix Security Symposium. 303--320","author":"Dingledine R."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01037-6"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706160"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Henry R. Henry K. and \n      Goldberg I\n  . \n  2010\n  . Making a Nymbler Nymble using VERBS. In Proceedings of the International Symposium on Privacy Enhancing Technologies. M. J. Atallah and N. J. Hopper Eds. Lecture Notes in Computer Science vol. \n  6205 Springer 111--129.   Henry R. Henry K. and Goldberg I. 2010. Making a Nymbler Nymble using VERBS. In Proceedings of the International Symposium on Privacy Enhancing Technologies. M. J. Atallah and N. J. Hopper Eds. Lecture Notes in Computer Science vol. 6205 Springer 111--129.","DOI":"10.1007\/978-3-642-14527-8_7"},{"key":"e_1_2_1_26_1","series-title":"Lecture Notes in Computer Science","volume-title":"Nymble: Anonymous IP-address blocking. In Proceedings of the International Symposium on Privacy Enhancing Technologies","author":"Johnson P. C.","year":"2007"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_34"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866919.1866927"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.705507"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_22"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315256"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455813"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880033"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043628.2043630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2043628.2043630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:19Z","timestamp":1750240459000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2043628.2043630"}},"subtitle":["Practical TTP-free revocation of repeatedly misbehaving anonymous users"],"short-title":[],"issued":{"date-parts":[[2008,12,26]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2043628.2043630"],"URL":"https:\/\/doi.org\/10.1145\/2043628.2043630","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,26]]},"assertion":[{"value":"2010-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}