7 citations · 7 across the 6 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2024
Low-degree Security of the Planted Random Subgraph Problem
Andrej Bogdanov, Chris Jones, Alon Rosen +1
The planted random subgraph detection conjecture of Abram et al. (TCC 2023) asserts the pseudorandomness of a pair of graphs , where is an Erdos-Renyi random graph on $…
cs.CR2014★ 7 cited
The impossibility of obfuscation with auxiliary input or a universal simulator
Nir Bitansky, Ran Canetti, Henry Cohn +4
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility re…