The following pages link to Pavel Hubáček (Q506538):
Displaying 16 items.
- When can limited randomness be used in repeated games? (Q506541) (← links)
- Must the communication graph of MPC protocols be an expander? (Q775967) (← links)
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge (Q1653075) (← links)
- On average-case hardness in \textsf{TFNP} from one-way functions (Q2119098) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Limits on the Power of Cryptographic Cheap Talk (Q2845678) (← links)
- Rational arguments (Q2988906) (← links)
- On the Communication Complexity of Secure Function Evaluation with Long Output (Q2989027) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q4575831) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- On Search Complexity of Discrete Logarithm (Q6168477) (← links)
