Mathias Hall-Andersen

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 33

Top Topics

Computationally Expensive

Data Availability

Top Venues

IACR Cryptol. ePrint Arch.

Proc. Priv. Enhancing Technol.

Publications

Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
FRIDA: Data Availability Sampling from FRI. IACR Cryptol. ePrint Arch. 2024 (2024)
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin
Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT. IACR Cryptol. ePrint Arch. 2024 (2024)
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
FRIDA: Data Availability Sampling from FRI. CRYPTO (6) (2024)
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
Jackpot: Non-Interactive Aggregatable Lotteries. IACR Cryptol. ePrint Arch. 2023 (2023)
Fatemeh Heidari Soureshjani, Mathias Hall-Andersen, MohammadMahdi Jahanara, Jeffrey Kam, Jan Gorzny, Mohsen Ahmadvand
Automated Analysis of Halo2 Circuits. IACR Cryptol. ePrint Arch. 2023 (2023)
Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. EUROCRYPT (2) (2023)
Fatemeh Heidari Soureshjani, Mathias Hall-Andersen, MohammadMahdi Jahanara, Jeffrey Kam, Jan Gorzny, Mohsen Ahmadvand
Automated Analysis of Halo2 Circuits. SMT (2023)
Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk
Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. 2023 (2023)
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
Foundations of Data Availability Sampling. IACR Cryptol. ePrint Arch. 2023 (2023)
Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain
Secure Multiparty Computation with Free Branching. IACR Cryptol. ePrint Arch. 2023 (2023)
Mathias Hall-Andersen, Jesper Buus Nielsen
On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles. EUROCRYPT (2) (2023)
Matthew Green, Mathias Hall-Andersen, Eric Hennenfent, Gabriel Kaptchuk, Benjamin Perez, Gijs Van Laer
Efficient Proofs of Software Exploitability for Real-world Processors. Proc. Priv. Enhancing Technol. 2023 (1) (2023)
Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. USENIX Security Symposium (2023)
Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain
Secure Multiparty Computation with Free Branching. EUROCRYPT (1) (2022)
Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions. EUROCRYPT (2) (2022)
Matteo Campanelli, Mathias Hall-Andersen
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. AsiaCCS (2022)
Matthew Green, Mathias Hall-Andersen, Eric Hennenfent, Gabriel Kaptchuk, Benjamin Perez, Gijs Van Laer
Efficient Proofs of Software Exploitability for Real-world Processors. IACR Cryptol. ePrint Arch. 2022 (2022)
Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
Efficient Set Membership Proofs using MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022 (2) (2022)
Matteo Campanelli, Mathias Hall-Andersen
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. IACR Cryptol. ePrint Arch. 2022 (2022)
Diego F. Aranha, Mathias Hall-Andersen, Anca Nitulescu, Elena Pagnin, Sophia Yakoubov
Count Me In! Extendability for Threshold Ring Signatures. Public Key Cryptography (2) (2022)
Mathias Hall-Andersen, Jesper Buus Nielsen
On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. IACR Cryptol. ePrint Arch. 2022 (2022)
Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. IACR Cryptol. ePrint Arch. 2022 (2022)
Diego F. Aranha, Mathias Hall-Andersen, Anca Nitulescu, Elena Pagnin, Sophia Yakoubov
Count Me In! Extendability for Threshold Ring Signatures. IACR Cryptol. ePrint Arch. 2021 (2021)
Mathias Hall-Andersen, Nikolaj I. Schwartzbach
Game theory on the blockchain: a model for games with smart contracts. CoRR (2021)
Mathias Hall-Andersen, Nikolaj I. Schwartzbach
Game Theory on the Blockchain: A Model for Games with Smart Contracts. SAGT (2021)
Matteo Campanelli, Mathias Hall-Andersen
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. IACR Cryptol. ePrint Arch. 2021 (2021)
Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
Efficient Set Membership Proofs using MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2021 (2021)
Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions. IACR Cryptol. ePrint Arch. 2021 (2021)
Mathias Hall-Andersen
FastSwap: Concretely Efficient Contingent Payments for Complex Predicates. IACR Cryptol. ePrint Arch. 2019 (2019)
Mathias Hall-Andersen, David Wong, Nick Sullivan, Alishah Chator
nQUIC: Noise-Based QUIC Packet Protection. IACR Cryptol. ePrint Arch. 2019 (2019)
Mathias Hall-Andersen, Philip S. Vejre
Generating Graphs Packed with Paths. IACR Cryptol. ePrint Arch. 2018 (2018)
Mathias Hall-Andersen, Philip S. Vejre
Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials. IACR Trans. Symmetric Cryptol. 2018 (3) (2018)
Mathias Hall-Andersen, David Wong, Nick Sullivan, Alishah Chator
nQUIC: Noise-Based QUIC Packet Protection. EPIQ@CoNEXT (2018)