scientific article; zbMATH DE number 4185024
From MaRDI portal
Publication:5750398
zbMath0718.68033MaRDI QIDQ5750398
Silvio Micali, Joe Kilian, Oded Goldreich, Michael Ben-Or, Shafi Goldwasser, Johan T. Håstad, Phillip Rogaway
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items
The knowledge complexity of quadratic residuosity languages, Probabilistic proof systems — A survey, Time- and space-efficient arguments from groups of unknown order, Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs, Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Zero knowledge and circuit minimization, On Emulating Interactive Proofs with Public Coins, The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D., Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract), NIWI and new notions of extraction for algebraic languages, What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?, Faster sounder succinct arguments and \textsf{IOP}s, Succinct interactive oracle proofs: applications and limitations, Which languages have 4-round zero-knowledge proofs?, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks, Zero-Knowledge Proofs of Proximity, On relationships between statistical zero-knowledge proofs, A convertible multi-authenticated encryption scheme for group communications, Locally random reductions: Improvements and applications, A language-dependent cryptographic primitive, Quantum Commitments from Complexity Assumptions, A uniform-complexity treatment of encryption and zero-knowledge, An Equivalence Between Zero Knowledge and Commitments, Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs, The Complexity of Zero Knowledge, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Composition of Zero-Knowledge Proofs with Efficient Provers, Interactive and probabilistic proof-checking, Constant-Round Interactive Proofs for Delegating Computation, Spartan: efficient and general-purpose zkSNARKs without trusted setup, QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge, Statistical zero-knowledge languages can be recognized in two rounds, Relativized perfect zero knowledge is not BPP, Quantum commitments from complexity assumptions
