<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>An Efficient Multi-Proxy System for Proxy Signature Scheme</title>
  <journal>Journal of Information Security Research</journal>
  <author>Shivendu Mishra, Rajeev Anand Sahu, Sahadeo Padhye</author>
  <volume>2</volume>
  <issue>1</issue>
  <year>2011</year>
  <doi></doi>
  <url>http://www.dline.info/jisr/fulltext/v2n1/1.pdf</url>
  <abstract>In the last few years, the traditonal certificate-based setting is replaced by the ID-based setting. Proxy signatures allow the delegation of signing rights from an original user to its proxy agent. Normally, the original signer can authorize a group of proxy agents to sign any document on its behalf. Currently in our study, we have proposed an ID-based multi-proxy signature scheme, from bilinear pairings based on ‘k-plus problem’. We document that the proposed scheme is secure under the inverse computational Die-Hellman (INV-CDH) assumption. Besides, we have proven that the new scheme is computationally more efficient and takes less running time than other existing schemes [5, 10]. Our proposed method meets all the security requirements of a proxy signature scheme proposed by Lee</abstract>
</record>
