Group blind digital signatures: A scalable solution to electronic cash

Lysyanskaya, Anna; Ramzan, Zulfikar

doi:10.1007/bfb0055483

Cited by 130 publications

(78 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A-Lysyanskaya, Z. Ramzan in [9] constructs a practical Group Blind Signature Scheme. This scheme is an extension of Group Signature Scheme, proposed in [10] with the addition of blindness property.…”

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

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%

Dynamic Blind Group Digital Signature Schemein E-Banking

Khiyal¹,

Khan²,

Bashir³

et al. 2011

IJCEE

View full text Add to dashboard Cite

show abstract

“…To enforce different privacy levels, various combinations of these wallets' spendings are used in the ACC-payment procedure, where the product value is spent from both wallets; in ACC-loss recovery, where only W p is used; and in ACC-monthly payment calculation, where only W id is used. To get paid, merchants simply deposit the ecash they receive, while blind signature schemes [JLO97,LR98,O06] are used for the different types of market offers.…”

Section: Anonymous Credit Card Systemmentioning

confidence: 99%

An Anonymous Credit Card System

Bellovin

2009

Trust, Privacy and Security in Digital Business

View full text Add to dashboard Cite

Abstract. Credit cards have many important benefits; however, these same benefits often carry with them many privacy concerns. In particular, the need for users to be able to monitor their own transactions, as well as bank's need to justify its payment requests from cardholders, entitle the latter to maintain a detailed log of all transactions its credit card customers were involved in. A bank can thus build a profile of each cardholder even without the latter's consent. In this paper, we present a practical and accountable anonymous credit system based on ecash , with a privacy preserving mechanism for error correction and expense-reporting.

show abstract

“…Like group blind signatures [41], blind ring signatures extend blind signatures to the multi-signer setting. However, in contrast to the former, the latter provide more flexibility in the choice of the group as it is done in an ad hoc manner without requiring prior cooperation or join protocols.…”

Section: Introductionmentioning

confidence: 99%

Sub-linear Blind Ring Signatures without Random Oracles

Ghadafi

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Ring signatures allow a signer to anonymously sign a message on behalf of a set of arbitrarily chosen signers called a "ring". Blind signatures, on the other hand, allow a user to obtain a signature on a message while maintaining the privacy of the message. Blind ring signatures combine properties of both primitives and hence provide a strong notion of anonymity where the privacy of both the identity of the signer and the message is preserved. Blind ring signatures find applications in various systems; including multiauthority e-voting and distributed e-cash systems. In this paper we provide the first provably secure blind ring signature construction that does not rely on random oracles, which solves an open problem raised by Herranz and Laguillaumie at ISC 2006. We present different instantiations all of which are round-optimal (i.e. have a two-move signing protocol), yield sub-linear size signatures, and meet strong security requirements. In order to realize our constructions efficiently, we construct a sub-linear size set membership proof which works in the different bilinear group settings, which may be of independent interest. As a secondary contribution, we show how to generically combine our set membership proof with any secure signature scheme meeting some conditions to obtain ring signatures whose security does not rely on random oracles. All our constructions work over the efficient prime-order bilinear group setting and yield signatures of sub-linear size. In addition, our constructions meet strong security requirements: namely, anonymity holds under full key exposure and unforgeability holds against insider-corruption. Finally, we provide some example instantiations of the generic construction.

show abstract

Group blind digital signatures: A scalable solution to electronic cash

Cited by 130 publications

References 17 publications

Dynamic Blind Group Digital Signature Schemein E-Banking

Dynamic Blind Group Digital Signature Schemein E-Banking

An Anonymous Credit Card System

Sub-linear Blind Ring Signatures without Random Oracles

Contact Info

Product

Resources

About