On Security Preserving Reductions – Revised Terminology

DOI10.1007/978-3-642-22670-0_34zbMath1343.94054OpenAlexW1558479458MaRDI QIDQ3088200

Oded Goldreich

Publication date: 19 August 2011

Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_34

zbMATH Keywords

complexityreductionsfoundations of cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Can PPAD hardness be based on standard cryptographic assumptions?

Cites Work

• Probabilistic encryption
• One way functions and pseudorandom generators
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Foundations of Cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: On Security Preserving Reductions – Revised Terminology