Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Hubácek
Person information
- unicode name: Pavel Hubáček
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. ITCS 2024: 50:1-50:14- [c22]Pavel Hubácek, Erfan Khaniki, Neil Thapen:
TFNP Intersections Through the Lens of Feasible Disjunction. ITCS 2024: 63:1-63:24 - [i26]Charlotte Hoffmann, Pavel Hubácek, Svetlana Ivanova:
Practical Batch Proofs of Exponentiation. IACR Cryptol. ePrint Arch. 2024: 145 (2024) - 2023
- [j3]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. 36(3): 20 (2023) - [c21]Romain Bourneuf, Lukás Folwarczný
, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach:
PPP-Completeness and Extremal Combinatorics. ITCS 2023: 22:1-22:20 - [c20]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. Public Key Cryptography (1) 2023: 530-553 - [c19]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. TCC (4) 2023: 336-362 - [i25]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CoRR abs/2305.11428 (2023) - [i24]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023: 238 (2023) - [i23]Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan:
One-Way Functions vs. TFNP: Simpler and Improved. IACR Cryptol. ePrint Arch. 2023: 945 (2023) - [i22]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. IACR Cryptol. ePrint Arch. 2023: 1404 (2023) - 2022
- [c18]Pavel Hubácek, L'ubica Jancová, Veronika Králová:
On the Distributed Discrete Logarithm Problem with Preprocessing. ITC 2022: 6:1-6:19 - [c17]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) 2022: 370-399 - [i21]Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj Ignatieff Schwartzbach:
PPP-Completeness and Extremal Combinatorics. CoRR abs/2209.04827 (2022) - [i20]Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach:
PPP-Completeness and Extremal Combinatorics. Electron. Colloquium Comput. Complex. TR22 (2022) - [i19]Pavel Hubácek, L'ubica Jancová, Veronika Králová:
On The Distributed Discrete Logarithm Problem with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 521 (2022) - [i18]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Practical Statistically-Sound Proofs of Exponentiation in any Group. IACR Cryptol. ePrint Arch. 2022: 1021 (2022) - 2021
- [c16]Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler:
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. CSCML 2021: 114-127 - [c15]Pavel Hubácek, Jan Václavek:
On Search Complexity of Discrete Logarithm. MFCS 2021: 60:1-60:16 - [i17]Pavel Hubácek, Jan Václavek:
On Search Complexity of Discrete Logarithm. CoRR abs/2107.02617 (2021) - 2020
- [j2]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM J. Comput. 49(6): 1128-1172 (2020) - [c14]Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová:
On Average-Case Hardness in TFNP from One-Way Functions. TCC (3) 2020: 614-638 - [i16]Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová:
On Average-Case Hardness in TFNP from One-Way Functions. IACR Cryptol. ePrint Arch. 2020: 1162 (2020)
2010 – 2019
- 2019
- [c13]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019: 1103-1114 - [c12]Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová:
Stronger Lower Bounds for Online ORAM. TCC (2) 2019: 264-284 - [i15]Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová:
Stronger Lower Bounds for Online ORAM. CoRR abs/1903.03385 (2019) - [i14]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. TR19 (2019) - [i13]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 549 (2019) - [i12]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019: 667 (2019) - 2018
- [c11]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) 2018: 243-272 - [c10]Pavel Hubácek, Alon Rosen, Margarita Vald:
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. EUROCRYPT (3) 2018: 66-87 - [c9]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. ICALP 2018: 60:1-60:13 - [i11]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. CoRR abs/1802.07702 (2018) - [i10]Pavel Hubácek, Alon Rosen, Margarita Vald:
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2018: 164 (2018) - [i9]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? IACR Cryptol. ePrint Arch. 2018: 540 (2018) - 2017
- [c8]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. ITCS 2017: 60:1-60:21 - [c7]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SODA 2017: 1352-1371 - [i8]Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler:
Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. IACR Cryptol. ePrint Arch. 2017: 300 (2017) - 2016
- [j1]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? Theory Comput. Syst. 59(4): 722-746 (2016) - [c6]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. TCC (A2) 2016: 319-351 - [i7]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. TR16 (2016) - [i6]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c5]Pavel Hubácek, Daniel Wichs:
On the Communication Complexity of Secure Function Evaluation with Long Output. ITCS 2015: 163-172 - [c4]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? SAGT 2015: 259-271 - [i5]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? CoRR abs/1507.01191 (2015) - [i4]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. IACR Cryptol. ePrint Arch. 2015: 1058 (2015) - 2014
- [c3]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational arguments: single round delegation with sublinear verification. ITCS 2014: 523-540 - [c2]Pavel Hubácek, Sunoo Park:
Cryptographically blinded games: leveraging players' limitations for equilibria and profit. EC 2014: 207-208 - [i3]Pavel Hubácek, Sunoo Park:
Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit. CoRR abs/1411.3747 (2014) - [i2]Pavel Hubácek, Daniel Wichs:
On the Communication Complexity of Secure Function Evaluation with Long Output. IACR Cryptol. ePrint Arch. 2014: 669 (2014) - 2013
- [c1]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. CRYPTO (1) 2013: 277-297 - [i1]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. IACR Cryptol. ePrint Arch. 2013: 499 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
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:
