Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs

No abstract is available for this paper.

• Publication year

  2011

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fully Homomorphic Encryption without Bootstrapping

  2011cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Fully Homomorphic Encryption over the Integers

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

  2010cited by this paper
• Improved Delegation of Computation using Fully Homomorphic Encryption

  2010cited by this paper
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments

  2010cited by this paper
• Fully homomorphic encryption using ideal lattices

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

  2008cited by this paper
• Extractable Perfectly One-Way Functions

  2008cited by this paper
• Interactive PCP

  2008cited by this paper
• Succinct NP Proofs from an Extractability Assumption

  2008cited by this paper
• Perfect NIZK with Adaptive Soundness

  2007cited by this paper
• The PCP theorem by gap amplification

  2006cited by this paper
• Short PCPs verifiable in polylogarithmic time

  2005cited by this paper
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles

  2004cited by this paper
• Robust pcps of proximity, shorter pcps and applications to coding

  2004cited by this paper
• On the (In)security of the Fiat-Shamir paradigm

  2003cited by this paper
• Foundations of Cryptography: Basic Tools

  2002cited by this paper
• Universal arguments and their applications

  2002cited by this paper
• Computationally Sound Proofs

  2000cited by this paper
• The random oracle methodology, revisited

  2000cited by this paper
• Computationally Private Information Retrieval with Polylogarithmic Communication

  1999cited by this paper
• Magic functions

  1999cited by this paper
• Improved Efficient Arguments (Preliminary Version)

  1995cited by this paper
• Nearly-linear size holographic proofs

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

  1992cited by this paper
• IP = PSPACE

  1992cited by this paper
• Checking computations in polylogarithmic time

  1991cited by this paper
• Interactive Proof Systems and Alternating Time-Space Complexity

  1991cited by this paper
• Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks

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

  1990cited by this paper
• A Certified Digital Signature

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

  1989cited by this paper
• Minimum Disclosure Proofs of Knowledge

  1988cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper

• A Framework for Cryptographic Verifiability of End-to-End AI Pipelines

  2025cites this paper
• Shorter ZK-SNARKs from square span programs over ideal lattices

  2024cites this paper
• Delegable zk-SNARKs with proxies

  2023cites this paper
• Security Analysis of Shamir’s Secret Sharing

  2022cites this paper
• Honest Majority Multi-Prover Interactive Arguments

  2022cites this paper
• Leakage Resilient (cid:96) -more Extractable Hash and Applications to Non-Malleable Cryptography

  2022cites this paper
• Non-Interactive Batch Arguments for NP from Standard Assumptions

  2021cites this paper
• Cryptographic Framework for Role Control Remedy: A Secure Role Engineering mechanism for Single Authority Organizations

  2021cites this paper
• zk-SNARKs: A Gentle Introduction

  2020cites this paper
• Cryptographic primitives in blockchains

  2019cites this paper
• Practical Aggregate Signature from General Elliptic Curves, and Applications to Blockchain

  2019cites this paper
• A tale of SNARKs: quantum resilience, knowledge extractability and data privacy. (Un recueil de SNARKs: sécurité quantique, extractabilité et confidentialité des données)

  2019cites this paper
• A Gentle Introduction to SNARKs

  2019cites this paper
• A need to help: stories of emergent behaviour from the scene of accident

  2018cites this paper
• Delegating Computations with (Almost) Minimal Time and Space Overhead

  2018cites this paper
• Primitives towards verifiable computation: a survey

  2018cites this paper
• Aggregation of Gamma-Signatures and Applications to Bitcoin

  2018cites this paper
• Delegating Computations with ( almost ) Minimal Overhead ∗ Extended Abstract

  2018cites this paper
• Attribute-based multi-function verifiable computation

  2018cites this paper
• Non-Interactive Zero-Knowledge Proofs for Composite Statements

  2018cites this paper
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

  2017cites this paper
• Secure Collaborative Publicly Verifiable Computation

  2017cites this paper
• On deploying succinct zero-knowledge proofs

  2017cites this paper
