scholarly journals An Improved Group Signature Scheme with VLR over Lattices

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Yanhua Zhang ◽  
Ximeng Liu ◽  
Yupu Hu ◽  
Huiwen Jia ◽  
Qikun Zhang
Keyword(s):  
Group Size ◽  
Public Key ◽  
Group Signature ◽  
Knowledge Argument ◽  
Signature Scheme ◽  
Zero Knowledge ◽  
Large Group ◽  
Corrected Version ◽  
Group Signatures ◽  
New Construction

For group signatures (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism is the most flexible choice. As a post-quantum secure cryptographic counterpart of classical schemes, the first dynamic GS-VLR scheme over lattices was put forward by Langlois et al. at PKC 2014; furthermore, a corrected version was shown at TCS 2018. However, both designs are within Bonsai trees and featuring bit-sizes of group public-key and member secret signing key proportional to log    N where N is the group size; therefore, both schemes are not suitable for a large group. In this paper, we provide an improved dynamic GS-VLR over lattices, which is efficient by eliminating a O log    N factor for both sizes. To realize the goal, we adopt a more efficient and compact identity-encoding technique. At the heart of our new construction is a new Stern-type statistical zero-knowledge argument of knowledge protocol which may be of some independent cryptographic interest.

scholarly journals An efficient fully dynamic group signature with message dependent opening from lattice

Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Yiru Sun ◽  
Yanyan Liu
Keyword(s):  
Group Size ◽  
Communication Complexity ◽  
Group Signature ◽  
Signature Scheme ◽  
Zero Knowledge ◽  
Dynamic Group ◽  
Logarithmic Relationship ◽  
Better Than

AbstractMessage-dependent opening is one of the solutions to solve the problem of the tracing manager owns excessive power. In this paper, we present a new lattice-based fully dynamic group signature scheme with message-dependent opening by combining an improved version of the fully dynamic group signature scheme proposed by Ling et al and the double encryption paradigm. In addition, we propose an improved underlying zero knowledge protocol, it has a soundness error $\frac {1}{\max (n,p)+1}$ 1 max ( n , p ) + 1 that is better than the Stern-like protocol, which helps to bring down the communication complexity of the protocol and hence the signature scheme. Our scheme constrains the power of group managers by adding an admitter, and the signature size has a logarithmic relationship with the group size.

scholarly journals Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation

Cryptography ◽  
2020 ◽  
Vol 4 (4) ◽  
pp. 33
Author(s):  
Maharage Nisansala Sevwandi Perera ◽  
Takeshi Koshiba
Keyword(s):  
The Other ◽  
Group Signature ◽  
Key Generation ◽  
Signature Scheme ◽  
Zero Knowledge ◽  
Signature Schemes ◽  
Group Signatures ◽  
Desirable Feature ◽  
Group Members ◽  
Security Notion

An efficient member revocation mechanism is a desirable feature when group signature schemes are applied in practical scenarios. Revocation methods, such as verifier-local revocation (VLR), provide an efficient member revocation in applications of group signatures. However, VLR-group signatures rely on a weaker security notion. On the other hand, group signature schemes for static groups gain stronger security with the full-anonymity security notion. Even though an outsider sees the secret signing keys of all group members in the full-anonymity, the signer is still anonymous. Achieving the full-anonymity for VLR group signature schemes is challenging due to the structure of secret signing keys. The secret signing keys of those schemes consist of tokens, which are used to manage revocation. The reveal of tokens may destroy the anonymity of the signers. We obtain stronger security for the lattice-based VLR group signature schemes by providing a new key generation method, which outputs revocation tokens without deriving from the members’ secret signing keys. We propose a new group signature scheme from lattices with VLR, which achieves stronger security than the previous related works. To avoid signature forgeries, we suggest a new zero-knowledge proof system that requires signers to validate themselves. Moreover, we output an efficient tracing mechanism.

scholarly journals A Group Signature Scheme Based on an RSA-Variant

1998 ◽  
Vol 5 (27) ◽  
Author(s):  
Jan Camenisch ◽  
Markus Michels
Keyword(s):  
Public Key ◽  
Group Signature ◽  
Signature Scheme ◽  
Group Signatures ◽  
Large Groups ◽  
Group Member

The concept of group signatures allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator can be revealed by a designated entity. In this paper we propose a new group signature scheme that is well suited for large groups, i.e., the length of the group’s public key and of signatures do not<br />depend on the size of the group. Our scheme is based on a variation of the RSA problem called strong RSA assumption. It is also more efficient than previous ones satisfying these requirements.

Group–Proxy Signature Scheme: A Novel Solution to Electronic Cash

2013 ◽  
Vol 22 (2) ◽  
pp. 95-110 ◽  
Author(s):  
Haiyong Bao ◽  
Zhenfu Cao
Keyword(s):  
Electronic Commerce ◽  
Group Size ◽  
Proxy Signature ◽  
Space Time ◽  
Group Signature ◽  
Signature Scheme ◽  
Electronic Cash ◽  
Cryptographic Primitives ◽  
The Future ◽  
First Time

AbstractProxy signature and group signature are two basic cryptographic primitives. Due to their valuable characteristics, many schemes have been put forward independently and they have been applied in many practical scenarios up to the present. However, with the development of electronic commerce, many special requirements come into being. In this article, we put forward the concept of group–proxy signature, which integrates the merits of proxy signature and group signature for the first time. We also demonstrate how to apply our scheme to construct an electronic cash system. The space, time, and communication complexities of the relevant parameters and processing procedures are independent of group size. Our demonstration of the concrete group–proxy signature scheme shows that the concepts brought forward by us are sure to elicit much consideration in the future.

A Multibank E-Cash System Based on Group Signature Scheme

2013 ◽  
Vol 321-324 ◽  
pp. 2987-2990
Author(s):  
Chun Hong Duo
Keyword(s):  
Blind Signature ◽  
Group Signature ◽  
Signature Scheme ◽  
General Design ◽  
Design Scheme ◽  
Group Signatures ◽  
Group Member

Group signatures allow members of a group to sign messages anonymously on behalf of the group. Only a designated group manager is able to identify the group member who issued a given signature. In this paper we propose a new group signature scheme based on RSA, which is a blind signature algorithm. A multibank E-cash system has been presented based on the proposed scheme. A general design scheme including withdrawal, payment and deposit process is discussed particularly.

scholarly journals Accountable Metadata-Hiding Escrow: A Group Signature Case Study

2015 ◽  
Vol 2015 (2) ◽  
pp. 206-221 ◽  
Author(s):  
Markulf Kohlweiss ◽  
Ian Miers
Keyword(s):  
Third Party ◽  
Group Signature ◽  
Signature Scheme ◽  
New Approach ◽  
Encrypted Data ◽  
Trusted Third Party ◽  
Group Signatures ◽  
Private Data ◽  
Gain Access

Abstract A common approach to demands for lawful access to encrypted data is to allow a trusted third party (TTP) to gain access to private data. However, there is no way to verify that this trust is well placed as the TTP may open all messages indiscriminately. Moreover, existing approaches do not scale well when, in addition to the content of the conversation, one wishes to hide one’s identity. Given the importance of metadata this is a major problem. We propose a new approach in which users can retroactively verify cryptographically whether they were wiretapped. As a case study, we propose a new signature scheme that can act as an accountable replacement for group signatures, accountable forward and backward tracing signatures.

scholarly journals Anr-Hiding Revocable Group Signature Scheme: Group Signatures with the Property of Hiding the Number of Revoked Users

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Keita Emura ◽  
Atsuko Miyaji ◽  
Kazumasa Omote
Keyword(s):  
Negative Information ◽  
Displaced Workers ◽  
Group Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Group Signatures ◽  
A Company ◽  
Security Notion

If there are many displaced workers in a company, then a person who goes for job hunting might not select this company. That is, the number of members who quit is quite negative information. Similarly, in revocable group signature schemes, if one knows (or guesses) the number of revoked users (sayr), then one may guess the reason behind such circumstances, and it may lead to harmful rumors. However, no previous revocation procedure can achieve hidingr. In this paper, we propose the first revocable group signature scheme, whereris kept hidden, which we callr-hiding revocable group signature. To handle this property, we newly define the security notion called anonymity with respect to the revocation which guarantees the unlinkability of revoked users.

scholarly journals Converting pairing-based cryptosystems from composite to prime order setting – A comparative analysis

2018 ◽  
Vol 12 (3) ◽  
pp. 159-190
Author(s):  
Sanjit Chatterjee ◽  
M. Prem Laxman Das ◽  
R. Kabaleeshwaran
Keyword(s):  
Comparative Analysis ◽  
Prime Order ◽  
Homomorphic Encryption ◽  
Blind Signature ◽  
Group Signature ◽  
Encryption Scheme ◽  
Signature Scheme ◽  
Relative Efficacy ◽  
Ring Signature ◽  
Group Signatures

Abstract Composite order pairing setting has been used to achieve cryptographic functionalities beyond what is attainable in prime order groups. However, such pairings are known to be significantly slower than their prime order counterparts. Thus emerged a new line of research – developing frameworks to convert cryptosystems from composite to prime order pairing setting. In this work, we analyse the intricacies of efficient prime order instantiation of cryptosystems that can be converted using existing frameworks. To compare the relative efficacy of these frameworks we mainly focus on some representative schemes: the Boneh–Goh–Nissim (BGN) homomorphic encryption scheme, ring and group signatures as well as a blind signature scheme. Our concrete analyses lead to several interesting observations. We show that even after a considerable amount of research, the projecting framework implicit in the very first work of Groth–Sahai still remains the best choice for instantiating the BGN cryptosystem. Protocols like the ring signature and group signature which use both projecting and cancelling setting in composite order can be most efficiently instantiated in the Freeman prime-order projecting only setting. In contrast, while the Freeman projecting setting is sufficient for the security reduction of the blind signature scheme, the simultaneous projecting and cancelling setting does provide some efficiency advantage.

scholarly journals Almost Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation

2018 ◽  
Author(s):  
Maharage Nisanasla Sevwandi Perera ◽  
Takeshi Koshiba
Keyword(s):  
Efficient Method ◽  
The Other ◽  
Group Signature ◽  
Key Generation ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Group Signatures ◽  
Tracing Algorithm ◽  
Static Group ◽  
Security Notion

Efficient member revocation and strong security against attacks are prominent requirements in group signature schemes. Among the revocation approaches Verifier-local revocation is the most flexible and efficient method since it requires to inform only the verifiers regarding the revoked members. The verifier-local revocation technique uses a token system to manage members&rsquo; status. However, the existing group signature schemes with verifier-local revocability rely on weaker security. On the other hand, existing static group signature schemes rely on a stronger security notion called, full-anonymity. Achieving the full-anonymity for group signature schemes with verifier-local revocation is a quite challenging task. This paper aims to obtain stronger security for the lattice-based group signature schemes with verifier-local revocability, which is closer to the full-anonymity. Moreover, this paper delivers a new key-generation method which outputs revocation tokens without deriving from the users&rsquo; signing keys. By applying the tracing algorithm given in group signature schemes for static groups, this paper also outputs an efficient tracing mechanism. Thus, we deliver a new group signature scheme with verifier-local revocation that satisfies a stronger security from lattices.

Sign in / Sign up

Export Citation Format

Share Document