Abstract
Provable security has been widely used for analyzing the security of cryptosystems. Its main idea is to reduce the security to some well-defined computational assumption. The reduction process is called the security proof. In this paper, we find a flaw in the security proof of BDOP-PEKS and PEKS-STAT, present a new conclusion for the security of BDOP-PEKS, and give a security proof. The flaw in the security proof of PEKS-STAT can be fixed in the same way. Finally we conclude some steps of security proof, and emphasize that the probability is as important as the construction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellare M. Practice-Oriented Provable Security[C]// ISW’97, LNCS 396. Berlin: Springer-Verlag, 1997: 221–231.
Pointcheval D. Advanced Course on Contemporary Cryptology[M]. Basel: Birkhuser Publishers, 2005.
Boneh D, Di Crescenzo G, Ostrovsky R, et al. Public Key Encryption with Keyword Search [C]//EUROCRYPT 2004, LNCS 3027. Berlin: Springer-Verlag, 2004:506–522.
Abdalla M, Bellare M. Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions[C]//CRYPTO 2005, LNCS 3621. Berlin: Springer-Verlag, 2005:205–222.
Boneh D, Frankin M. Identity-Based Encryption from Weil Pairing[J]. SIAM J of Computing, 2003,32(3): 586–615.
Okamoto T, Pointcheval D. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes[C]//PKC2001, LNCS 1992. Berlin: Springer-Verlag, 2001: 104–118.
Diffie W, Hellman M E. New Directions in Cryptography[J]. IEEE Transactions on Information Theory, 1976, IT-22(6): 644–654.
Bellare M, Desai A, Pointcheval D, et al. Relations among Notions of Security for Public-Key Encryption Schemes[C]// Cryto’98, LNCS 1462. Berlin: Springer-Verlag, 1998:26–45.
Boneh D, Lipton R J. Algorithms for Black-Box Fields and Their Application to Cryptography[C]//Crypto’96, LNCS 1109. Berlin: Springer-Verlag, 1996:283–297.
Dwork C, Naor M. An Efficient Existentially Unforgeable Signature Scheme and Its Applications[J]. J of Cryptology, 1998, 11(3): 187–208.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60473021)
Biography: ZHANG Yajuan(1974–), female, Ph.D., research direction: cryptography.
Rights and permissions
About this article
Cite this article
Zhang, Y., Zhu, Y., Gu, C. et al. A flaw in the security proof of BDOP-PEKS and PEKS-STAT. Wuhan Univ. J. of Nat. Sci. 12, 25–28 (2007). https://doi.org/10.1007/s11859-006-0157-3
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11859-006-0157-3