On blind signatures and perfect crimes
Computers and Security
A new signature scheme based on the DSA giving message recovery
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Untraceable off-line cash in wallet with observers
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Strong loss tolerance of electronic coin systems
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
An ElGamal-Like Cryptosystem for Enciphering Large Messages
IEEE Transactions on Knowledge and Data Engineering
An Efficient Electronic Payment System Protecting Privacy
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
On the Security of RSA Padding
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
RSA-Based Partially Blind Signature with Low Computation
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Fair Cryptosystems
Blinding for unanticipated signatures
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Partially blind threshold signatures based on discrete logarithm
Computer Communications
Randomization enhanced Chaum's blind signature scheme
Computer Communications
Hi-index | 0.00 |
With the help of a blind signature scheme, a requester can obtain a signature on a message from a signer such that the signer knows nothing about the content of the messages and is unable to link the resulting message-signature pair; namely, a blind signature scheme can achieve both blindness and untraceability. Due to the above properties, the blind signature scheme can be used in cryptographic applications such as electronic voting systems and cash payment systems. So far, most of the proposed blind signature schemes are based on the difficulty of solving the factoring problem and quadratic residues. In this paper, the authors intend to propose two new untraceable blind signature schemes based on the difficulty of solving the discrete logarithm problem. The two blind signature schemes are two variations of the DSA signature scheme and can fully satisfy all of the properties a blind signature scheme can have.