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. © 2013 Springer-Verlag.