scientific article; zbMATH DE number 1136108

zbMath0902.03026MaRDI QIDQ4381418

Silvio Micali

Publication date: 3 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interactive proofscomplexity theoryproof systemrandom oracleproververifier

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Lower bound on SNARGs in the random oracle model ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Non-interactive zero-knowledge from non-interactive batch arguments

This page was built for publication: