Efficient RAM and control flow in verifiable outsourced computation

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Network and Distributed System Security Symposium

• Publication date

  2015-02-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.14722/NDSS.2015.23097
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data

  2015cited by this paper
• A Note on the Unsoundness of vnTinyRAM's SNARK

  2015cited by this paper
• ZØ: An Optimizing Distributing Zero-Knowledge Compiler

  2014cited by this paper
• Scalable Zero Knowledge Via Cycles of Elliptic Curves

  2014cited by this paper
• TRUESET: Faster Verifiable Set Computations

  2014cited by this paper
• Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

  2014influential reference
• Pinocchio coin: building zerocoin from a succinct pairing-based proof system

  2013cited by this paper
• ZQL: A Compiler for Privacy-Preserving Data Processing

  2013cited by this paper
• Quadratic Span Programs and Succinct NIZKs without PCPs

  2013cited by this paper
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

  2013cited by this paper
• Verifiable delegation of computation on outsourced data

  2013cited by this paper
• Pinocchio: Nearly Practical Verifiable Computation

  2013influential reference
• A Hybrid Architecture for Interactive Verifiable Computation

  2013cited by this paper
• Resolving the conflict between generality and plausibility in verified computation

  2013influential reference
• Time-Optimal Interactive Proofs for Circuit Evaluation

  2013cited by this paper
• Recursive composition and bootstrapping for SNARKS and proof-carrying data

  2013cited by this paper
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

  2013influential reference
• Verifying computations with state

  2013influential reference
• Verifiable Computation with Massively Parallel Interactive Proofs

  2012cited by this paper
• Taking Proof-Based Verified Computation a Few Steps Closer to Practicality

  2012cited by this paper
• Compiling computations to constraints for verified computation

  2012cited by this paper
• Making argument systems for outsourced computation practical (sometimes)

  2012cited by this paper
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cited by this paper
• Bootstrapping Trust in Modern Computers

  2011cited by this paper
• Practical verified computation with streaming interactive proofs

  2011cited by this paper
• Toward Practical and Unconditional Verification of Remote Computations

  2011cited by this paper
• Practical delegation of computation using multiple servers

  2011cited by this paper
• Separating succinct non-interactive arguments from all falsifiable assumptions

  2011cited by this paper
• Seeding clouds with trust anchors

  2010cited by this paper
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

  2010cited by this paper
• Token-Based Cloud Computing Secure Outsourcing of Data and Arbitrary Computations with Lower Latency

  2010cited by this paper
• Secure Remote Execution of Sequential Computations

  2009cited by this paper
• Probabilistic Proof Systems: A Primer

  2008cited by this paper
• Macah: A "C-Level" Language for Programming Kernels on Coprocessor Accelerators

  2008cited by this paper
• Delegating computation: interactive proofs for muggles

  2008cited by this paper
• Efficient Arguments without Short PCPs

  2007cited by this paper
• Pattern Recognition, Third Edition

  2006cited by this paper
• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006cited by this paper
• Enhanced Loop Coalescing: A Compiler Technique for Transforming Non-uniform Iteration Spaces

  2005cited by this paper
• Fairplay - Secure Two-Party Computation System

  2004cited by this paper
• Secure Untrusted Data Repository (SUNDR)

  2004cited by this paper
• Practical byzantine fault tolerance and proactive recovery

  2002cited by this paper
• On Arbitrary Size Waksman Networks and Their Vulnerability

  2002cited by this paper
• Defunctionalization at work

  2001cited by this paper
• Fast and secure distributed read-only file system

  2000cited by this paper
• Flow-Directed Closure Conversion for Typed Languages

  2000cited by this paper
• Distributed Execution with Remote Audit

  1999cited by this paper
• Probabilistic checking of proofs: a new characterization of NP

  1998cited by this paper
• FlatteningVLIW code generation for imperfectly nested loops

  1998cited by this paper
• Advanced Compiler Design and Implementation

  1997cited by this paper
• Byzantine quorum systems

  1997cited by this paper
• The Definition of Standard ML (Revised)

  1997cited by this paper
• Flattening and parallelizing irregular, recurrent loop nests

  1995cited by this paper
• Performing Lisp analysis of the FANNKUCH benchmark

  1994cited by this paper
• A note on efficient zero-knowledge proofs and arguments (extended abstract)

  1992cited by this paper
• Proof verification and hardness of approximation problems

  1992cited by this paper
• Checking computations in polylogarithmic time

  1991cited by this paper
• Checking the correctness of memories

  1991cited by this paper
• Definition of standard ML

  1990cited by this paper
• Algebraic methods for interactive proof systems

  1990cited by this paper
• How to make ad-hoc polymorphism less ad hoc

  1989cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Minimum Disclosure Proofs of Knowledge

  1988cited by this paper
• Loop Coalesing: A Compiler Transformation for Parallel Machines

  1987cited by this paper
• A Digital Signature Based on a Conventional Encryption Function

  1987cited by this paper
• Trading group theory for randomness

  1985cited by this paper
• A fast string searching algorithm

  1977cited by this paper
• Fast Pattern Matching in Strings

  1977cited by this paper
• Pattern recognition

  1974cited by this paper
• Definitional Interpreters for Higher-Order Programming Languages

  1972cited by this paper
• Mathematical Theory of Connecting Networks and Telephone Traffic.

  1966cited by this paper
• An algorithm for the machine calculation of complex Fourier series

  1965cited by this paper

• LogaLookup: Efficient Multivariate Lookup Argument for Accelerated Proof Generation

  2025cites this paper
• Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs

  2025cites this paper
• A survey of folding-based zero-knowledge proofs

  2025cites this paper
• Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs

  2025cites this paper
• Yoimiya: A Scalable Framework for Optimal Resource Utilization in ZK-SNARK Systems

  2025cites this paper
• Constraint-Level Design of zkEVMs: Architectures, Trade-offs, and Evolution

  2025cites this paper
• Towards Practical Zero-Knowledge Proof for PSPACE

  2025cites this paper
• GENES: An Efficient Recursive zk-SNARK and Its Novel Application in Blockchain

  2025cites this paper
• Ceno: Non-uniform, Segment and Parallel Zero-Knowledge Virtual Machine

  2025cites this paper
• CoBBL: Dynamic Constraint Generation for SNARKs

  2025influential citation
• Bounded verification for finite-field-blasting in a compiler for zero knowledge proofs

  2025cites this paper
• Zero-Knowledge Proof-of-Location Protocols for Vehicle Subsidies and Taxation Compliance

  2025cites this paper
• Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge

  2025cites this paper
• Nebula: Efficient read-write memory and switchboard circuits for folding schemes

  2024cites this paper
• An Array Intermediate Language for Mixed Cryptography

  2024cites this paper
• NOPE: Strengthening domain authentication with succinct proofs

  2024influential citation
• Dora: A Simple Approach to Zero-Knowledge for RAM Programs

  2024cites this paper
• Privacy-Preserving Control of Partitioned Energy Resources

  2024cites this paper
• Batching-Efficient RAM using Updatable Lookup Arguments

  2024cites this paper
• EdgStr: Automating Client-Cloud to Client-Edge-Cloud Transformation

  2024cites this paper
• An Efficient SNARK for Field-Programmable and RAM Circuits

  2024cites this paper
• ANNProof: Building a verifiable and efficient outsourced approximate nearest neighbor search system on blockchain

  2024cites this paper
• Bending microarchitectural weird machines towards practicality

  2024cites this paper
• zkPi: Proving Lean Theorems in Zero-Knowledge

  2024cites this paper
• Secure Synthesis of Distributed Cryptographic Applications

  2024cites this paper
• SublonK: Sublinear Prover PlonK

  2024cites this paper
• Less is more: refinement proofs for probabilistic proofs

  2023cites this paper
• A Biometric Self Authentication Scheme

  2023cites this paper
• Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAM

  2023cites this paper
• Zombie: Middleboxes that Don't Snoop

  2023cites this paper
• ZEKRA: Zero-Knowledge Control-Flow Attestation

  2023cites this paper
• Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs)

  2023cites this paper
• Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols

  2023cites this paper
• MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups

  2023cites this paper
• Customizable constraint systems for succinct arguments

  2023cites this paper
• Cheesecloth: Zero-Knowledge Proofs of Real-World Vulnerabilities

  2023influential citation
• ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge

  2023cites this paper
• Compositional Formal Verification of Zero-Knowledge Circuits

  2023cites this paper
• Batchman and Robin: Batched and Non-batched Branching for Interactive ZK

  2023cites this paper
• Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS

  2023cites this paper
• Jolt: SNARKs for Virtual Machines via Lookups

  2023cites this paper
• Proving UNSAT in Zero Knowledge

  2022cites this paper
• ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs

  2022cites this paper
