On the communication complexity of secure function evaluation with long output P Hubacek, D Wichs Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 70 | 2015 |

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds P Hubáček, E Yogev Electronic Colloquium on Computational Complexity (ECCC) 23, 63, 2016 | 40 | 2016 |

Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. I Bentov, P Hubácek, T Moran, A Nadler IACR Cryptol. ePrint Arch. 2017, 300, 2017 | 37 | 2017 |

Rational arguments: single round delegation with sublinear verification S Guo, P Hubáček, A Rosen, M Vald Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 32 | 2014 |

Rational sumchecks S Guo, P Hubáček, A Rosen, M Vald Theory of Cryptography Conference, 319-351, 2016 | 25 | 2016 |

The Journey from NP to TFNP Hardness P Hubáček, M Naor, E Yogev Electronic Colloquium on Computational Complexity (ECCC) 23, 199, 2016 | 24* | 2016 |

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir AR Choudhuri, P Hubáček, C Kamath, K Pietrzak, A Rosen, GN Rothblum Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 17 | 2019 |

PPAD-Hardness via Iterated Squaring Modulo a Composite. AR Choudhuri, P Hubácek, C Kamath, K Pietrzak, A Rosen, GN Rothblum IACR Cryptol. ePrint Arch. 2019, 667, 2019 | 10 | 2019 |

Limits on the power of cryptographic cheap talk P Hubáček, JB Nielsen, A Rosen Annual Cryptology Conference, 277-297, 2013 | 8 | 2013 |

Stronger lower bounds for online ORAM P Hubáček, M Koucký, K Král, V Slívová Theory of Cryptography Conference, 264-284, 2019 | 6 | 2019 |

Must the Communication Graph of MPC Protocols be an Expander? E Boyle, R Cohen, D Data, P Hubáček Annual International Cryptology Conference, 243-272, 2018 | 6 | 2018 |

ARRIVAL: next stop in CLS B Gärtner, TD Hansen, P Hubáček, K Král, H Mosaad, V Slívová arXiv preprint arXiv:1802.07702, 2018 | 5 | 2018 |

Cryptographically blinded games: leveraging players' limitations for equilibria and profit P Hubáček, S Park Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 3 | 2014 |

When can limited randomness be used in repeated games? P Hubáček, M Naor, J Ullman Theory of Computing Systems 59 (4), 722-746, 2016 | 2 | 2016 |

Rationality in the Cryptographic Model P Hubáček Department Office Computer Science, Aarhus University, 2014 | 2 | 2014 |

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge P Hubáček, A Rosen, M Vald Annual International Conference on the Theory and Applications of …, 2018 | | 2018 |

On Average-Case Hardness in TFNP from One-Way Functions⋆ P Hubáček, C Kamath, K Král, V Slívová | | |