• The Feasibility of Outsourced Database Search in the Plain Model

  2016cites this paper
• On Program Obfuscation

  2016cites this paper
• Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems

  2016cites this paper
• A SURVEY ON VARIOUS APPROACHES FOR VERIFYING CORRECTNESS AND COMPLETENESS OVER THE CLOUD DATA

  2016cites this paper
• Constant-round interactive proofs for delegating computation

  2016cites this paper
• Practical Non-Malleable Codes from l-more Extractable Hash Functions

  2016cites this paper
• Interactive Oracle Proofs

  2016cites this paper
• Secure Outsourcing of Circuit Manufacturing

  2016cites this paper
• The Hunting of the SNARK

  2016cites this paper
• Limits of Extractability Assumptions with Distributional Auxiliary Input

  2015cites this paper
• Succinct Randomized Encodings and their Applications

  2015cites this paper
• Cluster Computing in Zero Knowledge

  2015cites this paper
• Multi-Client Verifiable Computation with Stronger Security Guarantees

  2015cites this paper
• Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

  2015cites this paper
• Publicly Verifiable Delegation of Matrix Operation

  2015cites this paper
• Proof of retrievability with efficient verification

  2015cites this paper
• Arguments of Proximity - [Extended Abstract]

  2015cites this paper
• Delegating Computation

  2015cites this paper
• Verifiable Computation of Large Polynomials

  2014cites this paper
• On the existence of extractable one-way functions

  2014cites this paper
• SNARKs for C : Verifying Program Executions Succinctly and in Zero Knowledge

  2014cites this paper
• Efficiently Verifiable Computation on Encrypted Data

  2014cites this paper
• Succinct non-Interactive arguments

  2014cites this paper
• Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing

  2014cites this paper
• Verifiable computation using multiple provers

  2014cites this paper
• How to delegate computations: the power of no-signaling proofs

  2014cites this paper
• Cryptographic Algorithms for the Secure Delegation of Multiparty Computation

  2014cites this paper
• Verifiable Delegation of Computation through Fully Homomorphic Encryption

  2014cites this paper
• Private Outsourcing of Polynomial Functions

  2014cites this paper
• Verifiable computation with access control in cloud computing

  2014cites this paper
• OAKE: a new family of implicitly authenticated diffie-hellman protocols

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

  2013cites this paper
• Practical and Secure Outsourcing of Linear Algebra in the Cloud

  2013cites this paper
• On the concrete efficiency of probabilistically-checkable proofs

  2013cites this paper
• Public Verification of Outsourced Computation of Polynomial Functions

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

  2013cites this paper
• Delegation for bounded space

  2013cites this paper
• Refereed delegation of computation

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

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

  2013cites this paper
• Constant-Round Concurrent Zero Knowledge from P-Certificates

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

  2013cites this paper
• Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems (full version)

  2013cites this paper
• Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall

  2013cites this paper
• Efficient cryptographic protocols: secure two-party computation and refereed delegation of computation

  2013cites this paper
• Overcoming the Worst-Case Curse for Cryptographic Constructions

  2013cites this paper
• Succinct Non-Interactive Arguments via Linear Interactive Proofs

  2013influential citation
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cites this paper
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

  2012cites this paper
• Rational proofs

  2012cites this paper
• Two Protocols for Delegation of Computation

  2012cites this paper
• On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs

  2012cites this paper
• Secure Two-Party Computation with Low Communication

  2012cites this paper
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption

  2012cites this paper
• Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

  2012cites this paper
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

  2012cites this paper
• Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits

  2012cites this paper
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

  2012cites this paper
• 2 A Characterization of Constant-Round Rational Proofs

  2011cites this paper
• APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED

  2011cites this paper
• Two 1-Round Protocols for Delegation of Computation

  2011cites this paper
• Efficient and Secure Delegation of Linear Algebra

  2011cites this paper
• Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption

  2011cites this paper
• Basing Obfuscation on Simple Tamper-Proof Hardware Assumptions

  2011cites this paper