Pavel Hubáček

Latest

• On Search Complexity of Discrete Logarithm
• Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies
• Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
• On Average-Case Hardness in TFNP from One-Way Functions
• Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
• PPAD-Hardness via Iterated Squaring Modulo a Composite
• Stronger Lower Bounds for Online ORAM
• An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
• ARRIVAL: Next Stop in CLS
• Must the Communication Graph of MPC Protocols be an Expander?
• Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
• The Journey from NP to TFNP Hardness
• Rational Sumchecks
• When Can Limited Randomness Be Used in Repeated Games?
• On the Communication Complexity of Secure Function Evaluation with Long Output
• When Can Limited Randomness Be Used in Repeated Games?
• Cryptographically blinded games: leveraging players' limitations for equilibria and profit
• Rational arguments: single round delegation with sublinear verification
• Limits on the Power of Cryptographic Cheap Talk