Many of the results in Modern Cryptography are actually transformations of a basic computational phenomenon (i.e., a basic primitive, tool or assumption) to a more complex phenomenon (i.e., a higher level primitive or application). The transformation is explicit and is always accompanied by an explicit reduction of the violation of the security of the complex phenomenon to the violation of the simpler one. A key aspect is the efficiency of the reduction. We discuss and slightly modify the hierarchy of reductions originally suggested by Leonid Levin. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Goldreich, O. (2011). On security preserving reductions - Revised terminology. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 540–546. https://doi.org/10.1007/978-3-642-22670-0_34
Mendeley helps you to discover research relevant for your work.