Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
