Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings
Anonymous identification schemes in ad-hoc groups are cryptographic primitives that allow a participant from a set of users to prove her identity in that group, without revealing her actual identity or the group secret key. All the existing ad-hoc anonymous identification schemes in the literature make use of the bilinear pairing operation, resulting in a computational overhead. In this paper we propose a novel anonymous identity-based identification scheme for ad-hoc groups without using bilinear pairings. This scheme, to the best of our knowledge, is the first of its kind which does not use pairing operations. The proof of our scheme is based on the hardness assumption of RSA problem.
KeywordsIdentity-based identification Anonymity Ad-hoc group RSA assumption
Unable to display preview. Download preview PDF.
- 2.Fiege, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 210–217. ACM (1987)Google Scholar
- 7.Gu, C., Zhu, Y., Ma, C.: An Efficient Identity Based Anonymous Identification Scheme for Ad-Hoc Groups from Pairings. In: 4th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008, pp. 1–3 (October 2008)Google Scholar
- 12.Coron, J.S.: On the Exact Security of Full Domain Hash (2000)Google Scholar