@conference {clonewars,
	title = {How to win the clonewars: efficient periodic n-times anonymous authentication},
	booktitle = {Proceedings of the 13th ACM conference on Computer and communications security (CCS 2006)},
	year = {2006},
	pages = {201{\textendash}210},
	publisher = {ACM Press},
	organization = {ACM Press},
	address = {New York, NY, USA},
	abstract = {We create a credential system that lets a user anonymously authenticate at most $n$ times in a single time period. A user withdraws a dispenser of n e-tokens. She shows an e-token to a verifier to authenticate herself; each e-token can be used only once, however, the dispenser automatically refreshes every time period. The only prior solution to this problem, due to Damg{\r a}rd et al. [29], uses protocols that are a factor of k slower for the user and verifier, where k is the security parameter. Damg{\r a}rd et al. also only support one authentication per time period, while we support n. Because our construction is based on e-cash, we can use existing techniques to identify a cheating user, trace all of her e-tokens, and revoke her dispensers. We also offer a new anonymity service: glitch protection for basically honest users who (occasionally) reuse e-tokens. The verifier can always recognize a reused e-token; however, we preserve the anonymity of users who do not reuse e-tokens too often.
},
	keywords = {clone detection, credentials, n-anonymous authentication},
	isbn = {1-59593-518-5},
	doi = {10.1145/1180405.1180431},
	url = {http://portal.acm.org/citation.cfm?id=1180431},
	author = {Jan Camenisch and Susan Hohenberger and Markulf Kohlweiss and Anna Lysyanskaya and Mira Meyerovich}
}

{"_id":"CWNXNyPiidPXbN3yd","bibbaseid":"camenisch-hohenberger-kohlweiss-lysyanskaya-meyerovich-howtowintheclonewarsefficientperiodicntimesanonymousauthentication-2006","downloads":0,"creationDate":"2018-07-03T04:50:28.386Z","title":"How to win the clonewars: efficient periodic n-times anonymous authentication","author_short":["Camenisch, J.","Hohenberger, S.","Kohlweiss, M.","Lysyanskaya, A.","Meyerovich, M."],"year":2006,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"How to win the clonewars: efficient periodic n-times anonymous authentication","booktitle":"Proceedings of the 13th ACM conference on Computer and communications security (CCS 2006)","year":"2006","pages":"201\\textendash210","publisher":"ACM Press","organization":"ACM Press","address":"New York, NY, USA","abstract":"We create a credential system that lets a user anonymously authenticate at most $n$ times in a single time period. A user withdraws a dispenser of n e-tokens. She shows an e-token to a verifier to authenticate herself; each e-token can be used only once, however, the dispenser automatically refreshes every time period. The only prior solution to this problem, due to Damg ̊ard et al. [29], uses protocols that are a factor of k slower for the user and verifier, where k is the security parameter. Damg ̊ard et al. also only support one authentication per time period, while we support n. Because our construction is based on e-cash, we can use existing techniques to identify a cheating user, trace all of her e-tokens, and revoke her dispensers. We also offer a new anonymity service: glitch protection for basically honest users who (occasionally) reuse e-tokens. The verifier can always recognize a reused e-token; however, we preserve the anonymity of users who do not reuse e-tokens too often. ","keywords":"clone detection, credentials, n-anonymous authentication","isbn":"1-59593-518-5","doi":"10.1145/1180405.1180431","url":"http://portal.acm.org/citation.cfm?id=1180431","author":[{"firstnames":["Jan"],"propositions":[],"lastnames":["Camenisch"],"suffixes":[]},{"firstnames":["Susan"],"propositions":[],"lastnames":["Hohenberger"],"suffixes":[]},{"firstnames":["Markulf"],"propositions":[],"lastnames":["Kohlweiss"],"suffixes":[]},{"firstnames":["Anna"],"propositions":[],"lastnames":["Lysyanskaya"],"suffixes":[]},{"firstnames":["Mira"],"propositions":[],"lastnames":["Meyerovich"],"suffixes":[]}],"bibtex":"@conference {clonewars,\n\ttitle = {How to win the clonewars: efficient periodic n-times anonymous authentication},\n\tbooktitle = {Proceedings of the 13th ACM conference on Computer and communications security (CCS 2006)},\n\tyear = {2006},\n\tpages = {201{\\textendash}210},\n\tpublisher = {ACM Press},\n\torganization = {ACM Press},\n\taddress = {New York, NY, USA},\n\tabstract = {We create a credential system that lets a user anonymously authenticate at most $n$ times in a single time period. A user withdraws a dispenser of n e-tokens. She shows an e-token to a verifier to authenticate herself; each e-token can be used only once, however, the dispenser automatically refreshes every time period. The only prior solution to this problem, due to Damg{\\r a}rd et al. [29], uses protocols that are a factor of k slower for the user and verifier, where k is the security parameter. Damg{\\r a}rd et al. also only support one authentication per time period, while we support n. Because our construction is based on e-cash, we can use existing techniques to identify a cheating user, trace all of her e-tokens, and revoke her dispensers. We also offer a new anonymity service: glitch protection for basically honest users who (occasionally) reuse e-tokens. The verifier can always recognize a reused e-token; however, we preserve the anonymity of users who do not reuse e-tokens too often.\r\n},\n\tkeywords = {clone detection, credentials, n-anonymous authentication},\n\tisbn = {1-59593-518-5},\n\tdoi = {10.1145/1180405.1180431},\n\turl = {http://portal.acm.org/citation.cfm?id=1180431},\n\tauthor = {Jan Camenisch and Susan Hohenberger and Markulf Kohlweiss and Anna Lysyanskaya and Mira Meyerovich}\n}\n","author_short":["Camenisch, J.","Hohenberger, S.","Kohlweiss, M.","Lysyanskaya, A.","Meyerovich, M."],"key":"clonewars","id":"clonewars","bibbaseid":"camenisch-hohenberger-kohlweiss-lysyanskaya-meyerovich-howtowintheclonewarsefficientperiodicntimesanonymousauthentication-2006","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1180431"},"keyword":["clone detection","credentials","n-anonymous authentication"],"downloads":0},"search_terms":["win","clonewars","efficient","periodic","times","anonymous","authentication","camenisch","hohenberger","kohlweiss","lysyanskaya","meyerovich"],"keywords":["clone detection","credentials","n-anonymous authentication"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}