Automata, Languages and Programming
From MaRDI portal
Publication:5716769
DOI10.1007/11523468zbMath1082.68574OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716769
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (8)
Succinct non-interactive arguments via linear interactive proofs ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ The hunting of the SNARK ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ Constant-round arguments from one-way functions ⋮ On succinct arguments and witness encryption from groups
This page was built for publication: Automata, Languages and Programming
