|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 151 - Issue 6 |
| Published: Oct 2016 |
| Authors: Tej Singh, Rashid Ali, Musharraf Ali |
10.5120/ijca2016911627
|
Tej Singh, Rashid Ali, Musharraf Ali . An Efficient Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings. International Journal of Computer Applications. 151, 6 (Oct 2016), 29-32. DOI=10.5120/ijca2016911627
@article{ 10.5120/ijca2016911627,
author = { Tej Singh,Rashid Ali,Musharraf Ali },
title = { An Efficient Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 151 },
number = { 6 },
pages = { 29-32 },
doi = { 10.5120/ijca2016911627 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A Tej Singh
%A Rashid Ali
%A Musharraf Ali
%T An Efficient Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings%T
%J International Journal of Computer Applications
%V 151
%N 6
%P 29-32
%R 10.5120/ijca2016911627
%I Foundation of Computer Science (FCS), NY, USA
Signcryption is a cryptography primitive that fulfills both the functions of digital signature and encryption and guarantees non-repudiation, confidentiality and integrity in a more efficient way. In this paper, we propose an efficient and secure identity based multi-proxy multi signcryption scheme from bilinear pairings. In this scheme a group of proxy signcrypters could authorize by a group of original signcrypters. Then multi proxy multi signcryption could generate by the cooperation of all signcrypters in the proxy group.