CS proofs

By Silvio Micali. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Verifiable Delay Functions (2018, methodology): “IVC was first studied by Valiant [68] in the context of computationally sound proofs [53].”
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, methodology): “A similar property holds for Micali’s CS proofs [71], Kilian’s PCP compiler [65], the BCS compiler [21] of interactive oracle proofs, and so on.”
Computationally Private Information Retrieval with Polylogarithmic Communication (1999, unknown): “Our result provides the first two-round implementation of computationally sound proofs [Mic94] under a concrete complexity assumption.”
Separating succinct non-interactive arguments from all falsifiable assumptions (2011, background): “The seminal works of Kilian 92 and Micali 94 show that such arguments can be constructed under standard cryptographic hardness assumptions with four rounds of interaction, and that they be made non-interactive in the random-oracle model.”
Random oracles are practical: a paradigm for designing efficient protocols (1993, background): “An exciting recent result on computationally bounded checking, due to Micali 32, exploits in part this same technique.”
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, background): “tive variants: Originating from the works of Kilian [36] and Micali [39], recent works [4, 6, 8] have shown how to obtain e cient”
Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, methodology): “Micali [86] made a similar protocol non-interactive in the random oracle model, thereby obtaining the first zkSNARK.”
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology (2004, methodology): “The original proof is quite involved as it is based on techniques like Micali’s CS-proofs [10].”
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains (2019, background): “…vector commitments to “CS-proofs”, a special case of a compiled IOP where the IOP is a single round PCP. Instantiated with theoretical PCPs [Kil92, Mic94], this results in the shortest known setup-free non-interactive arguments (for NP) with random oracles consisting of just 2 elements in a…”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, background): “[29] first formalized the notion of verifiable computation to solve the problem of verifiably outsourcing the computation of an arbitrary functions, which has attracted the attention of plenty of researchers [11], [14], [15], [30], [32], [36], [37], [40].”