A key distribution system equivalent to factoring
Journal of Cryptology
On the security of the Lucas function
Information Processing Letters
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Some Remarks on Lucas-Based Cryptosystems
CRYPTO '95 Proceedings of the 15th 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
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient and generalized group signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.98 |
Camenisch [1] links Chaum's [2] blind signature and claims to solve the length problems of group public key and of anonymous digital signature. However, a heavy time burden in verification weakens digital signature. This paper is to develop a new and faster digital anonymous signature system by linking the LUC function with the complexities of discrete logarithm and factorization. Our scheme is free from the change in public key, private key, and semipublic key if there is any change in the group internal membership. Our verification needs smaller volume than the Camenisch method [1] does, is easier to implement, and can be applied to large computer networks.