Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pavel Hubácek
@inproceedings{DBLP:conf/innovations/FolwarcznyGHM024,
author = {Luk\'a\v{s} Folwarczn\'y and
Mika G{\"{o}}{\"{o}}s and
Pavel Hub{\'{a}}cek and
Gilbert Maystre and
Weiqiang Yuan},
editor = {Venkatesan Guruswami},
title = {One-Way Functions vs. {TFNP:} Simpler and Improved},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {50:1--50:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.50},
doi = {10.4230/LIPICS.ITCS.2024.50},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/FolwarcznyGHM024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HubacekKT24,
author = {Pavel Hub{\'{a}}cek and
Erfan Khaniki and
Neil Thapen},
editor = {Venkatesan Guruswami},
title = {{TFNP} Intersections Through the Lens of Feasible Disjunction},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {63:1--63:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.63},
doi = {10.4230/LIPICS.ITCS.2024.63},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HubacekKT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HoffmannHI24,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Svetlana Ivanova},
title = {Practical Batch Proofs of Exponentiation},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {145},
year = {2024},
url = {https://eprint.iacr.org/2024/145},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/HoffmannHI24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyleCDH23,
author = {Elette Boyle and
Ran Cohen and
Deepesh Data and
Pavel Hub{\'{a}}cek},
title = {Must the Communication Graph of {MPC} Protocols be an Expander?},
journal = {J. Cryptol.},
volume = {36},
number = {3},
pages = {20},
year = {2023},
url = {https://doi.org/10.1007/s00145-023-09460-8},
doi = {10.1007/S00145-023-09460-8},
timestamp = {Sat, 20 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BoyleCDH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BourneufFHRS23,
author = {Romain Bourneuf and
Luk\'a\v{s} Folwarczn\'y and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Nikolaj I. Schwartzbach},
editor = {Yael Tauman Kalai},
title = {PPP-Completeness and Extremal Combinatorics},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {22:1--22:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.22},
doi = {10.4230/LIPICS.ITCS.2023.22},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BourneufFHRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkc/HoffmannHKP23,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak},
editor = {Alexandra Boldyreva and
Vladimir Kolesnikov},
title = {Certifying Giant Nonprimes},
booktitle = {Public-Key Cryptography - {PKC} 2023 - 26th {IACR} International Conference
on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA,
May 7-10, 2023, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {13940},
pages = {530--553},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-31368-4\_19},
doi = {10.1007/978-3-031-31368-4\_19},
timestamp = {Fri, 05 May 2023 22:44:30 +0200},
biburl = {https://dblp.org/rec/conf/pkc/HoffmannHKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/HoffmannHKK23,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Tom{\'{a}}s Krn{\'{a}}k},
editor = {Guy N. Rothblum and
Hoeteck Wee},
title = {(Verifiable) Delay Functions from Lucas Sequences},
booktitle = {Theory of Cryptography - 21st International Conference, {TCC} 2023,
Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part
{IV}},
series = {Lecture Notes in Computer Science},
volume = {14372},
pages = {336--362},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-48624-1\_13},
doi = {10.1007/978-3-031-48624-1\_13},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tcc/HoffmannHKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-11428,
author = {Elette Boyle and
Ran Cohen and
Deepesh Data and
Pavel Hub{\'{a}}cek},
title = {Must the Communication Graph of {MPC} Protocols be an Expander?},
journal = {CoRR},
volume = {abs/2305.11428},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.11428},
doi = {10.48550/ARXIV.2305.11428},
eprinttype = {arXiv},
eprint = {2305.11428},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-11428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HoffmannHKP23,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak},
title = {Certifying Giant Nonprimes},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {238},
year = {2023},
url = {https://eprint.iacr.org/2023/238},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/HoffmannHKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/FolwarcznyGHMY23,
author = {Luk\'a\v{s} Folwarczn\'y and
Mika G{\"{o}}{\"{o}}s and
Pavel Hub{\'{a}}cek and
Gilbert Maystre and
Weiqiang Yuan},
title = {One-Way Functions vs. {TFNP:} Simpler and Improved},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {945},
year = {2023},
url = {https://eprint.iacr.org/2023/945},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/FolwarcznyGHMY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HoffmannHKK23,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Tom{\'{a}}s Krn{\'{a}}k},
title = {(Verifiable) Delay Functions from Lucas Sequences},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1404},
year = {2023},
url = {https://eprint.iacr.org/2023/1404},
timestamp = {Sat, 07 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HoffmannHKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/citc/HubacekJK22,
author = {Pavel Hub{\'{a}}cek and
L'ubica Jancov{\'{a}} and
Veronika Kr{\'{a}}lov{\'{a}}},
editor = {Dana Dachman{-}Soled},
title = {On the Distributed Discrete Logarithm Problem with Preprocessing},
booktitle = {3rd Conference on Information-Theoretic Cryptography, {ITC} 2022,
July 5-7, 2022, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {230},
pages = {6:1--6:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITC.2022.6},
doi = {10.4230/LIPICS.ITC.2022.6},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/citc/HubacekJK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/HoffmannHKKP22,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Karen Klein and
Krzysztof Pietrzak},
editor = {Yevgeniy Dodis and
Thomas Shrimpton},
title = {Practical Statistically-Sound Proofs of Exponentiation in Any Group},
booktitle = {Advances in Cryptology - {CRYPTO} 2022 - 42nd Annual International
Cryptology Conference, {CRYPTO} 2022, Santa Barbara, CA, USA, August
15-18, 2022, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13508},
pages = {370--399},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15979-4\_13},
doi = {10.1007/978-3-031-15979-4\_13},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/crypto/HoffmannHKKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-04827,
author = {Romain Bourneuf and
Luk\'a\v{s} Folwarczn\'y and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Nikolaj Ignatieff Schwartzbach},
title = {PPP-Completeness and Extremal Combinatorics},
journal = {CoRR},
volume = {abs/2209.04827},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.04827},
doi = {10.48550/ARXIV.2209.04827},
eprinttype = {arXiv},
eprint = {2209.04827},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-04827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BourneufFHRS22,
author = {Romain Bourneuf and
Luk\'a\v{s} Folwarczn\'y and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Nikolaj I. Schwartzbach},
title = {PPP-Completeness and Extremal Combinatorics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-128}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/128},
eprinttype = {ECCC},
eprint = {TR22-128},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BourneufFHRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HubacekJK22,
author = {Pavel Hub{\'{a}}cek and
L'ubica Jancov{\'{a}} and
Veronika Kr{\'{a}}lov{\'{a}}},
title = {On The Distributed Discrete Logarithm Problem with Preprocessing},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {521},
year = {2022},
url = {https://eprint.iacr.org/2022/521},
timestamp = {Mon, 16 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HubacekJK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HoffmannHKKP22,
author = {Charlotte Hoffmann and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Karen Klein and
Krzysztof Pietrzak},
title = {Practical Statistically-Sound Proofs of Exponentiation in any Group},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1021},
year = {2022},
url = {https://eprint.iacr.org/2022/1021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HoffmannHKKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cscml/BentovHMN21,
author = {Iddo Bentov and
Pavel Hub{\'{a}}cek and
Tal Moran and
Asaf Nadler},
editor = {Shlomi Dolev and
Oded Margalit and
Benny Pinkas and
Alexander A. Schwarzmann},
title = {Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible,
Scalable Cryptocurrencies},
booktitle = {Cyber Security Cryptography and Machine Learning - 5th International
Symposium, {CSCML} 2021, Be'er Sheva, Israel, July 8-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12716},
pages = {114--127},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-78086-9\_9},
doi = {10.1007/978-3-030-78086-9\_9},
timestamp = {Mon, 03 Jan 2022 22:32:47 +0100},
biburl = {https://dblp.org/rec/conf/cscml/BentovHMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HubacekV21,
author = {Pavel Hub{\'{a}}cek and
Jan V{\'{a}}clavek},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {On Search Complexity of Discrete Logarithm},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {60:1--60:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.60},
doi = {10.4230/LIPICS.MFCS.2021.60},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HubacekV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02617,
author = {Pavel Hub{\'{a}}cek and
Jan V{\'{a}}clavek},
title = {On Search Complexity of Discrete Logarithm},
journal = {CoRR},
volume = {abs/2107.02617},
year = {2021},
url = {https://arxiv.org/abs/2107.02617},
eprinttype = {arXiv},
eprint = {2107.02617},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HubacekY20,
author = {Pavel Hub{\'{a}}cek and
Eylon Yogev},
title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic
Lower Bounds},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1128--1172},
year = {2020},
url = {https://doi.org/10.1137/17M1118014},
doi = {10.1137/17M1118014},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HubacekY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/HubacekK0S20,
author = {Pavel Hub{\'{a}}cek and
Chethan Kamath and
Karel Kr{\'{a}}l and
Veronika Sl{\'{i}}vov{\'{a}}},
editor = {Rafael Pass and
Krzysztof Pietrzak},
title = {On Average-Case Hardness in {TFNP} from One-Way Functions},
booktitle = {Theory of Cryptography - 18th International Conference, {TCC} 2020,
Durham, NC, USA, November 16-19, 2020, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12552},
pages = {614--638},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64381-2\_22},
doi = {10.1007/978-3-030-64381-2\_22},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tcc/HubacekK0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HubacekKKS20,
author = {Pavel Hub{\'{a}}cek and
Chethan Kamath and
Karel Kr{\'{a}}l and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {On Average-Case Hardness in {TFNP} from One-Way Functions},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1162},
year = {2020},
url = {https://eprint.iacr.org/2020/1162},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HubacekKKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChoudhuriHKPRR19,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
editor = {Moses Charikar and
Edith Cohen},
title = {Finding a Nash equilibrium is no easier than breaking Fiat-Shamir},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1103--1114},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316400},
doi = {10.1145/3313276.3316400},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChoudhuriHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/HubacekK0S19,
author = {Pavel Hub{\'{a}}cek and
Michal Kouck{\'{y}} and
Karel Kr{\'{a}}l and
Veronika Sl{\'{i}}vov{\'{a}}},
editor = {Dennis Hofheinz and
Alon Rosen},
title = {Stronger Lower Bounds for Online {ORAM}},
booktitle = {Theory of Cryptography - 17th International Conference, {TCC} 2019,
Nuremberg, Germany, December 1-5, 2019, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {11892},
pages = {264--284},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-36033-7\_10},
doi = {10.1007/978-3-030-36033-7\_10},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tcc/HubacekK0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-03385,
author = {Pavel Hub{\'{a}}cek and
Michal Kouck{\'{y}} and
Karel Kr{\'{a}}l and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {Stronger Lower Bounds for Online {ORAM}},
journal = {CoRR},
volume = {abs/1903.03385},
year = {2019},
url = {http://arxiv.org/abs/1903.03385},
eprinttype = {arXiv},
eprint = {1903.03385},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-03385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChoudhuriHKPRR19,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
title = {Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-074}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/074},
eprinttype = {ECCC},
eprint = {TR19-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChoudhuriHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ChoudhuriHKPRR19,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
title = {Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {549},
year = {2019},
url = {https://eprint.iacr.org/2019/549},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ChoudhuriHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ChoudhuriHKPRR19a,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
title = {PPAD-Hardness via Iterated Squaring Modulo a Composite},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {667},
year = {2019},
url = {https://eprint.iacr.org/2019/667},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ChoudhuriHKPRR19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BoyleCDH18,
author = {Elette Boyle and
Ran Cohen and
Deepesh Data and
Pavel Hub{\'{a}}cek},
editor = {Hovav Shacham and
Alexandra Boldyreva},
title = {Must the Communication Graph of {MPC} Protocols be an Expander?},
booktitle = {Advances in Cryptology - {CRYPTO} 2018 - 38th Annual International
Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018,
Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {10993},
pages = {243--272},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96878-0\_9},
doi = {10.1007/978-3-319-96878-0\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BoyleCDH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/HubacekRV18,
author = {Pavel Hub{\'{a}}cek and
Alon Rosen and
Margarita Vald},
editor = {Jesper Buus Nielsen and
Vincent Rijmen},
title = {An Efficiency-Preserving Transformation from Honest-Verifier Statistical
Zero-Knowledge to Statistical Zero-Knowledge},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2018 - 37th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {10822},
pages = {66--87},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-78372-7\_3},
doi = {10.1007/978-3-319-78372-7\_3},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/HubacekRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GartnerHH0MS18,
author = {Bernd G{\"{a}}rtner and
Thomas Dueholm Hansen and
Pavel Hub{\'{a}}cek and
Karel Kr{\'{a}}l and
Hagar Mosaad and
Veronika Sl{\'{i}}vov{\'{a}}},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {{ARRIVAL:} Next Stop in {CLS}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {60:1--60:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.60},
doi = {10.4230/LIPICS.ICALP.2018.60},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GartnerHH0MS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07702,
author = {Bernd G{\"{a}}rtner and
Thomas Dueholm Hansen and
Pavel Hub{\'{a}}cek and
Karel Kr{\'{a}}l and
Hagar Mosaad and
Veronika Sl{\'{i}}vov{\'{a}}},
title = {{ARRIVAL:} Next Stop in {CLS}},
journal = {CoRR},
volume = {abs/1802.07702},
year = {2018},
url = {http://arxiv.org/abs/1802.07702},
eprinttype = {arXiv},
eprint = {1802.07702},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HubacekRV18,
author = {Pavel Hub{\'{a}}cek and
Alon Rosen and
Margarita Vald},
title = {An Efficiency-Preserving Transformation from Honest-Verifier Statistical
Zero-Knowledge to Statistical Zero-Knowledge},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {164},
year = {2018},
url = {http://eprint.iacr.org/2018/164},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HubacekRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BoyleCDH18,
author = {Elette Boyle and
Ran Cohen and
Deepesh Data and
Pavel Hub{\'{a}}cek},
title = {Must the Communication Graph of {MPC} Protocols be an Expander?},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {540},
year = {2018},
url = {https://eprint.iacr.org/2018/540},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BoyleCDH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HubacekNY17,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Eylon Yogev},
editor = {Christos H. Papadimitriou},
title = {The Journey from {NP} to {TFNP} Hardness},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {60:1--60:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.60},
doi = {10.4230/LIPICS.ITCS.2017.60},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HubacekNY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HubacekY17,
author = {Pavel Hub{\'{a}}cek and
Eylon Yogev},
editor = {Philip N. Klein},
title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic
Lower Bounds},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1352--1371},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.88},
doi = {10.1137/1.9781611974782.88},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/HubacekY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BentovHMN17,
author = {Iddo Bentov and
Pavel Hub{\'{a}}cek and
Tal Moran and
Asaf Nadler},
title = {Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible,
Scalable Cryptocurrencies},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {300},
year = {2017},
url = {http://eprint.iacr.org/2017/300},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BentovHMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HubacekNU16,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Jonathan R. Ullman},
title = {When Can Limited Randomness Be Used in Repeated Games?},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {722--746},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9690-4},
doi = {10.1007/S00224-016-9690-4},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HubacekNU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/GuoHRV16,
author = {Siyao Guo and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Margarita Vald},
editor = {Eyal Kushilevitz and
Tal Malkin},
title = {Rational Sumchecks},
booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A,
Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9563},
pages = {319--351},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49099-0\_12},
doi = {10.1007/978-3-662-49099-0\_12},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/tcc/GuoHRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HubacekNY16,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Eylon Yogev},
title = {The Journey from {NP} to {TFNP} Hardness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-199}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/199},
eprinttype = {ECCC},
eprint = {TR16-199},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HubacekNY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HubacekY16,
author = {Pavel Hub{\'{a}}cek and
Eylon Yogev},
title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic
Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-063}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/063},
eprinttype = {ECCC},
eprint = {TR16-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HubacekY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HubacekW15,
author = {Pavel Hub{\'{a}}cek and
Daniel Wichs},
editor = {Tim Roughgarden},
title = {On the Communication Complexity of Secure Function Evaluation with
Long Output},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {163--172},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688105},
doi = {10.1145/2688073.2688105},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HubacekW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HubacekNU15,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Jonathan R. Ullman},
editor = {Martin Hoefer},
title = {When Can Limited Randomness Be Used in Repeated Games?},
booktitle = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015,
Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9347},
pages = {259--271},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48433-3\_20},
doi = {10.1007/978-3-662-48433-3\_20},
timestamp = {Fri, 26 Mar 2021 08:28:34 +0100},
biburl = {https://dblp.org/rec/conf/sagt/HubacekNU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HubacekNU15,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Jonathan R. Ullman},
title = {When Can Limited Randomness Be Used in Repeated Games?},
journal = {CoRR},
volume = {abs/1507.01191},
year = {2015},
url = {http://arxiv.org/abs/1507.01191},
eprinttype = {arXiv},
eprint = {1507.01191},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/HubacekNU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GuoHRV15,
author = {Siyao Guo and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Margarita Vald},
title = {Rational Sumchecks},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1058},
year = {2015},
url = {http://eprint.iacr.org/2015/1058},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GuoHRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuoHRV14,
author = {Siyao Guo and
Pavel Hub{\'{a}}cek and
Alon Rosen and
Margarita Vald},
editor = {Moni Naor},
title = {Rational arguments: single round delegation with sublinear verification},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {523--540},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554845},
doi = {10.1145/2554797.2554845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuoHRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/HubacekP14,
author = {Pavel Hub{\'{a}}cek and
Sunoo Park},
editor = {Moshe Babaioff and
Vincent Conitzer and
David A. Easley},
title = {Cryptographically blinded games: leveraging players' limitations for
equilibria and profit},
booktitle = {{ACM} Conference on Economics and Computation, {EC} '14, Stanford
, CA, USA, June 8-12, 2014},
pages = {207--208},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2600057.2602903},
doi = {10.1145/2600057.2602903},
timestamp = {Tue, 15 Oct 2019 12:02:28 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/HubacekP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HubacekP14,
author = {Pavel Hub{\'{a}}cek and
Sunoo Park},
title = {Cryptographically Blinded Games: Leveraging Players' Limitations for
Equilibria and Profit},
journal = {CoRR},
volume = {abs/1411.3747},
year = {2014},
url = {http://arxiv.org/abs/1411.3747},
eprinttype = {arXiv},
eprint = {1411.3747},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HubacekP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HubacekW14a,
author = {Pavel Hub{\'{a}}cek and
Daniel Wichs},
title = {On the Communication Complexity of Secure Function Evaluation with
Long Output},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {669},
year = {2014},
url = {http://eprint.iacr.org/2014/669},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HubacekW14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/HubacekNR13,
author = {Pavel Hub{\'{a}}cek and
Jesper Buus Nielsen and
Alon Rosen},
editor = {Ran Canetti and
Juan A. Garay},
title = {Limits on the Power of Cryptographic Cheap Talk},
booktitle = {Advances in Cryptology - {CRYPTO} 2013 - 33rd Annual Cryptology Conference,
Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8042},
pages = {277--297},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40041-4\_16},
doi = {10.1007/978-3-642-40041-4\_16},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/HubacekNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HubacekNR13,
author = {Pavel Hub{\'{a}}cek and
Jesper Buus Nielsen and
Alon Rosen},
title = {Limits on the Power of Cryptographic Cheap Talk},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {499},
year = {2013},
url = {http://eprint.iacr.org/2013/499},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/HubacekNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
