Secure Scalable Group Signature with Dynamic Joins and Separable Authorities

Aggelos Kiayias, Moti Yung

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)24-45
Number of pages22
Journal International Journal of Security and Networks
Volume1
Issue number1/2
DOIs
Publication statusPublished - 1 Sep 2006

Keywords

  • Strong45
  • RSA, adversarial joins, anonymity, cryptographic design, digital signatures, dynamic joins, group signatures, networks, privacy, security, separable authorities

Fingerprint Dive into the research topics of 'Secure Scalable Group Signature with Dynamic Joins and Separable Authorities'. Together they form a unique fingerprint.

Cite this