Abstract
We discuss the question of how to interpret reduction arguments in cryptography. We give some examples to show the subtlety and difficulty of this question.
Cite
CITATION STYLE
APA
Koblitz, N., & Menezes, A. (2006). Another look at “Provable security”. II. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4329 LNCS, pp. 148–175). Springer Verlag. https://doi.org/10.1007/11941378_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free