Paper 2000/001

On Security Preserving Reductions -- Revised Terminology

Oded Goldreich

Abstract

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 former phenomenon to the violation of the latter. A key aspect is the efficiency of the reduction. We discuss and slightly modify the hierarchy of reductions originally suggested by Levin.

Metadata
Available format(s)
PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
ComplexityReductions
Contact author(s)
oded @ wisdom weizmann ac il
History
2000-03-07: received
Short URL
https://ia.cr/2000/001
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2000/001,
      author = {Oded Goldreich},
      title = {On Security Preserving Reductions -- Revised Terminology},
      howpublished = {Cryptology ePrint Archive, Paper 2000/001},
      year = {2000},
      note = {\url{https://eprint.iacr.org/2000/001}},
      url = {https://eprint.iacr.org/2000/001}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.