Group Signature Scheme Research Articles

Transaction-level Blockchain Rewrites with Revocation and Traceability using Attribute-based Cryptosystems

In this paper, we study efficient and authorized rewriting of transactions already written to a blockchain. Mutable transactions will make a fraction of all blockchain transactions, but will be a necessity to meet the needs of privacy regulations, such as the General Data Protection Regulation (GDPR) . The state-of-the-art rewriting approaches have several shortcomings, such as lack of user anonymity, inefficiency, and absence of revocation mechanisms for entities authorized to mutate transactions. To address this challenge we present \(\mathsf{ReTRACe}\) , an efficient framework for blockchain rewrites. \(\mathsf{ReTRACe}\) is designed by composing a revocable chameleon hash scheme with an ephemeral trapdoor, a revocable fast attribute based encryption scheme, and a dynamic group signature scheme. In this paper, (i) we discuss \(\mathsf{ReTRACe}\) and its constituent primitives in detail, (ii) present security analyses of the primitives, and (iii) present experimental results to demonstrate the scalability of \(\mathsf{ReTRACe}\) .

Lattice-based group signature scheme and its application in IoMT

Lattice-based group signature scheme and its application in IoMT

DGMT: A Fully Dynamic Group Signature From Symmetric-Key Primitives

A group signature scheme allows a user to sign a message anonymously on behalf of a group and provides accountability by using an opening authority who can “open” a signature and reveal the signer’s identity. Group signature schemes have been widely used in privacy-preserving applications, including anonymous attestation and anonymous authentication. Fully dynamic group signature schemes allow new members to join the group and existing members to be revoked if needed. Symmetric-key based group signature schemes are post-quantum group signatures whose security rely on the security of symmetric-key primitives, and cryptographic hash functions. In this paper, we design a symmetric-key based fully dynamic group signature scheme, called DGMT, that redesigns DGM (Buser et al. ESORICS 2019) and removes its two important shortcomings that limit its application in practice: (i) interaction with the group manager for signature verification, and (ii) the need for storing and managing an unacceptably large amount of data by the group manager. We prove security of DGMT (unforgeability, anonymity, and traceability) and give a full implementation of the system. Compared to all known post-quantum group signature schemes with the same security level, DGMT has the shortest signature size. We also analyze DGM signature revocation approach and show that despite its conceptual novelty, it has significant hidden costs that makes it much more costly than using the traditional revocation list approach.

Enable Membership Privacy-Preserving Group Signature Scheme

Enable Membership Privacy-Preserving Group Signature Scheme

A quantum group signature scheme with reusable keys based on four-particle Cluster states

Abstract With the continuous development of quantum technology, researchers are constantly improving the research on quantum signatures. In the public-key cryptosystem, a quantum group signature scheme based on four-particle Cluster states is proposed. In this scheme, the four-particle Cluster states are used as quantum channels. The signer randomly generates his private key according to the public key generated by the group manager, and uses the private key to sign. The verifier uses the public key to verify the signature. The features of the scheme are as follows: the public key and private key can be reused, thus reducing the number of keys that need to be saved by the communication parties; The length of the message to be signed does not need to be the same as the length of the public and private keys, which increases the flexibility of the signature; The random sequence is used in the signature process to ensure the unpredictability of the key, thus improving the security of the scheme; The scheme has unforgeability and non-repudiation.

Blockchain-based privacy-preserving incentive scheme for internet of electric vehicle

Blockchain-based privacy-preserving incentive scheme for internet of electric vehicle

An identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states

With the advancement of the new generation of information technology in recent years, quantum digital signatures have been widely concerned. Among them, quantum threshold group signatures have become a hot research field due to their advantages such as low cost and strong scalability. Therefore, in this paper, we propose an identity-verifiable quantum threshold group signature scheme based on three-particle GHZ states. The characteristics of the scheme are as follows. The signers can reconstruct the key K for signature’s generation and verification by using the Shamir threshold secret sharing scheme. A quantum signature is generated by performing controlled-not operations, von Neumann measurements, and quantum Fourier transform. When the signature is verified, only classical hash values need to be compared, without comparing quantum states. Identity verification is performed between participants by using hash functions. The efficiency of the scheme is improved by using super-dense coding. Security analysis shows that our scheme is unforgeable and undeniable.

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Blockchain-based group signature for secure authentication of IoT systems in smart home environments

ABSTRACT Current solutions that rely on a single-server architecture have privacy, anonymity, integrity, and confidentiality limitations. Blockchain-based solutions can address some of these issues but face challenges regulating behaviour and protecting access policy privacy. This study proposes a new approach to securing a smart home environment to overcome these limitations.The proposed architecture is based on a group signature scheme, which allows multiple IoT devices to securely exchange keys and authenticate each other without needing a central authority. Our experimental results indicate the effectiveness and efficiency of the proposed architecture and provide insights into its security and privacy features compared to existing IoT authentication methods.

A Secure Quantum Proxy Group Signature Scheme Based on Three-qubit Entangled States

A Secure Quantum Proxy Group Signature Scheme Based on Three-qubit Entangled States

Sphinx-in-the-Head: Group Signatures from Symmetric Primitives

Group signatures and their variants have been widely used in privacy-sensitive scenarios such as anonymous authentication and attestation. In this paper, we present a new post-quantum group signature scheme from symmetric primitives. Using only symmetric primitives makes the scheme less prone to unknown attacks than basing the design on newly proposed hard problems whose security is less well-understood. However, symmetric primitives do not have rich algebraic properties, and this makes it extremely challenging to design a group signature scheme on top of them. It is even more challenging if we want a group signature scheme suitable for real-world applications, one that can support large groups and require few trust assumptions. Our scheme is based on MPC-in-the-head non-interactive zero-knowledge proofs, and we specifically design a novel hash-based group credential scheme, which is rooted in the SPHINCS+ signature scheme but with various modifications to make it MPC (multi-party computation) friendly. The security of the scheme has been proved under the fully dynamic group signature model. We provide an implementation of the scheme and demonstrate the feasibility of handling a group size as large as 2 60 . This is the first group signature scheme from symmetric primitives that supports such a large group size and meets all the security requirements.

