Title: Secure scalable group signature with dynamic joins and separable authorities

Authors: Aggelos Kiayias, Moti Yung

Addresses: Computer Science and Engineering, University of Connecticut, Storrs, CT, USA. ' RSA Laboratories, Bedford, MA, USA; Department of Computer Science, Columbia University, New York, NY, USA

Abstract: To date, a group signature construction that is efficient, scalable, allows dynamic adversarial joins, and proven secure in a formal model has not been suggested. In this work we give the first such construction in the random oracle model. The demonstration of an efficient construction proven secure in a formal model that captures all intuitive security properties of a certain primitive is a basic goal in cryptographic design. To this end we adapt a formal model for group signatures capturing all the basic requirements that have been identified as desirable in the area and we construct an efficient scheme and prove its security. Our construction is based on the Strong-RSA assumption (as in the work of Ateniese et al.). In our system, due to the requirements of provable security in a formal model, we give novel constructions as well as innovative extensions of the underlying mathematical requirements and properties.

Keywords: digital signatures; anonymity; privacy; group signatures; Strong-RSA; security; dynamic joins; adversarial joins; separable authorities; cryptographic design; networks.

DOI: 10.1504/IJSN.2006.010821

International Journal of Security and Networks, 2006 Vol.1 No.1/2, pp.24 - 45

Published online: 06 Sep 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article