Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Hall-Andersen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]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): 627-640 (2023)- [c8]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. EUROCRYPT (2) 2023: 347-378 - [c7]Mathias Hall-Andersen
, Jesper Buus Nielsen:
On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles. EUROCRYPT (2) 2023: 438-469 - 2022
- [j2]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Efficient Set Membership Proofs using MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022(2): 304-324 (2022) - [c6]Matteo Campanelli, Mathias Hall-Andersen:
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. AsiaCCS 2022: 652-666 - [c5]Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain:
Secure Multiparty Computation with Free Branching. EUROCRYPT (1) 2022: 397-426 - [c4]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions. EUROCRYPT (2) 2022: 458-487 - [c3]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: 379-406 - [i12]Mathias Hall-Andersen, Jesper Buus Nielsen:
On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. IACR Cryptol. ePrint Arch. 2022: 542 (2022) - [i11]Matteo Campanelli, Mathias Hall-Andersen:
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. IACR Cryptol. ePrint Arch. 2022: 756 (2022) - [i10]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: 1223 (2022) - [i9]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. IACR Cryptol. ePrint Arch. 2022: 1419 (2022) - 2021
- [c2]Mathias Hall-Andersen, Nikolaj I. Schwartzbach:
Game Theory on the Blockchain: A Model for Games with Smart Contracts. SAGT 2021: 156-170 - [i8]Mathias Hall-Andersen, Nikolaj I. Schwartzbach:
Game theory on the blockchain: a model for games with smart contracts. CoRR abs/2107.04393 (2021) - [i7]Matteo Campanelli, Mathias Hall-Andersen:
Veksel: Simple, Efficient, Anonymous Payments with Large Anonymity Sets from Well-Studied Assumptions. IACR Cryptol. ePrint Arch. 2021: 327 (2021) - [i6]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions. IACR Cryptol. ePrint Arch. 2021: 422 (2021) - [i5]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: 1240 (2021) - [i4]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Efficient Set Membership Proofs using MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2021: 1656 (2021)
2010 – 2019
- 2019
- [i3]Mathias Hall-Andersen, David Wong, Nick Sullivan, Alishah Chator:
nQUIC: Noise-Based QUIC Packet Protection. IACR Cryptol. ePrint Arch. 2019: 28 (2019) - [i2]Mathias Hall-Andersen:
FastSwap: Concretely Efficient Contingent Payments for Complex Predicates. IACR Cryptol. ePrint Arch. 2019: 1296 (2019) - 2018
- [j1]Mathias Hall-Andersen, Philip S. Vejre:
Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials. IACR Trans. Symmetric Cryptol. 2018(3): 265-289 (2018) - [c1]Mathias Hall-Andersen, David Wong, Nick Sullivan, Alishah Chator:
nQUIC: Noise-Based QUIC Packet Protection. EPIQ@CoNEXT 2018: 22-28 - [i1]Mathias Hall-Andersen, Philip S. Vejre:
Generating Graphs Packed with Paths. IACR Cryptol. ePrint Arch. 2018: 764 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-05-01 00:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
