Verifiable ASICs

78 citations recorded by the source corpus.

How researchers see this paper

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

Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware (2018, background): “Wahby et al. (2016; 2017) aim at this goal for arbitrary computations outsourced between co-located ASICs.”
Full Accounting for Verifiable Outsourcing (2017, methodology): “Prior work [81, 82] cut this to O ( d log G ) , by precomputing { f j ( τ )} , and not charging for that.”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, background): “Therefore, in prior work such as [47,53], this is considered as a trade-off.”
Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, methodology): “[102] transform the Giraffe IP [100] (a doubly-efficient IP in the GKR [60] line of work [47, 95, 99, 100]) into a zkSNARK without requiring a trusted setup.”
SecChisel Framework for Security Verification of Secure Processor Architectures (2019, background): “There are also projects which explore design verification after manufacturing, e.g., [22] [7], which are complimentary to our work.”
Aurora: Transparent Succinct Arguments for R1CS (2019, background): “The sumcheck protocol plays a fundamental role in computational complexity (it underlies celebrated results such as IP = PSPACE [72] and MIP = NEXP [10]) and in efficient proof protocols [48, 39, 75, 73, 74, 76, 77, 82, 83, 79].”