Abstract
AbstractThis article presents an efficient divisible blind signature scheme that makes it possible to divide a blind signature with a specified value into a sequence of subsignatures with smaller values for a sequence of different designated verifications. In the proposed scheme every signature can be divided into subsignatures with arbitrary positive values as long as the total value of them is equal to the specified value of that signature. Furthermore, no time-consuming operations such as modular exponentiation operations and inverse computations are required for a user to obtain and verify a divisible blind signature in the protocol. In particular, the proposed scheme can be applied to many interesting communication services, such as anonymous scoring services, divisible electronic cash systems, and multi-recastable voting protocols.
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 callMore From: International Journal of Computers and Applications
Disclaimer: 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.
