Verifiable Computation and Succinct Arguments for NP

DOI10.1002/9781394188369.CH11zbMATH Open1519.94118MaRDI QIDQ6111785

Dario Fiore

Publication date: 4 August 2023

Published in: Asymmetric Cryptography (Search for Journal in Brave)

zbMATH Keywords

succinct non-interactive argumentpolynomial-size arithmetic circuits

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Strong co-nondeterministic lower bounds for NP cannot be proved feasibly ⋮ Automata, Languages and Programming ⋮ Automata, Languages and Programming ⋮ Title not available (Why is that?) ⋮ On the virtue of succinct proofs

This page was built for publication: Verifiable Computation and Succinct Arguments for NP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111785)