A Hyperelliptic Curve Cryptosystem Based Proxy Promised Signcryption Scheme

被引:0
作者
Khan, Farhad Ullah [1 ]
Algarni, Fahad [2 ]
Ullah, Insaf [3 ]
Karamti, Hanen [4 ]
Manzar, Muhammad Anwaar [3 ]
Alzahrani, Ahmed Saeed [5 ]
Aziz, Muhammad Adnan [6 ]
Khan, Muhammad Asghar [3 ]
机构
[1] Allama Iqbal Open Univ, Dept Comp Sci, Islamabad, Pakistan
[2] Univ Bisha, Coll Comp & Informat Technol, Bisha, Saudi Arabia
[3] Hamdard Univ, HIET, Islamabad Campus, Islamabad 44000, Pakistan
[4] Princess Nourah Bint Abdulrahman Univ, Coll Comp & Informat Sci, Dept Comp Sci, POB 84428, Riyadh 11671, Saudi Arabia
[5] King Abdulaziz Univ, Fac Comp & Informat Technol, Dept Comp Sci, Jeddah 21589, Saudi Arabia
[6] Isra Univ, Dept Elect Engn, Islamabad 44000, Pakistan
关键词
Network security - Electronic document identification systems;
D O I
10.1155/2022/1232336
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Signcryption is the method of combining a digital signature with encryption in a single logical step to get the cryptographic primitives of a public key. However, in addition to signcryption, we sometimes require anonymity and delegation of rights. In this paper, we propose a scheme called proxy promised signcryption to address all of these objectives simultaneously. In this scheme, the actual sender or signer delegates authority to an agent known as signcrypter for signcryption of the actual ciphertext. The agent entity is facilitated to generate a promised signcrypted text. The signcrypted text is then communicated to the intended recipient. The proposed work aims to reduce computation and communication costs, which has been tested by comparing it to existing schemes. The results obtained from this comparison support the aims of our scheme. The proposed scheme's security has also been evaluated using the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool. The results validate that our scheme resists well-known cyberattacks.
引用
收藏
页数:10
相关论文
共 49 条
[1]  
[Anonymous], 1997, INFORM SECURITY
[2]   SATMC: A SAT-based model checker for security protocols [J].
Armando, A ;
Compagna, L .
LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 :730-733
[3]  
Aumann Y., P INT C THEOR COMP S, P20
[4]  
Basin D, 2003, LECT NOTES COMPUT SC, V2808, P253
[5]  
Boichut Y., P AVIS 04 3 INT WORK
[6]  
Chan W., P INT C SEC MAN JUN
[7]  
Chevalier Y., 2002, CAV '02: Proceedings of the 14th International Conference on Computer Aided Verification, P324, DOI DOI 10.1007/3-540-45657-0_24
[8]   Deniable authentication protocols [J].
Deng, X ;
Lee, CH ;
Zhu, H .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2001, 148 (02) :101-104
[9]   ON THE SECURITY OF PUBLIC KEY PROTOCOLS [J].
DOLEV, D ;
YAO, AC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) :198-208
[10]  
Dwork C., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P409, DOI 10.1145/276698.276853