On round-efficient argument systems

DOI10.1007/11523468_12MaRDI QIDQ5716769zbMATH OpenOpenAlexFDO

Authors Hoeteck Wee

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Polylogarithmic two-round argument systems
• Rational arguments: single round delegation with sublinear verification
• Computational properties of argument systems satisfying graph-theoretic constraints
• Algorithms for decision problems in argument systems under preferred semantics
• scientific article; zbMATH DE number 4166925
• Logical argumentation by dynamic proof systems
• Declarative algorithms and complexity results for assumption-based argumentation
• On computing the set of acceptable arguments in abstract argumentation

Cited in

(16)

• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• The hunting of the SNARK
• On succinct arguments and witness encryption from groups
• Succinct non-interactive arguments via linear interactive proofs
• Spooky interaction and its discontents: compilers for succinct two-message argument systems
• Probabilistically Checkable Arguments
• Polylogarithmic two-round argument systems
• Universal Arguments and their Applications
• On the connection between leakage tolerance and adaptive security
• Theory of Cryptography
• On interactive oracle proofs for Boolean R1CS statements
• Impossibilities in succinct arguments: black-box extraction and more
• Constant-round arguments from one-way functions
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• Adaptive security in SNARGs via iO and lossy functions
• Improved constant-sized polynomial commitment schemes without trusted setup

This page was built for publication: On round-efficient argument systems

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