Mary Maller

Affiliations:
  • Ethereum Foundation, London, UK
  • University College London, UK (former)


According to our database1, Mary Maller authored at least 32 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions.
IACR Cryptol. ePrint Arch., 2024

Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits.
IACR Cryptol. ePrint Arch., 2024

2023
Reaching consensus for asynchronous distributed key generation.
Distributed Comput., September, 2023

Zero-Knowledge Arguments for Subverted RSA Groups.
IACR Cryptol. ePrint Arch., 2023

Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations.
IACR Cryptol. ePrint Arch., 2023

Snowblind: A Threshold Blind Signature in Pairing-Free Groups.
IACR Cryptol. ePrint Arch., 2023

Fully Adaptive Schnorr Threshold Signatures.
IACR Cryptol. ePrint Arch., 2023

Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Baloo: Nearly Optimal Lookup Arguments.
IACR Cryptol. ePrint Arch., 2022

Caulk: Lookup Arguments in Sublinear Time.
IACR Cryptol. ePrint Arch., 2022

MinRoot: Candidate Sequential Function for Ethereum VDF.
IACR Cryptol. ePrint Arch., 2022

Bingo: Adaptively Secure Packed Asynchronous Verifiable Secret Sharing and Asynchronous Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2022

Better than Advertised Security for Non-interactive Threshold Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
SNARKBlock: Federated Anonymous Blocklisting from Hidden Common Input Aggregate Proofs.
IACR Cryptol. ePrint Arch., 2021

Snarky Ceremonies.
IACR Cryptol. ePrint Arch., 2021

Aggregatable Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2021

SnarkPack: Practical SNARK Aggregation.
IACR Cryptol. ePrint Arch., 2021

How to Prove Schnorr Assuming Schnorr: Security of Multi- and Threshold Signatures.
IACR Cryptol. ePrint Arch., 2021

Proofs for Inner Pairing Products and Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Reputable List Curation from Decentralized Voting.
Proc. Priv. Enhancing Technol., 2020

2019
Practical zero-knowledge arguments from structured reference strings.
PhD thesis, 2019

Aggregatable Signatures from an Inner Pairing Product Argument.
IACR Cryptol. ePrint Arch., 2019

Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings.
IACR Cryptol. ePrint Arch., 2019

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS.
IACR Cryptol. ePrint Arch., 2019

Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs.
IACR Cryptol. ePrint Arch., 2018

Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
IACR Cryptol. ePrint Arch., 2018

An Empirical Analysis of Anonymity in Zcash.
Proceedings of the 27th USENIX Security Symposium, 2018

Egalitarian Society or Benevolent Dictatorship: The State of Cryptocurrency Governance.
Proceedings of the Financial Cryptography and Data Security, 2018

Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs.
IACR Cryptol. ePrint Arch., 2017

2016
Deja Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions.
IACR Cryptol. ePrint Arch., 2016


  Loading...