Pavel Hubáček

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Lecture Notes in Computer Science	2023-11-24	Paper
On Search Complexity of Discrete Logarithm (available as arXiv preprint)	2023-08-08	Paper
Must the communication graph of MPC protocols be an expander? Journal of Cryptology	2023-07-05	Paper
Practical statistically-sound proofs of exponentiation in any group Advances in Cryptology – CRYPTO 2022	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 (available as arXiv preprint)	2021-07-28	Paper
Hardness of continuous local search: query complexity and cryptographic lower bounds SIAM Journal on Computing	2020-12-04	Paper
Must the communication graph of MPC protocols be an expander?	2020-06-30	Paper
Stronger lower bounds for online ORAM (available as arXiv preprint)	2020-04-30	Paper
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	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 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
The journey from NP to TFNP hardness	2018-05-03	Paper
Rational arguments: single round delegation with sublinear verification Proceedings of the 5th conference on Innovations in theoretical computer science	2017-05-19	Paper
On the communication complexity of secure function evaluation with long output Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science	2017-05-19	Paper
When can limited randomness be used in repeated games? Theory of Computing Systems	2017-02-01	Paper
Rational sumchecks Theory of Cryptography	2016-04-08	Paper
When can limited randomness be used in repeated games? Lecture Notes in Computer Science	2015-11-04	Paper
Limits on the power of cryptographic cheap talk Advances in Cryptology – CRYPTO 2013	2013-09-02	Paper

Research outcomes over time

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