- 期刊
Provably Secure Identity-based Threshold Key Escrow from Pairing
並列摘要
This paper proposes an identity-based threshold key escrow scheme. The scheme is secure against identity-based threshold chosen-plaintext attack. It tolerates the passive adversary to access data of corrupted key escrow agency servers and the active adversary that can modify corrupted servers' keys. The formal proof of security is presented in the random oracle model, assuming the Bilinear Diffie-Hellman problem is computationally hard.
延伸閱讀
- Liu, D., Zhang, S., Zhong, H., Shi, R., & Wang, Y. (2017). An Efficient Identity-based Online/Offline Signature Scheme without Key Escrow. International Journal of Network Security, 19(1), 127-137. https://doi.org/10.6633/IJNS.201701.19(1).14
- Kar, J. (2015). Provably Secure Identity-Based Aggregate Signcryption Scheme in Random Oracles. International Journal of Network Security, 17(5), 580-587. https://doi.org/10.6633/IJNS.201509.17(5).09
- Nguyen, N. T., Le, H. D., & Chang, C. C. (2016). Provably Secure and Efficient Three-Factor Authenticated Key Agreement Scheme with Untraceability. International Journal of Network Security, 18(2), 335-344. https://doi.org/10.6633/IJNS.201603.18(2).15
- Zhou, C., Zhang, Y., & Wang, L. (2018). A Provable Secure Identity-based Generalized Proxy Signcryption Scheme. International Journal of Network Security, 20(6), 1183-1193. https://doi.org/10.6633/IJNS.201811_20(6).18
- Wu, S. H., & Zhu, Y. F. (2008). Proof of Forward Security for Password-Based Authenticated Key Exchange. International Journal of Network Security, 7(3), 335-341. https://doi.org/10.6633/IJNS.200811.7(3).04