Mathias Hall-Andersen

Orcid: 0000-0002-0195-6659

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

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

2025
Silent Threshold Encryption with One-Shot Adaptive Security.
IACR Cryptol. ePrint Arch., 2025

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

Foundations of Data Availability Sampling.
IACR Commun. Cryptol., 2024

FRIDA: Data Availability Sampling from FRI.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Dora: A Simple Approach to Zero-Knowledge for RAM Programs.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Jackpot: Non-interactive Aggregatable Lotteries.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

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

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

Automated Analysis of Halo2 Circuits.
Proceedings of the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023), 2023

On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

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

Efficient Proofs of Software Exploitability for Real-world Processors.
IACR Cryptol. ePrint Arch., 2022

Count Me In! Extendability for Threshold Ring Signatures.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Secure Multiparty Computation with Free Branching.
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

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

Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Efficient Set Membership Proofs using MPC-in-the-Head.
IACR Cryptol. ePrint Arch., 2021

Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions.
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

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

nQUIC: Noise-Based QUIC Packet Protection.
Proceedings of the Workshop on the Evolution, 2018


  Loading...