Article

Dynamic k-times anonymous authentication

Authors:

Rei Safavi-NainiAuthors Info & Claims

ACNS'05: Proceedings of the Third international conference on Applied Cryptography and Network Security

Pages 318 - 333

https://doi.org/10.1007/11496137_22

Published: 07 June 2005 Publication History

Abstract

k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has application in e-voting, e-cash, electronic coupons and anonymous trial browsing of content. In this paper, we extend k-TAA model to dynamick-TAA in which application providers can independently grant or revoke users from their own groups and so have the required control on their clients. We give a formal model for dynamic k-TAA, propose a dynamic k-times anonymous authentication scheme from bilinear pairing, and prove its security. We also construct an ordinary k-TAA from the dynamic scheme and show communication efficiency of the schemes compared to the previously proposed schemes.

References

[1]

G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. CRYPTO 2000, Springer-Verlag, LNCS 1880, pp. 255-270.

Digital Library

[2]

M. Bellare, H. Shi, and C. Zhang. Foundations of Group Signatures: The Case of Dynamic Groups. Cryptology ePrint Archive: Report 2004/077.

[3]

D. Boneh, and X. Boyen. Short Signatures Without Random Oracles. EUROCRYPT 2004, Springer-Verlag, LNCS 3027, pp. 56-73.

[4]

D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. ASIACRYPT 2001, Springer-Verlag, LNCS 2248, pp. 514-532.

Digital Library

[5]

S. Brands. An Efficient Off-line Electronic Cash System Based On The Representation Problem. Technical Report CS-R9323, Centrum voor Wiskunde en Informatica.

Digital Library

[6]

J. Camenisch, and A. Lysyanskaya. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. CRYPTO 2002, Springer-Verlag, LNCS 2442, pp. 61-76.

Digital Library

[7]

D. Chaum. Blind signature system. CRYPTO 1983, Plenum Press, pp. 153-153.

[8]

A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. CRYPTO 1986, Springer-Verlag, LNCS 263, pp. 186-194.

Digital Library

[9]

R. Granger, D. Page, and M. Stam. A Comparison of CEILIDH and XTR. Algorithmic Number Theory, 6th International Symposium, ANTS-VI, pages 235-249. Springer, June 2004.

[10]

S. Mitsunari, R. Sakai, and M. Kasahara. A new traitor tracing. IEICE Trans. Vol. E85-A, No.2, pp.481-484, 2002. {29}

[11]

T. Nakanishi, N. Haruna, and Y. Sugiyama. Unlinkable Electronic Coupon Protocol with Anonymity Control. ISW 1999, Springer-Verlag, LNCS 1729, pp. 37-46.

Digital Library

[12]

L. Nguyen. Accumulators from Bilinear Pairings and Applications. RSA Conference 2005, Cryptographers' Track (CT-RSA), Springer-Verlag, LNCS 3376, pp. 275-292, 2005.

Digital Library

[13]

L. Nguyen and R. Safavi-Naini. Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings. ASIACRYPT 2004, Springer-Verlag, LNCS 3329, pp. 372-386, 2004.

[14]

L. Nguyen and R. Safavi-Naini. Dynamic k-Times Anonymous Authentication. Full version.

[15]

I. Teranisi, J. Furukawa, and K. Sako. k-Times Anonymous Authentication. ASIACRYPT 2004, Springer-Verlag, LNCS 3329, pp. 308-322, 2004.

Cited By

Zhang WYang WChen CLi NBao ZLuo M(2022)Toward Privacy-Preserving Blockchain-Based Electricity Auction for V2G Networks in the Smart GridSecurity and Communication Networks10.1155/2022/69114632022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/6911463
Damgård IGanesh CKhoshakhlagh HOrlandi CSiniscalchi L(2021)Balancing Privacy and Accountability in Blockchain Identity ManagementTopics in Cryptology – CT-RSA 202110.1007/978-3-030-75539-3_23(552-576)Online publication date: 17-May-2021
https://dl.acm.org/doi/10.1007/978-3-030-75539-3_23
Han JChen LSchneider STreharne HWesemeyer S(2018)Anonymous Single-Sign-On for n Designated Services with TraceabilityComputer Security10.1007/978-3-319-99073-6_23(470-490)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-319-99073-6_23
Show More Cited By

