Folgen
Pavel Hubáček
Pavel Hubáček
Bestätigte E-Mail-Adresse bei iuuk.mff.cuni.cz - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1152015
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
74*2016
Tortoise and hares consensus: the meshcash framework for incentive-compatible, scalable cryptocurrencies
I Bentov, P Hubáček, T Moran, A Nadler
Cyber Security Cryptography and Machine Learning: 5th International …, 2021
73*2021
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
432019
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
402014
The Journey from NP to TFNP Hardness
P Hubáček, M Naor, E Yogev
Electronic Colloquium on Computational Complexity (ECCC) 23, 199, 2016
34*2016
PPAD-hardness via iterated squaring modulo a composite
AR Choudhuri, P Hubácek, C Kamath, K Pietrzak, A Rosen, GN Rothblum
Cryptology ePrint Archive, 2019
282019
Rational sumchecks
S Guo, P Hubáček, A Rosen, M Vald
Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015
282015
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
172018
Must the communication graph of MPC protocols be an expander?
E Boyle, R Cohen, D Data, P Hubáček
Journal of Cryptology 36 (3), 20, 2023
162023
Stronger lower bounds for online ORAM
P Hubáček, M Koucký, K Král, V Slívová
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
162019
Limits on the power of cryptographic cheap talk
P Hubáček, JB Nielsen, A Rosen
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
92013
An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
P Hubáček, A Rosen, M Vald
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
42018
On Average-Case Hardness in from One-Way Functions
P Hubáček, C Kamath, K Král, V Slívová
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
3*2020
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
32014
Practical statistically-sound proofs of exponentiation in any group
C Hoffmann, P Hubáček, C Kamath, K Klein, K Pietrzak
Advances in Cryptology–CRYPTO 2022: 42nd Annual International Cryptology …, 2022
22022
On Search Complexity of Discrete Logarithm
P Hubáček, J Václavek
arXiv preprint arXiv:2107.02617, 2021
22021
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
22016
Rationality in the Cryptographic Model
P Hubáček
Department Office Computer Science, Aarhus University, 2014
22014
Certifying Giant Nonprimes
C Hoffmann, P Hubáček, C Kamath, K Pietrzak
Public-Key Cryptography–PKC 2023: 26th IACR International Conference on …, 2023
2023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20