An attack on a signature scheme proposed by Okamoto and Shiraishi
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge proofs of identity
Journal of Cryptology
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Untraceable off-line cash in wallet with observers
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
How to Guess l-th Roots Modulo n by Reducing Lattice Bases
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Computation of Approximate L-th Roots Modulo n and Application to Cryptography
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Undeniable Signatures
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Group Signature Scheme with Improved Efficiency
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
How to Convert any Digital Signature Scheme into a Group Signature Scheme
Proceedings of the 5th International Workshop on Security Protocols
How (not) to Design RSA Signature Schemes
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
FC '98 Proceedings of the Second International Conference on Financial Cryptography
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
Efficient and generalized group signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Selective forgery of RSA signatures using redundancy
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Attacks Based on Small Factors in Various Group Structures
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Co-operatively Formed Group Signatures
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Fair Electronic Cash Based on a Group Signature Scheme
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Cryptanalysis of Two Group Signature Schemes
ISW '99 Proceedings of the Second International Workshop on Information Security
A New Offline Privacy Protecting E-cash System with Revokable Anonymity
ISC '02 Proceedings of the 5th International Conference on Information Security
Fair E-Cash: Be Compact, Spend Faster
ISC '09 Proceedings of the 12th International Conference on Information Security
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Off-Line group signatures with smart cards
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Short linkable ring signatures for e-voting, e-cash and attestation
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Tracing-by-linking group signatures
ISC'05 Proceedings of the 8th international conference on Information Security
An inter-bank E-payment protocol based on quantum proxy blind signature
Quantum Information Processing
| Hi-index | 0.00 |
A group signature scheme allows members of a possibly large group to sign messages anonymously on behalf of the group. Only a designated entity can determine the identity of the group member who issued a given signature. Group signatures, and particularly group blind signatures [28, 35] (which incorporate the properties of both blind signatures and group signatures), have many applications such as e-commerce. In this paper, we first propose a new group signature scheme, suitable for large groups (i.e., the group's public key and the signatures are fixed-size regardless of the number of memberships). Furthermore, we show how to use our group signature scheme to construct a practical privacy-protecting off-line electronic cash system. Our group signature scheme is more efficient than previous ones and the resulting electronic cash system is characterized by a high computational efficiency in the withdrawal protocol. Then, we show some weaknesses in the design of an electronic cash system based on a group signature scheme [28, 35]2. Finally, we describe some weaknesses of recently proposed group signature schemes.