Towards Non-Black-Box Separations of Public Key Encryption and One Way Function

DOI10.1007/978-3-662-53644-5_7zbMath1397.94056OpenAlexW2535913973MaRDI QIDQ3181026

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_7

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Some consequences of non-uniform conditions on uniform classes
On problems without polynomial kernels
Notions of Black-Box Reductions, Revisited
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
On basing one-way functions on NP-hardness
Adaptive Security of Constrained PRFs
On the Cryptographic Applications of Random Functions (Extended Abstract)
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Towards Non-Black-Box Lower Bounds in Cryptography
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
Random-Self-Reducibility of Complete Sets
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
On the Impossibility of Three-Move Blind Signature Schemes
Improved Bounds on Security Reductions for Discrete Log Based Signatures
A Pseudorandom Generator from any One-way Function
Foundations of Cryptography
A Parallel Repetition Theorem
Why “Fiat-Shamir for Proofs” Lacks a Proof
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions
Separating succinct non-interactive arguments from all falsifiable assumptions
Limits of provable security from standard assumptions
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
On the Power of the Randomized Iterate
On Worst‐Case to Average‐Case Reductions for NP Problems

This page was built for publication: Towards Non-Black-Box Separations of Public Key Encryption and One Way Function