Probably Secure Efficient Anonymous Credential Scheme

This article describes how after the concept of anonymous credential systems was introduced in 1985, a number of similar systems have been proposed. However, these systems use zero-knowledge protocols to authenticate users, resulting in inefficient authentication during the stage of proving credential possession. To overcome this drawback, this article presents a signature scheme that uses partially blind signatures and chameleon hash functions such that both the prover and verifier achieve efficient authentication. In addition to providing a computational cost comparison table showing that the proposed signature scheme achieves a more efficient credential possession proving compared to other schemes, concrete security proofs are provided under a random oracle model to demonstrate that the proposed scheme satisfies the properties of anonymous credentials.

[1]  Chanathip Namprempre,et al.  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.

[2]  Khalid Alnafjan,et al.  Empirical Study for Semantic Annotation of Web Services , 2014, Int. J. Networked Distributed Comput..

[3]  Jan Camenisch,et al.  A Signature Scheme with Efficient Protocols , 2002, SCN.

[4]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[5]  David Chaum,et al.  A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations , 1986, CRYPTO.

[6]  Rei-Heng Cheng,et al.  Enhancing Network Availability by Tolerance Control in Multi-Sink Wireless Sensor Network , 2010, 2010 2nd International Conference on Information Technology Convergence and Services.

[7]  Sean W. Smith,et al.  Blacklistable anonymous credentials: blocking misbehaving users without ttps , 2007, CCS '07.

[8]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[9]  Mohammed Alodib.  Towards a Monitoring Framework for the Automatic Integration of the Access Control Policies for Web Services , 2015, Int. J. Networked Distributed Comput..

[10]  R. B. Patel,et al.  Multi-hop communication routing (MCR) protocol for heterogeneous wireless sensor networks , 2011, Int. J. Inf. Technol. Commun. Convergence.

[11]  Yael Tauman Kalai,et al.  Improved Online/Offline Signature Schemes , 2001, CRYPTO.

[12]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[13]  Yuguang Fang,et al.  Securing Mobile Ad Hoc Networks with Certificateless Public Keys , 2006, IEEE Transactions on Dependable and Secure Computing.

[14]  Tianhan Gao,et al.  Random oracle-based anonymous credential system for efficient attributes proof on smart devices , 2016, Soft Comput..

[15]  A. Pfitzmann,et al.  A terminology for talking about privacy by data minimization: Anonymity, Unlinkability, Undetectability, Unobservability, Pseudonymity, and Identity Management , 2010 .

[16]  M. Scott.  Implementing cryptographic pairings , 2007 .

[17]  Amit Sahai,et al.  Pseudonym Systems , 1999, Selected Areas in Cryptography.

[18]  Jacques Stern,et al.  Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.

[19]  Ivan Damgård,et al.  Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals , 1988, CRYPTO.

[20]  Tatsuaki Okamoto,et al.  An Efficient Anonymous Credential System , 2008, Financial Cryptography.

[21]  Stefan A. Brands,et al.  Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy , 2000 .

[22]  Jacques Stern,et al.  Security Proofs for Signature Schemes , 1996, EUROCRYPT.

[23]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[24]  Jan Camenisch,et al.  Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.

[25]  Lidong Chen.  Access with Pseudonyms , 1995, Cryptography: Policy and Algorithms.

[26]  Yi Mu,et al.  Efficient Generic On-Line/Off-Line Signatures Without Key Exposure , 2007, ACNS.

[27]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .