Pavel Hubáček

Available identifiers

zbMath Open hubacek.pavelMaRDI QIDQ506538

List of research outcomes

Publication	Date of Publication	Type
PPP-completeness and extremal combinatorics	2024-09-25	Paper
(Verifiable) delay functions from Lucas sequences	2024-08-15	Paper
On the distributed discrete logarithm problem with preprocessing	2024-06-25	Paper
Certifying giant nonprimes	2023-11-24	Paper
On Search Complexity of Discrete Logarithm	2023-08-08	Paper
Must the communication graph of MPC protocols be an expander?	2023-07-05	Paper
Practical statistically-sound proofs of exponentiation in any group	2023-06-28	Paper
PPP-Completeness and Extremal Combinatorics	2022-09-11	Paper
On average-case hardness in \textsf{TFNP} from one-way functions	2022-03-23	Paper
ARRIVAL: Next Stop in CLS	2021-07-28	Paper
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds	2020-12-04	Paper
Must the communication graph of MPC protocols be an expander?	2020-06-30	Paper
Stronger lower bounds for online ORAM	2020-04-30	Paper
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir	2020-01-30	Paper
An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge	2018-07-17	Paper
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds	2018-07-16	Paper
The Journey from NP to TFNP Hardness	2018-05-03	Paper
Rational arguments	2017-05-19	Paper
On the Communication Complexity of Secure Function Evaluation with Long Output	2017-05-19	Paper
When can limited randomness be used in repeated games?	2017-02-01	Paper
Rational Sumchecks	2016-04-08	Paper
When can limited randomness be used in repeated games?	2015-11-04	Paper
Limits on the Power of Cryptographic Cheap Talk	2013-09-02	Paper

Research outcomes over time

This page was built for person: Pavel Hubáček