A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

Ateniese, Giuseppe; Camenisch, Jan; Joye, Marc; Tsudik, Gene

doi:10.1007/3-540-44598-6_16

Cited by 576 publications

(493 citation statements)

References 19 publications

(10 reference statements)

Supporting

Mentioning

484

Contrasting

Unclassified

Order By: Relevance

“…It is easy to see that this ideal model captures the requirements correctness, anonymity, unlinkability, traceability, exculpability/framing, and coalition-resistance of previous models (e.g., [2]), i.e., that the trusted party T ensures them.…”

Section: The Modelmentioning

confidence: 96%

“…In this context, group signatures [2,12,19] are an important building block. They allow a member of some group to sign anonymously on the group's behalf.…”

Section: Introductionmentioning

confidence: 99%

“…To this end we first explain how efficient and provably secure group signature schemes [2,12] are realized. The public key of the group can be viewed as a public key of a suitable signature scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Identity Escrow Scheme with Appointed Verifiers

Camenisch

Lysyanskaya²

2001

Advances in Cryptology — CRYPTO 2001

Self Cite

View full text Add to dashboard Cite

Abstract. An identity escrow scheme allows a member of a group to prove membership in this group without revealing any extra information. At the same time, in case of abuse, his identity can still be discovered. Such a scheme allows anonymous access control. In this paper, we put forward the notion of an identity escrow scheme with appointed verifiers. Such a scheme allows the user to only convince an appointed verifier (or several appointed verifiers) of his membership; but no unauthorized verifier can verify a user's group membership even if the user fully cooperates, unless the user is completely under his control. We provide a formal definition of this new notion and give an efficient construction of an identity escrow scheme with appointed verifiers provably secure under common number-theoretic assumptions in the public-key model.

show abstract

Section: The Modelmentioning

confidence: 96%

“…In this context, group signatures [2,12,19] are an important building block. They allow a member of some group to sign anonymously on the group's behalf.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Identity Escrow Scheme with Appointed Verifiers

Camenisch

Lysyanskaya²

2001

Advances in Cryptology — CRYPTO 2001

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper could also discuss about the basics of Controllable Linkability. A more secure and coalition resistant Group signature scheme was introduced in [11]. This brought the idea of revocable anonymity.…”

Section: Related Workmentioning

confidence: 99%

Maintaining Integrity and Security for the Data Shared in the Cloud

Dili¹,

V.R²

2016

IJIRCCE

View full text Add to dashboard Cite

ABSTRACT:Cloud computing platform provides global sharing and accessing of resources. Cloud offers data storage and sharing facilities that provides better scalability. Apart from the advantages offered by Cloud, it also finds difficulties in maintaining the integrity and security for the shared data. Public auditing is a mechanism by which the integrity of data could be maintained so that the correctness of data could be verified thereafter. Even if the system could assure data correctness, there may be chances of some security threats. Security must be established for the data shared and one who shares it. So, for that a new form of signing method is to be developed for sharing the data to Cloud, which could verify whether the data is shared by an authenticated user or not. In this paper, we discuss about a system that helps to verify the integrity of data and also to make sure that, signatures are made by an authenticated signer.

show abstract

“…However, the model of [BMW03] does not consider the possibility of a (long-lived) group master, which could act as a potential framer. To address this problem and achieve the notion of strong exculpability, introduced in [ACJT00] and formalized in [KY04,BSZ05], one would need an interactive enrollment protocol, call Join, at the end of which only the user himself knows his full private key. We do not further consider exculpability issues in this paper.…”

Section: It Is Noted In [Bmw03] That This Property Implies That Of Exmentioning

confidence: 99%

Compact Group Signatures Without Random Oracles

Boyen¹,

Waters

2006

Advances in Cryptology - EUROCRYPT 2006

184

145

View full text Add to dashboard Cite

Abstract. We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures in bilinear groups with a novel adaptation of the recent Non-Interactive Zero Knowledge proofs of Groth, Ostrovsky, and Sahai. The size of signatures in our scheme is logarithmic in the number of signers; we prove it secure under the Computational Diffie-Hellman and the Subgroup Decision assumptions in the model of Bellare, Micciancio, and Warinshi, as relaxed by Boneh, Boyen, and Shacham.

show abstract

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

Cited by 576 publications

References 19 publications

An Identity Escrow Scheme with Appointed Verifiers

An Identity Escrow Scheme with Appointed Verifiers

Maintaining Integrity and Security for the Data Shared in the Cloud

Compact Group Signatures Without Random Oracles

Contact Info

Product

Resources

About