HyperNova: Recursive arguments for customizable constraint systems
A Kothapalli, S Setty - Annual International Cryptology Conference, 2024 - Springer
We introduce HyperNova, a new recursive argument for proving incremental computations
whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a customizable …
whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a customizable …
Experimenting with collaborative {zk-SNARKs}:{Zero-Knowledge} proofs for distributed secrets
A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …
checkable argument that the prover has a witness to a public NP statement, without …
Efficient RAM and control flow in verifiable outsourced computation
Recent work on proof-based verifiable computation has resulted in built systems that employ
tools from complexity theory and cryptography to address a basic problem in systems …
tools from complexity theory and cryptography to address a basic problem in systems …
SuperNova: Proving universal machine executions without universal circuits
A Kothapalli, S Setty - Cryptology ePrint Archive, 2022 - eprint.iacr.org
This paper introduces SuperNova, a new recursive proof system for incrementally producing
succinct proofs of correct execution of programs on a stateful machine with a particular …
succinct proofs of correct execution of programs on a stateful machine with a particular …
Verifying computations with state
When a client outsources a job to a third party (eg, the cloud), how can the client check the
result, without re-executing the computation? Recent work in proof-based verifiable …
result, without re-executing the computation? Recent work in proof-based verifiable …
Zombie: Middleboxes that {Don't} Snoop
Zero-knowledge middleboxes (ZKMBs) are a recent paradigm in which clients get privacy
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …
Resolving the conflict between generality and plausibility in verified computation
The area of proof-based verified computation (outsourced computation built atop
probabilistically checkable proofs and cryptographic machinery) has lately seen renewed …
probabilistically checkable proofs and cryptographic machinery) has lately seen renewed …
{Zero-Knowledge} Middleboxes
This paper initiates research on zero-knowledge middleboxes (ZKMBs). A ZKMB is a
network middlebox that enforces network usage policies on encrypted traffic. Clients send …
network middlebox that enforces network usage policies on encrypted traffic. Clients send …
Full accounting for verifiable outsourcing
Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation;
outsourcing makes sense when the combination of these costs is cheaper than not …
outsourcing makes sense when the combination of these costs is cheaper than not …
CirC: Compiler infrastructure for proof systems, software verification, and more
Cryptographic tools like proof systems, multi-party computation, and fully homomorphic
encryption are usually applied to computations expressed as systems of arithmetic …
encryption are usually applied to computations expressed as systems of arithmetic …