An<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:math>-Hiding Revocable Group Signature Scheme: Group Signatures with the Property of Hiding the Number of Revoked Users

Emura, Keita; Miyaji, Atsuko; Omote, Kazumasa

doi:10.1155/2014/983040

Cited by 10 publications

(12 citation statements)

References 76 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the rapid development of identity-based cryptography [9,11,28,29,30,44,50], many researchers proposed many identity-based signature (IBS) schemes in the random oracle model or standard model [7,14,31,44]. Also, with these identitybased signature schemes, a lot of variants, such as the identity-based ring signature schemes [4,5,6,54], the identity-based group signature schemes [24,32], etc, have also been proposed. In 2006, Au et al [5] proposed a constant size identity-based linkable and revocable-iff-linked ring signature scheme.…”

Section: Related Workmentioning

confidence: 99%

Efficient traceable ring signature scheme without pairings

Gu¹,

Dong²,

Wang³

2020

Advances in Mathematics of Communications

View full text Add to dashboard Cite

Although currently several traceable (or linkable) ring signature schemes have been proposed, most of them are constructed on pairings. In this paper, we present an efficient traceable ring signature (TRS) scheme without pairings, which is based on the modified EDL signature (first proposed by D.Chaum et al. in Crypto 92). Compared with other ring signature schemes, the proposed scheme does not employ pairing computation and has some computational advantages, whose security can be reduced to the computational Diffie-Hellman (CDH) and decisional Diffie-Hellman (DDH) assumptions in the random oracle model. Also, the proposed scheme is similar to certificateless signature scheme, where user and key generating center make interaction to generate ring key. We give a formal security model for ring signature and prove that the proposed scheme has the properties of traceability and anonymity.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient traceable ring signature scheme without pairings

Gu¹,

Dong²,

Wang³

2020

Advances in Mathematics of Communications

View full text Add to dashboard Cite

show abstract

“…Additionally, many new anonymous signature schemes were also proposed, where the group signature [27][28][29][30][31], ring signature [32][33][34] and attribute-based signature [35][36][37] all belong to anonymous signatures. Libert et al [28] proposed an effective group signature.…”

Section: Related Workmentioning

confidence: 99%

Reusable Mesh Signature Scheme for Protecting Identity Privacy of IoT Devices

Zhang

Lim

et al. 2020

Sensors

View full text Add to dashboard Cite

The development of the Internet of Things (IoT) plays a very important role for processing data at the edge of a network. Therefore, it is very important to protect the privacy of IoT devices when these devices process and transfer data. A mesh signature (MS) is a useful cryptographic tool, which makes a signer sign any message anonymously. As a result, the signer can hide his specific identity information to the mesh signature, namely his identifying information (such as personal public key) may be hidden to a list of tuples that consist of public key and message. Therefore, we propose an improved mesh signature scheme for IoT devices in this paper. The IoT devices seen as the signers may sign their publishing data through our proposed mesh signature scheme, and their specific identities can be hidden to a list of possible signers. Additionally, mesh signature consists of some atomic signatures, where the atomic signatures can be reusable. Therefore, for a large amount of data published by the IoT devices, the atomic signatures on the same data can be reusable so as to decrease the number of signatures generated by the IoT devices in our proposed scheme. Compared with the original mesh signature scheme, the proposed scheme has less computational costs on generating final mesh signature and signature verification. Since atomic signatures are reusable, the proposed scheme has more advantages on generating final mesh signature by reconstructing atomic signatures. Furthermore, according to our experiment, when the proposed scheme generates a mesh signature on 10 MB message, the memory consumption is only about 200 KB. Therefore, it is feasible that the proposed scheme is used to protect the identity privacy of IoT devices.

show abstract

“…• We present a framework for TIBGS and show a detailed security model for TIBGS. Compared with the security models of TIBGS [18,20], we introduce the Libert et al's model [23] to our security model. In our security model, we consider three situations for the security of TIBGS and further strengthen our security model on identity-based cryptography.…”

Section: Our Contributionsmentioning

confidence: 99%

“…Under our security model, the proposed TIBGS scheme is proved to be secure in the standard model, and has a security reduction to the simple standard assumption (computational Diffie-Hellman assumption). • Compared with other revocable identity-based group signature schemes proposed by [18,20], the proposed TIBGS scheme has some advantages (the comparisons of the three schemes are given in Appendix A).…”

Section: Our Contributionsmentioning

confidence: 99%

Traceable Identity-Based Group Signature

Yang

Wang

et al. 2016

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Group signature is a useful cryptographic primitive, which makes every group member sign messages on behalf of a group they belong to. Namely group signature allows that group member anonymously signs any message without revealing his/her specific identity. However, group signature may make the signers abuse their signing rights if there are no measures of keeping them from abusing signing rights in the group signature schemes. So, group manager must be able to trace (or reveal) the identity of the signer by the signature when the result of the signature needs to be arbitrated, and some revoked group members must fully lose their capability of signing a message on behalf of the group they belong to. A practical model meeting the requirement is verifier-local revocation, which supports the revocation of group member. In this model, the verifiers receive the group member revocation messages from the trusted authority when the relevant signatures need to be verified. With the rapid development of identity-based cryptography, several identity-based group signature (IBGS) schemes have been proposed. Compared with group signature based on public key cryptography, IBGS can simplify key management and be used for more applications. Although some identity-based group signature schemes have been proposed, few identity-based group signature schemes are constructed in the standard model and focus on the traceability of signature. In this paper, we present a fully traceable (and verifier-local revocation) identity-based group signature (TIBGS) scheme, which has a security reduction to the computational Diffie-Hellman (CDH) assumption. Also, we give a formal security model for traceable identity-based group signature and prove that the proposed scheme has the properties of traceability and anonymity.

show abstract

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

Cited by 10 publications

References 76 publications

Efficient traceable ring signature scheme without pairings

Efficient traceable ring signature scheme without pairings

Reusable Mesh Signature Scheme for Protecting Identity Privacy of IoT Devices

Traceable Identity-Based Group Signature

Contact Info

Product

Resources

About