Pages that link to "Item:Q4910292"
From MaRDI portal
The following pages link to Limits on the Usefulness of Random Oracles (Q4910292):
Displaying 13 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- Non-adaptive programmability of random oracle (Q500974) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Barriers for succinct arguments in the random oracle model (Q2119037) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- On the Power of Threshold Measurements as Oracles (Q5300906) (← links)
