Short Group Signatures

Boneh, Dan; Boyen, Xavier; Shacham, Hovav

doi:10.1007/978-3-540-28628-8_3

Cited by 1,439 publications

(1,236 citation statements)

References 21 publications

Supporting

Mentioning

1,236

Contrasting

Order By: Relevance

“…This scheme used a registration protocol called JOIN that hides the group member's message. In [12] the authors proposed Short group signatures, which reduced the need for complex calculations for generating lengthy group signatures as in the earlier cases. This satisfies the correctness, full anonymity and full 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

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

show abstract

“…Boneh, Boyen, and Shacham [BBS04] showed how to construct "short" group signatures using bilinear maps under an assumption they introduced called the Strong Diffie-Hellman assumption. Concurrently, Camenish and Lysyanskaya [CL04] gave another group signature scheme that used bilinear maps.…”

Section: Related Workmentioning

confidence: 99%

“…Additionally, efficient constructions are based on strong assumptions ranging from the Strong Diffie-Hellman [BBS04,BS04] and Strong RSA [ACJT00, AST02,CL02] assumptions to the LRSW [CL04,LRSW99] assumption, which itself has the challenger act as an oracle. The first construction proved secure in the standard model is due to Bellare et.…”

Section: Introductionmentioning

confidence: 99%

“…The security of these techniques is proven based on the relatively new subgroup decision problem, which was introduced by Boneh, Goh, and Nissim [BGN05]. However, recent work [GOS06a] has shown that the techniques of Groth, Ostrovsky, and Sahai can be generalized to work only with the decision linear assumption, introduced by Boneh, Boyen, and Shacham [BBS04].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compact Group Signatures Without Random Oracles

Boyen¹,

Waters

2006

Advances in Cryptology - EUROCRYPT 2006

Self Cite

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

“…We have a variant of our proposal that employs the protocol of Boneh et al [2]. This variant will be presented in a forthcoming paper.…”

mentioning

confidence: 99%

A Practical and Secure Coercion-Resistant Scheme for Internet Voting

Araújo

Foulle

Traoré

2010

Towards Trustworthy Elections

View full text Add to dashboard Cite

Abstract. Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show that Smith's scheme is insecure. Then we present a new coercion-resistant election scheme with a linear work factor that overcomes the flaw of Smith's proposal. Our solution is based on the group signature scheme of Camenisch and Lysyanskaya (Crypto 2004).

show abstract

Short Group Signatures

Cited by 1,439 publications

References 21 publications

Maintaining Integrity and Security for the Data Shared in the Cloud

Maintaining Integrity and Security for the Data Shared in the Cloud

Compact Group Signatures Without Random Oracles

A Practical and Secure Coercion-Resistant Scheme for Internet Voting

Contact Info

Product

Resources

About