Pavel Hubáček

Pavel Hubáček

Univerzita Karlova

H-index: 11

Europe-Czech Republic

About Pavel Hubáček

Pavel Hubáček, With an exceptional h-index of 11 and a recent h-index of 10 (since 2020), a distinguished researcher at Univerzita Karlova, specializes in the field of Cryptography, Game Theory, Computational Complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Practical Batch Proofs of Exponentiation

TFNP intersections through the lens of feasible disjunction

(Verifiable) Delay Functions from Lucas Sequences

Must the communication graph of MPC protocols be an expander?

Certifying Giant Nonprimes

One-Way Functions vs. TFNP: Simpler and Improved

PPP-completeness and extremal combinatorics

Practical statistically-sound proofs of exponentiation in any group

Pavel Hubáček Information

University

Position

___

Citations(all)

567

Citations(since 2020)

424

Cited By

332

hIndex(all)

11

hIndex(since 2020)

10

i10Index(all)

11

i10Index(since 2020)

10

Email

University Profile Page

Google Scholar

Pavel Hubáček Skills & Research Interests

Cryptography

Game Theory

Computational Complexity

Top articles of Pavel Hubáček

Practical Batch Proofs of Exponentiation

Cryptology ePrint Archive

2024

Pavel Hubáček
Pavel Hubáček

H-Index: 9

Svetlana Ivanova
Svetlana Ivanova

H-Index: 27

TFNP intersections through the lens of feasible disjunction

2024

Pavel Hubáček
Pavel Hubáček

H-Index: 9

(Verifiable) Delay Functions from Lucas Sequences

2023/11/27

Pavel Hubáček
Pavel Hubáček

H-Index: 9

Chethan Kamath
Chethan Kamath

H-Index: 9

Must the communication graph of MPC protocols be an expander?

Journal of Cryptology

2023/7

Certifying Giant Nonprimes

2023/5/2

One-Way Functions vs. TFNP: Simpler and Improved

Cryptology ePrint Archive

2023

PPP-completeness and extremal combinatorics

arXiv preprint arXiv:2209.04827

2022/9/11

Practical statistically-sound proofs of exponentiation in any group

2022/8/15

On the Distributed Discrete Logarithm Problem with Preprocessing

Cryptology ePrint Archive

2022

Pavel Hubáček
Pavel Hubáček

H-Index: 9

On search complexity of discrete logarithm

arXiv preprint arXiv:2107.02617

2021/7/6

Pavel Hubáček
Pavel Hubáček

H-Index: 9

Tortoise and hares consensus: the meshcash framework for incentive-compatible, scalable cryptocurrencies

2021

Pavel Hubáček
Pavel Hubáček

H-Index: 9

Tal Moran
Tal Moran

H-Index: 8

On Average-Case Hardness in from One-Way Functions

2020/11/16

Pavel Hubáček
Pavel Hubáček

H-Index: 9

Chethan Kamath
Chethan Kamath

H-Index: 9

See List of Professors in Pavel Hubáček University(Univerzita Karlova)

Co-Authors

academic-engine