- 期刊
Provably Secure Identity-Based Aggregate Signcryption Scheme in Random Oracles
並列摘要
This article proposes a provably secure aggregate signcryption scheme in random oracles. Security of the scheme is based on computational infeasibility of solving Decisional Bilinear Diffie-Hellman Problem and Discrete Logarithm Problems. Confidentiality and authenticity are two fundamental security requirements of Public key Cryptography. These are achieved by encryption scheme and digital signatures respectively. Signcryption is a cryptographic protocol that carries out signature and encryption simultaneously in a single logical step. An aggregate signcryption scheme can be constructed of the aggregation of individual signcryption. The aggregation is done taking n distinct signcryptions on n messages signed by n distinct users.
延伸閱讀
- Shan, S. (2019). An Efficient Certificateless Signcryption Scheme without Random Oracles. International Journal of Electronics and Information Engineering, 11(1), 9-15. https://doi.org/10.6636/IJEIE.201909_11(1).02
- Ming, Y., & Wang, Y. M. (2009). An Efficient Verifiably Encrypted Signature Scheme without Random Oracles. International Journal of Network Security, 8(2), 125-130. https://doi.org/10.6633/IJNS.200903.8(2).04
- Kwok, H. M. (2011). A scalable and secure networking paradigm using identity-based cryptography [doctoral dissertation, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200019432
- Guo, H., & Deng, L. (2020). An Identity Based Proxy Signcryption Scheme without Pairings. International Journal of Network Security, 22(4), 561-568. https://doi.org/10.6633/IJNS.202007_22(4).02
- Chen, H. Y., Li, Y., & Ren, J. P. (2013). A Practical Identity-based Signcryption Scheme. International Journal of Network Security, 15(6), 484-489. https://doi.org/10.6633/IJNS.201311.15(6).09