Recommendations

Efficient dynamic k-times anonymous authentication
VIETCRYPT'06: Proceedings of the First international conference on Cryptology in Vietnam

In k-times anonymous authentication (k-TAA) schemes, members of a group can be anonymously authenticated to access applications for a bounded number of times determined by application providers. Dynamick-TAA allows application providers to independently ...
Practical Anonymous Password Authentication and TLS with Anonymous Client Authentication
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Anonymous authentication allows one to authenticate herself without revealing her identity, and becomes an important technique for constructing privacy-preserving Internet connections. Anonymous password authentication is highly desirable as it enables ...
k-times anonymous authentication with a constant proving cost
PKC'06: Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

ACNS'05: Proceedings of the Third international conference on Applied Cryptography and Network Security

June 2005

528 pages

ISBN:3540262237

Editors:
John Ioannidis
AT&T Labs - Research
,
Angelos Keromytis
Computer Science Department, Columbia University
,
Moti Yung
Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, New York, NY

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 June 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang WYang WChen CLi NBao ZLuo M(2022)Toward Privacy-Preserving Blockchain-Based Electricity Auction for V2G Networks in the Smart GridSecurity and Communication Networks10.1155/2022/69114632022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/6911463
Damgård IGanesh CKhoshakhlagh HOrlandi CSiniscalchi L(2021)Balancing Privacy and Accountability in Blockchain Identity ManagementTopics in Cryptology – CT-RSA 202110.1007/978-3-030-75539-3_23(552-576)Online publication date: 17-May-2021
https://dl.acm.org/doi/10.1007/978-3-030-75539-3_23
Han JChen LSchneider STreharne HWesemeyer S(2018)Anonymous Single-Sign-On for n Designated Services with TraceabilityComputer Security10.1007/978-3-319-99073-6_23(470-490)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-319-99073-6_23
Tian YLi YSengupta BDeng RChing ALiu W(2018)Privacy-Preserving Remote User Authentication with k-Times Untraceability Information Security and Cryptology10.1007/978-3-030-14234-6_36(647-657)Online publication date: 14-Dec-2018
https://dl.acm.org/doi/10.1007/978-3-030-14234-6_36
Xu LShah NChen LDiallo NGao ZLu YShi WLokam SRuj SSakurai K(2017)Enabling the Sharing EconomyProceedings of the ACM Workshop on Blockchain, Cryptocurrencies and Contracts10.1145/3055518.3055527(15-21)Online publication date: 2-Apr-2017
https://dl.acm.org/doi/10.1145/3055518.3055527
Xu LChen LShah NGao ZLu YShi WBarrett RCummings RAgichtein EGabrilovich E(2017)DL-BACProceedings of the 26th International Conference on World Wide Web Companion10.1145/3041021.3053897(1445-1450)Online publication date: 3-Apr-2017
https://dl.acm.org/doi/10.1145/3041021.3053897
Zhou JSun LSong MSong J(2017)Anonymous Limited-Use-Proof Entity Authentication ProtocolWireless Personal Communications: An International Journal10.1007/s11277-017-4221-496:1(1065-1082)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s11277-017-4221-4
Liu YLing JWu QQin B(2016)Scalable privacy-enhanced traffic monitoring in vehicular ad hoc networksSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-015-1737-y20:8(3335-3346)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s00500-015-1737-y
Wachsmann CChen LDietrich KLöhr HSadeghi AWinter J(2010)Lightweight anonymous authentication with TLS and DAA for embedded mobile devicesProceedings of the 13th international conference on Information security10.5555/1949317.1949328(84-98)Online publication date: 25-Oct-2010
https://dl.acm.org/doi/10.5555/1949317.1949328
Cesena ELöhr HRamunno GSadeghi AVernizzi D(2010)Anonymous authentication with TLS and DAAProceedings of the 3rd international conference on Trust and trustworthy computing10.5555/1875652.1875657(47-62)Online publication date: 21-Jun-2010
https://dl.acm.org/doi/10.5555/1875652.1875657
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents