( en | de | ru )

 

Disambiguation of "Hubácek, Pavel"

Author of the publication

copydeleteadd this publication to your clipboard
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies.

, , , and . CSCML, volume 12716 of Lecture Notes in Computer Science, page 114-127. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Otto Hubacek

Ivo Hubacek

Dietrich Pavel

Wieland Werther Pavel

Jonas Philipp Pavelka

 

Other publications of authors with the same name

The Journey from NP to TFNP Hardness., , and . Electron. Colloquium Comput. Complex., (2016)Must the Communication Graph of MPC Protocols be an Expander?, , , and . CoRR, (2023)Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies., , , and . CSCML, volume 12716 of Lecture Notes in Computer Science, page 114-127. Springer, (2021)Certifying Giant Nonprimes., , , and . Public Key Cryptography (1), volume 13940 of Lecture Notes in Computer Science, page 530-553. Springer, (2023)Practical Statistically-Sound Proofs of Exponentiation in Any Group., , , , and . CRYPTO (2), volume 13508 of Lecture Notes in Computer Science, page 370-399. Springer, (2022)ARRIVAL: Next Stop in CLS., , , , , and . ICALP, volume 107 of LIPIcs, page 60:1-60:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir., , , , , and . Electron. Colloquium Comput. Complex., (2019)When Can Limited Randomness Be Used in Repeated Games?, , and . SAGT, volume 9347 of Lecture Notes in Computer Science, page 259-271. Springer, (2015)On the Distributed Discrete Logarithm Problem with Preprocessing., , and . ITC, volume 230 of LIPIcs, page 6:1-6:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Average-Case Hardness in TFNP from One-Way Functions., , , and . TCC (3), volume 12552 of Lecture Notes in Computer Science, page 614-638. Springer, (2020)