Improved server assisted signatures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delegation of signing rights using certificateless proxy signatures
Information Sciences: an International Journal
Proxy signature scheme based on isomorphisms of polynomials
NSS'12 Proceedings of the 6th international conference on Network and System Security
Galindo-Garcia identity-based signature revisited
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Delegatable pseudorandom functions and applications
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
Information Processing Letters
Towards provably secure proxy signature scheme based on Isomorphisms of Polynomials
Future Generation Computer Systems
| Hi-index | 0.00 |
A proxy signature scheme permits an entity to delegate its signing rights to another. These schemes have been suggested for use in numerous applications, particularly in distributed computing. Before our work (Boldyreva et al. in Cryptology ePrint Archive, Report 2003/096, 2003) appeared, no precise definitions or proven-secure schemes had been provided. In this paper, we formalize a notion of security for proxy signature schemes and present provably-secure schemes. We analyze the security of the well-known delegation-by-certificate scheme and show that after some slight but important modifications, the resulting scheme is secure, assuming the underlying standard signature scheme is secure. We then show that employment of aggregate signature schemes permits bandwidth savings. Finally, we analyze the proxy signature scheme of Kim, Park and Won, which offers important performance benefits. We propose modifications to this scheme which preserve its efficiency and yield a proxy signature scheme that is provably secure in the random-oracle model, under the discrete-logarithm assumption.