Author of the publication

Solving the at-most-once problem with nearly optimal effectiveness.

, and . PODC, page 229-230. ACM, (2011)

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.

 

Other publications of authors with the same name

Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition., , , and . IACR Cryptology ePrint Archive, (2018)Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake., , , and . IACR Cryptology ePrint Archive, (2018)Full Analysis of Nakamoto Consensus in Bounded-Delay Networks., , and . IACR Cryptology ePrint Archive, (2020)Zero-Knowledge Proofs with Witness Elimination., and . Public Key Cryptography, volume 5443 of Lecture Notes in Computer Science, page 124-138. Springer, (2009)Mining for Privacy: How to Bootstrap a Snarky Blockchain., , and . IACR Cryptology ePrint Archive, (2020)On Crafty Pirates and Foxy Tracers., and . Digital Rights Management Workshop, volume 2320 of Lecture Notes in Computer Science, page 22-39. Springer, (2001)How to keep a secret: leakage deterring public-key cryptosystems., and . ACM Conference on Computer and Communications Security, page 943-954. ACM, (2013)Electronic Voting.. Handbook of Financial Cryptography and Security, Chapman and Hall/CRC, (2010)An Efficient E2E Verifiable E-voting System without Setup Assumptions., , and . IEEE Secur. Priv., 15 (3): 14-23 (2017)The Generals’ Scuttlebutt: Byzantine-Resilient Gossip Protocols., , , and . IACR Cryptol. ePrint Arch., (2022)