• CirC: Compiler infrastructure for proof systems, software verification, and more

  2022influential citation
• Interactive Proofs for Rounding Arithmetic

  2022cites this paper
• Orion: Zero Knowledge Proof with Linear Prover Time

  2022cites this paper
• SuperNova: Proving universal machine executions without universal circuits

  2022cites this paper
• Litmus: Towards a Practical Database Management System with Verifiable ACID Properties and Transaction Correctness

  2022cites this paper
• Efficient verifiable computation over quotient polynomial rings

  2022cites this paper
• EntrapNet: A Blockchain-Based Verification Protocol for Trustless Computing

  2021cites this paper
• Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning

  2021cites this paper
• Constant-Overhead Zero-Knowledge for RAM Programs

  2021cites this paper
• Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices

  2021cites this paper
• Zero-Knowledge Middleboxes

  2021cites this paper
• Brakedown: Linear-time and post-quantum SNARKs for R1CS

  2021cites this paper
• Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached ORAM for ANSI C Programs

  2021cites this paper
• Transparency Dictionaries with Succinct Proofs of Correct Operation

  2021cites this paper
• Verifiable Isogeny Walks: Towards an Isogeny-based Postquantum VDF

  2021cites this paper
• Efficient Representation of Numerical Optimization Problems for SNARKs

  2021cites this paper
• Zero Knowledge Static Program Analysis

  2021influential citation
• Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets

  2021cites this paper
• Zero Knowledge Proofs towards Verifiable Decentralized AI Pipelines

  2021influential citation
• Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs (Technical Report)

  2021influential citation
• Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs

  2021influential citation
• Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time

  2021cites this paper
• Linear-time zero-knowledge SNARKs for R1CS

  2021cites this paper
• An Efficient HPRA-Based Multiclient Verifiable Computation: Transform and Instantiation

  2021cites this paper
• Poppins: A Direct Construction for Asymptotically Optimal zkSNARKs

  2021cites this paper
• Viaduct: an extensible, optimizing compiler for secure distributed programs

  2021cites this paper
• Leo: A Programming Language for Formally Verified, Zero-Knowledge Applications

  2021cites this paper
• Linear-time and post-quantum zero-knowledge SNARKs for R1CS

  2021cites this paper
• Identifying Influential Spreaders in a Social Network (While Preserving Privacy)

  2020cites this paper
• Multi-matrix verifiable computation

  2020cites this paper
• Verifiable state machines

  2020cites this paper
• Non-Interactive Zero-Knowledge for Blockchain: A Survey

  2020cites this paper
• Enabling Generic Verifiable Aggregate Query on Blockchain Systems

  2020cites this paper
• Quarks: Quadruple-efficient transparent zkSNARKs

  2020cites this paper
• Zero Knowledge Proofs for Decision Tree Predictions and Accuracy

  2020cites this paper
• Ligero++: A New Optimized Sublinear IOP

  2020cites this paper
• Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment

  2020cites this paper
• Unifying Compilers for SNARKs, SMT, and More

  2020influential citation
• Practical Verification of MapReduce Computation Integrity via Partial Re-execution

  2020cites this paper
• Replicated state machines without replicated execution

  2020influential citation
• MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs

  2020cites this paper
• Spartan: Efficient and general-purpose zkSNARKs without trusted setup

  2020influential citation
• Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

  2020cites this paper
• Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols

  2020cites this paper
• ZEXE: Enabling Decentralized Private Computation

  2020cites this paper
• A Homomorphic Proxy Re-authenticators based Efficient Multi-client Non-interactive Verifiable Computation Scheme

  2020cites this paper
• Verifiable Arithmetic Computations Using Additively Homomorphic Tags

  2019cites this paper
• Designing efficient zero-knowledge proofs in the ideal linear commitment model

  2019cites this paper
• An Optimized Pattern Recognition Algorithm for Anomaly Detection in IoT Environment

  2019cites this paper
• Computation Verification for Noobs

  2019cites this paper
• LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs

  2019cites this paper
• Towards dependable and trustworthy outsourced computing: A comprehensive survey and tutorial

  2019cites this paper
• Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation

  2019cites this paper
• Architectural Support for Containment-based Security

  2019cites this paper
• Aurora: Transparent Succinct Arguments for R1CS

  2019cites this paper
• TRUSTGUARD: A model for practical trust in real systems

  2019cites this paper
• Authenticated key-value stores with hardware enclaves

  2019cites this paper