Foundations of Group Signatures: The Case of Dynamic Groups

Bellare, Mihir; Shi, Haixia; Zhang, Chong

doi:10.1007/978-3-540-30574-3_11

Cited by 382 publications

(505 citation statements)

References 19 publications

Supporting

Mentioning

500

Contrasting

Unclassified

Order By: Relevance

“…Here the coalition resistance is the following property: an adversary, not colluding with the GM, cannot obtain a member public key/private key pair not generated in the joining protocols with the GM. It is well known that a secure group signature scheme satisfies the coalition resistance property [BMW03,BSZ05]. Hence, the Furukawa-Imai scheme (and therefore our first scheme) satisfies this property.…”

Section: Sketch Of the Security Proofmentioning

confidence: 80%

k-Times Anonymous Authentication with a Constant Proving Cost

Teranishi¹,

Sako²

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require both users and verifiers to compute O(k) exponentiation in each authentication. We propose a k-TAA scheme where the numbers of exponentiations required for the entities in an authentication are independent of k. Moreover, we propose a notion of public detectability in a k-TAA scheme and present an efficient publicly verifiable k-TAA scheme, where the number of modular exponentiations required for the entities is O(log(k)).

show abstract

Section: Sketch Of the Security Proofmentioning

confidence: 80%

k-Times Anonymous Authentication with a Constant Proving Cost

Teranishi¹,

Sako²

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This satisfies the correctness, full anonymity and full traceability. Later, a group signature scheme for groups with dynamic membership got developed in [13].This paper also discuss about strong formal definitions of security and construction, proven secure under general assumptions. This paper also discuss about different trust levels and the identity privacy of signers and also about traceability.…”

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

Foundations of Group Signatures: The Case of Dynamic Groups

Cited by 382 publications

References 19 publications

k-Times Anonymous Authentication with a Constant Proving Cost

k-Times Anonymous Authentication with a Constant Proving Cost

Maintaining Integrity and Security for the Data Shared in the Cloud

Compact Group Signatures Without Random Oracles

Contact Info

Product

Resources

About