Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
A secure and privacy-protecting protocol for transmitting personal information between organizations
Proceedings on Advances in cryptology---CRYPTO '86
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Simple and Secure Way to Show the Validity of Your Public Key
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
CRYPTO '89 Proceedings on Advances in cryptology
PayCash: a secure efficient Internet payment system
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Design of electronic t-out-of-n lotteries on the Internet
Computer Standards & Interfaces
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
MobiCoin: digital cash for m-commerce
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem
Fundamenta Informaticae
An anonymous DRM scheme for sharing multimedia files in P2P networks
Multimedia Tools and Applications
| Hi-index | 0.00 |
Previously known blind signature systems require an amount of computation at least proportional to the number of signature types, and also that the number of such types be fixed in advance. These requirements are not practical in some applications. Here, a new blind signature technique is introduced that allows an unlimited number of signature types with only a (modest) constant amount of computation.