How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
From MaRDI portal
Publication:4911612
DOI10.1007/978-3-642-34961-4_38zbMath1292.94029OpenAlexW2100705134MaRDI QIDQ4911612
Olivier Pereira, Bogdan Warinschi, David Bernhard
Publication date: 19 March 2013
Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_38
Related Items (23)
Protecting the privacy of voters: new definitions of ballot secrecy for e-voting ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ Generic plaintext equality and inequality proofs ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Issuer-hiding attribute-based credentials ⋮ Absentia: secure multiparty computation on ethereum ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Privacy-preserving blueprints ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Traceable receipt-free encryption ⋮ End-to-End Verifiable Quadratic Voting with Everlasting Privacy ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Surveying global verifiability ⋮ Acyclicity programming for sigma-protocols ⋮ Exploiting re-voting in the Helios election system ⋮ Secret, verifiable auctions from elections ⋮ Ceremonies for End-to-End Verifiable Elections ⋮ Verifiable Multi-party Computation with Perfectly Private Audit Trail ⋮ Simple verifiable delay functions ⋮ Group signatures with user-controlled and sequential linkability ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Cryptographic Voting — A Gentle Introduction
This page was built for publication: How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
