Mathias Hall-Andersen

Orcid: 0000-0002-0195-6659

According to our database1, Mathias Hall-Andersen authored at least 24 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FRIDA: Data Availability Sampling from FRI.
IACR Cryptol. ePrint Arch., 2024

Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT.
IACR Cryptol. ePrint Arch., 2024

Curve Forests: Transparent Zero-Knowledge Set Membership with Batching and Strong Security.
IACR Cryptol. ePrint Arch., 2024

Fully-Succinct Arguments over the Integers from First Principles.
IACR Cryptol. ePrint Arch., 2024

2023
Efficient Proofs of Software Exploitability for Real-world Processors.
Proc. Priv. Enhancing Technol., January, 2023

Automated Analysis of Halo2 Circuits.
IACR Cryptol. ePrint Arch., 2023

Foundations of Data Availability Sampling.
IACR Cryptol. ePrint Arch., 2023

Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs.
IACR Cryptol. ePrint Arch., 2023

Secure Multiparty Computation with Free Branching.
IACR Cryptol. ePrint Arch., 2023

Jackpot: Non-Interactive Aggregatable Lotteries.
IACR Cryptol. ePrint Arch., 2023

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Efficient Set Membership Proofs using MPC-in-the-Head.
Proc. Priv. Enhancing Technol., 2022

On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles.
IACR Cryptol. ePrint Arch., 2022

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.
IACR Cryptol. ePrint Arch., 2022

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators.
IACR Cryptol. ePrint Arch., 2022

Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions.
IACR Cryptol. ePrint Arch., 2021

Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions.
IACR Cryptol. ePrint Arch., 2021

Count Me In! Extendability for Threshold Ring Signatures.
IACR Cryptol. ePrint Arch., 2021

Game Theory on the Blockchain: A Model for Games with Smart Contracts.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2019
FastSwap: Concretely Efficient Contingent Payments for Complex Predicates.
IACR Cryptol. ePrint Arch., 2019

nQUIC: Noise-Based QUIC Packet Protection.
IACR Cryptol. ePrint Arch., 2019

2018
Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials.
IACR Trans. Symmetric Cryptol., 2018

Generating Graphs Packed with Paths.
IACR Cryptol. ePrint Arch., 2018


  Loading...