Efficient code-based fully dynamic group signature scheme

Efficient code-based fully dynamic group signature scheme

Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting

<p style='text-indent:20px;'>Since its introduction by Chaum and Heyst, <i>group signature</i> has been one of the most active areas of cryptographic research with numerous applications to computer security and privacy. Group signature permits the members of a group to sign a document on behalf of the entire group keeping signer's identity secret and enabling disclosure of the signer's identity if required. In this work, we present the first code-based fully-dynamic group signature scheme which allows group members to join or leave the group at any point of time. We employ a code-based updatable <i>Merkle-tree accumulator</i> in our design to achieve logarithmic-size signature and utilize randomized <i>Niederreiter</i> encryption to trace the identity of the signer. More positively, we equipped our scheme with <i>deniability</i> characteristic whereby the tracing authority can furnish evidence showing that a given member is not the signer of a particular signature. Our scheme satisfies the security requirements of <i>anonymity</i>, <i>non-frameability</i>, <i>traceability</i> and <i>tracing-soundness</i> in the random oracle model under the hardness of generic decoding problem. We emphasize that our scheme provides full-dynamicity, features deniability in contrast to the existing code-based group signature schemes and works favourably in terms of signature size, group public key size and secret key size.</p>

Secured tracing for group signatures from attribute‐based encryption

SummaryThis article presents a tracing mechanism for group signatures answering the security threats of malicious authorities and users' forgeries. The proposal weakens the high trust placed on the centralized tracing party in previous group signatures by decentralizing tracing power using a multiple tracer setting and limiting the tracers' access using attribute‐based encryption and the requirement of the group manager's agreement. We allow the group manager to control tracers identifying his group users. Instead of a centralized tracer, our setting has multiple tracers possessing attribute sets. Thus, after getting the group manager's permission, a tracer should satisfy the access policy in a given signature to identify the signer. On the other hand, our group signature scheme decentralizes the tracing key generation and removes the group manager's tracing ability. Thus, it ensures that only the attribute‐satisfying and permitted tracers can identify the signer. Moreover, this article delivers security against malicious users. It presents a verification process of access policy of the signatures to prevent users from utilizing invalid attributes for signing. In addition, the article delivers a collaborative tracing mechanism to satisfy attribute sets that a tracer fails to fulfill alone for identifying a signer. Thus, our tracing mechanism ensures security against malicious authorities and group users in group signatures. The article gives the general construction of the scheme and discusses the security.

A Group Signature Scheme With Selective Linkability and Traceability for Blockchain-Based Data Sharing Systems in E-Health Services

A Group Signature Scheme With Selective Linkability and Traceability for Blockchain-Based Data Sharing Systems in E-Health Services

A distributed cross-chain mechanism based on notary schemes and group signatures

A distributed cross-chain mechanism based on notary schemes and group signatures

A study on dynamic group signature scheme with threshold traceability for blockchain

A study on dynamic group signature scheme with threshold traceability for blockchain

Securing an Authenticated Privacy Preserving Protocol in a Group Signature Scheme Based on a Group Ring

Group signatures are a leading competing signature technique with a substantial amount of research. With group settings, group signatures provide user anonymity. Any group member with access to the group can generate a signature while remaining anonymous. The group manager, however, has the authority to expose and identify the signer if required. Since the privacy of the sender should be preserved, this is a conflict between privacy and accountability. Concerning high performance on security, we propose a novel, well-balanced security and privacy group signature scheme based on a general linear group over group ring. To the best of our knowledge, our work represents the first comprehensive framework for a group signature scheme that utilizes generic linear groups over group rings. We demonstrate that the competing security goals of message trustworthiness, privacy, and accountability are effectively resolved by our protocol. The results of the performance evaluation and simulation demonstrate that our protocol achieves strong security, system robustness, and high-performance efficiency, making it suitable for practical applications.

Efficient Conditional Privacy-Preserving Authentication Scheme for Safety Warning System in Edge-Assisted Internet of Things

With the advent of smart cities, the significance of the Internet of Things (IoT) is gaining greater prominence. At the same time, the safety early warning system in the IoT has a significant impact on real-time monitoring and the response to potential risks. Despite the advancements made in edge-assisted IoT deployments, several challenges and constraints persist. Given the potential threat to life posed by safety-related messages, ensuring the authenticity of messages in the edge-assisted IoT safety warning system is crucial. However, considering the identity privacy of devices participating in the edge-assisted Internet of Things system, directly verifying the identity of the sending device is undesirable. To address this issue, in this work, we design a linkable group signature scheme that allows devices to anonymously send safety-related messages to edge nodes, defending against Sybil attacks while ensuring the traceability of malicious device identities. Then, we present a high-efficiency conditional privacy-preserving authentication (CPPA) scheme based on the designed group signatures for the safety warning system in edge-assisted IoT. This scheme effectively protects device identity privacy while providing a reliable authentication mechanism to ensure the credibility and traceability of alert messages. The proposed scheme contributes to the field of safety warning systems in the context of edge-assisted IoT, providing a robust solution for privacy preservation and authentication.

Post-quantum secure group signature with verifier local revocation and backward unlinkability

Post-quantum secure group signature with verifier local revocation and backward unlinkability