Must the Communication Graph of MPC Protocols be an Expander?
Boyle, Elette, Cohen, Ran, Data, Deepesh, Hubáček, Pavel
Published in Journal of cryptology (01.07.2023)
Published in Journal of cryptology (01.07.2023)
Get full text
Journal Article
Stronger Lower Bounds for Online ORAM
Hubáček, Pavel, Koucký, Michal, Král, Karel, Slívová, Veronika
Published in Theory of Cryptography (2019)
Published in Theory of Cryptography (2019)
Get full text
Book Chapter
PPP-Completeness and Extremal Combinatorics
Bourneuf, Romain, Folwarczný, Lukáš, Hubáček, Pavel, Rosen, Alon, Schwartzbach, Nikolaj Ignatieff
Year of Publication 11.09.2022
Year of Publication 11.09.2022
Get full text
Journal Article
On Average-Case Hardness in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {TFNP}$$\end{document} from One-Way Functions
Hubáček, Pavel, Kamath, Chethan, Král, Karel, Slívová, Veronika
Published in Theory of Cryptography (09.12.2020)
Published in Theory of Cryptography (09.12.2020)
Get full text
Book Chapter
PPP-Completeness and Extremal Combinatorics
Bourneuf, Romain, Folwarczný, Lukáš, Hubáček, Pavel, Rosen, Alon, Nikolaj Ignatieff Schwartzbach
Published in arXiv.org (11.09.2022)
Get full text
Published in arXiv.org (11.09.2022)
Paper
ARRIVAL: Next Stop in CLS
Gärtner, Bernd, Hansen, Thomas Dueholm, Hubáček, Pavel, Král, Karel, Mosaad, Hagar, Slívová, Veronika
Year of Publication 21.02.2018
Year of Publication 21.02.2018
Get full text
Journal Article