Abstract
Boneh et al. showed a KDM secure public-key encryption scheme under the DDH assumption. The KDM security means that even when any affine function of the secret keys is encrypted, it is guaranteed to be secure. In this paper, we show a more tight proof. The reduction loss to the DDH assumption is 2 / 3 times smaller in the KDM (1 ) -security, and 5 / 6 times smaller in the KDM (n) -security, where n is the number of users. Our proof is also conceptually simpler.
Author supplied keywords
Cite
CITATION STYLE
Tada, H., Ueda, A., & Kurosawa, K. (2018). How to Prove KDM Security of BHHO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11049 LNCS, pp. 281–296). Springer Verlag. https://doi.org/10.1007/978-3-319-97916-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
