Constant-size Signature Research Articles

A dynamic constant size attribute-based group signature scheme with attribute anonymity

Attribute-based group signature (ABGS) scheme is a kind of group signature scheme where the group members possessing certain privileges (attributes) only are eligible for signing the document. There is no ABGS scheme which provides efficient way to preserveattribute anonymity with constant size signature. We have come up with an ABGS scheme which achieves the same and proven that it is secure under random oracle model with DL,q-SDH, DLDH and XDH assumptions. We have also given the revocation mechanism to revoke multiple group members at any time.

Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction

In this paper, we propose a new ID-based event-oriented linkable ring signature scheme, with an option as revocable-iff-linked. With this option, if a user generates two linkable ring signatures in the same event, everyone can compute his identity from these two signatures. We are the first in the literature to propose such a secure construction in an ID-based setting. Even compared with other existing non ID-based schemes, we enjoy significant efficiency improvement, including constant signature size and linking complexity.Our scheme can be also regarded as a normal ID-based ring signature. We are also the first to propose such a scheme with constant signature size and enhanced privacy, namely the signer is anonymous even to the PKG who has the master secret key.We prove the security of our scheme in the random oracle model, using DL, DDL and q-SDH assumptions.

Attribute-based signature scheme with constant size signature in the standard model

In this study, the authors propose a new efficient attribute-based signature (ABS) scheme. This scheme achieves existential unforgeability against selective predicate attack and attributes signer privacy in the standard model. The signature scheme only needs three pairing operations, and the signature size is constant, regardless of the number of attributes. Compared with other existing schemes, this construction provides better efficiency in terms of the computational cost and communication cost. To the best of author's knowledge, this is the first ABS scheme that can achieve constant signature size and constant number of pairing operations. In addition, after the analysis of Wang and Chen's attribute-based ring signature scheme, the authors show that their scheme is incorrect.

Identity-Based Ring Signature Scheme with Constant Size Signatures in the Standard Model

Aiming at the efficiency and security weaknesses that exist in the identity-based ring signature schemes,using the method of bilinear pairing,this paper propose a new construction of identity-based ring signature scheme.This scheme is existentially unforgeable against adaptive chosen message attacks in the standard model,and can achieve unconditional anonymity.The new scheme,with constant size signatures,only needs three pairing operations.Compared with other existing schemes,this construction can provide better efficiency in terms of the communication cost and computation cost as well as the security guarantee,thus it can more satisfy the application requirements.

ID-Based Deniable Ring Signature with Constant-Size Signature

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.

Attribute-based ring signature scheme with constant-size signature

An attribute-based ring signature scheme with constant size and constant number of pairings computation is proposed. The signer signs messages by using a subset of its attributes. All the users who possess the subset of these attributes form a ring. It requires that anyone cannot tell who generates the signature in this ring. Furthermore, anyone out of this ring could not forge the signature on behalf of the ring. It is proved to be unforgeable in the standard model and unconditionally anonymous. To the best of the authors' knowledge, such a construction is introduced for the first time.

ID-based deniable ring authentication with constant-size signature

Deniable ring authentication allows a member of an ad-hoc sunset of participants to authenticate a message without revealing which member has issued the signature, and the verifier cannot transfer the signature to any third party. It is an important cryptographic primitive for privacy and anonymous communication. Unfortunately, the size of the signature of the proposed deniable ring authentication is dependent on the size of the ring. It is inefficient especially when the size of the ring is large. In this paper, we propose an ID-based version of deniable ring authentication. We present a generic construction which uses dynamic accumulators to construct ID-based deniable ring authentication with constant-size signature. We also give an ID-based deniable ring authentication based on bilinear pairings, which is proved to be secure in the random oracle model.

Identity-based universal designated multi-verifiers signature schemes

An identity-based (ID-based) universal designated verifier signature (ID-UDVS) scheme allows a signature holder to designate a specific verifier of the signature by using a simplified public identity such as e-mail address. In the paper, we present an efficient identity-based universal designated multi-verifiers signature (ID-UDMVS) scheme by extending a single verifier to a set of multi-verifiers for verification of a signature. To achieve our goal, we construct an ID-based signature scheme providing batch verification and then, using this scheme as a building block, we firstly propose an ID-UDMVS scheme with constant signature size. Interestingly our construction method can be used as a generic method transforming an ID-UDVS scheme, which is defined in a bilinear version of the so-called ∑ protocol, to an ID-UDMVS scheme.