Efficient group signature schemes for large groups

Camenisch, Jan; Stadler, M.

doi:10.1007/bfb0052252

Cited by 789 publications

(634 citation statements)

References 22 publications

Supporting

Mentioning

610

Contrasting

Unclassified

Order By: Relevance

“…This scheme is an extension of Group Signature Scheme, proposed in [10] with the addition of blindness property. This construct shows electronic cash system in which multiple banks can securely distributes anonymous and untraceable e-cash.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Blind Group Digital Signature Schemein E-Banking

Khiyal¹,

Khan²,

Bashir³

et al. 2011

IJCEE

View full text Add to dashboard Cite

Abstract---This paper describes the signature scheme in which an individual can sign a document or messages on behalf of entire group. Here, a dynamic group blind signature scheme has been proposed, which is an extension of [L n R] and [B] Group Blind signature scheme. Proposed blind signature scheme has two separate authorities; an issuer, for issuing the membership certificate to group members and an opener, who can open the identity of a signature's originator in the case of a dispute. This scheme is based on the concept of PKI (public key infrastructure) environment and three key requirements i.e., Traceability, Anonymity and NonFrameability. The problem of revocation of identity in group signatures has also solved in this paper. Before that many constructions have been proposed, however, a recurrent problem concerning with the revocation of group members, remained the same. Therefore, an efficient revocation algorithm is used to revoke the members and prevent frauds at the time of signing a document in future. Also the security of group keys is the major concern of this research.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Another scheme proposed in [12] is as competent to the scheme proposed by Camensich and Stadler [10], where all the operations, except open, take constant time. The open protocol time is directly proportional to the size of the group.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Blind Group Digital Signature Schemein E-Banking

Khiyal¹,

Khan²,

Bashir³

et al. 2011

IJCEE

View full text Add to dashboard Cite

show abstract

“…We use notation introduced by Camenisch and Stadler [12] for the various proofs of knowledge of discrete logarithms and proofs of the validity of statements about discrete logarithms. For instance,…”

Section: Proof Protocols and Corresponding Notationmentioning

confidence: 99%

“…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

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

Introduction and Survey

Jaenicke

2001

Dynamics and Chemistry of Hydrometeors

View full text Add to dashboard Cite

This report is in two parts. In the first part I talk about Trusted Computing, while in the second part the focus is on pseudonymity.In today's world, security is of primary concern. Data of ever increasing value is being created and stored on PC's. At the same time, more and more vulnerabilities are being found in existing software . Till now, the main focus of security has been servers and networks, while clients have remained relatively unprotected. Also, most of the mechanisms in place for client security are software based. It is increasingly being felt that client security should be given much more importance and that a purely software based mechanism is inadequate in providing the required level of security. It was with this in mind that people and organizations started exploring the idea of security through hardware enhancements and a whole new paradigm of Trusted Computing was born. The idea was to come up with appropriate hardware modifications that would help in providing security against software attacks on clients. Here, I will present the suggested enhancements and look at the proposed security mechanism. This technology is no longer on paper and companies such as Intel, IBM etc. have started selling PC's with some of the required enhancements.An important component of Trusted Computing is Attestation. This is the ability of a system to prove its security properties to a remote system. However, this immediately raises questions of privacy. Although we want to prove our credentials to a remote host, we do not want it to know any other identifying information about us. This leads us to the more general problem of protecting user privacy. Users want the ability to control the information that others know about them and also to be able to monitor and control its use. Currently, the way computers are used to carry out transactions, user privacy is being compromised since organisations and other users get to know much more information than what is necessary. We need anonymity in transactions. At the same time, we want to safeguard against malicious users who try to exploit the system. In this report, I will present a simple anonymous credential system proposed by Chaum [1]. A credential system is a system in which users can obtain credentials from some organizations and demonstrate their possession. It is said to be anonymous when no one (apart from maybe a few trusted third parties) can say whether two transactions are being carried out by the same user. I will conclude by presenting the basic mathematics underlying the anonymous credential system proposed by Camenisch and Lysyanskaya [2] that is actually used in the above security framework (Trusted Computing) for achieving anonymous attestation.

show abstract

Efficient group signature schemes for large groups

Cited by 789 publications

References 22 publications

Dynamic Blind Group Digital Signature Schemein E-Banking

Dynamic Blind Group Digital Signature Schemein E-Banking

An Identity Escrow Scheme with Appointed Verifiers

Introduction and Survey

Contact Info

Product

Resources

About