- 期刊
An Efficient Verifiably Encrypted Signature Scheme without Random Oracles
並列摘要
In this paper, we propose an efficient verifiably encrypted signature scheme based on bilinear pairings. The pro- posed scheme is proven secure without random oracles. Our scheme has a tight security reduction to a strong but reasonable computational assumption. To the best of our knowledge, it is the third one of this kind in the literature to achieve this security level.
延伸閱讀
- 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
- Ren, F., Zheng, D., & Wang, W. (2017). An Efficient Code Based Digital Signature Algorithm. International Journal of Network Security, 19(6), 1072-1079. https://doi.org/10.6633/IJNS.201711.19(6).24
- Li, J. G., & Wang, S. H. (2007). New Efficient Proxy Blind Signature Scheme Using Verifiable Self-certified Public Key. International Journal of Network Security, 4(2), 193-200. https://doi.org/10.6633/IJNS.200703.4(2).09
- Yahyaoui, A. E., & Kettani, M. D. E. C. E. (2019). An Efficient Fully Homomorphic Encryption Scheme. International Journal of Network Security, 21(1), 91-99. https://doi.org/10.6633/IJNS.201901_21(1).11
- Das, J., Kakoty, S., & Ahmed, M. (2016). A Study on Modern Cryptographic Primitives and Signature Schemes. IRA-International Journal of Technology & Engineering, 5(3), 70-76. https://doi.org/10.21013/jte.v5.n3.p3