Non-interactive verifiable computing: outsourcing computation to untrusted workers
From MaRDI portal
Publication:3582771
Recommendations
- Multi-client non-interactive verifiable computation
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Multi-client outsourced computation
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
Cited in
(only showing first 100 items - show all)- Verifiable Computation and Succinct Arguments for NP
- How to prove statements obliviously?
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Function-Dependent Commitments for Verifiable Multi-party Computation
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Vector commitments over rings and compressed \(\varSigma \)-protocols
- Delegation of computation with verification outsourcing: curious verifiers
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Secure computation without computers
- Adaptively secure garbled circuits from one-way functions
- Refereed delegation of computation
- Publicly verifiable database scheme with efficient keyword search
- Multi-client outsourced computation
- Verification protocol for stable matching from conditional disclosure of secrets
- Adaptive security of practical garbling schemes
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Multi-clients verifiable computation via conditional disclosure of secrets
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Secure two-party computation: a visual way
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- Perennial secure multi-party computation of universal Turing machine
- New publicly verifiable computation for batch matrix multiplication
- No-signaling linear PCPs
- Optimal contracts for outsourced computation
- Trusted computing with addition machines. II
- Practical homomorphic message authenticators for arithmetic circuits
- On black-box verifiable outsourcing
- Reactive garbling: foundation, instantiation, application
- Revocation in publicly verifiable outsourced computation
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Fine-grained secure computation
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Integrity and consistency for untrusted services (extended abstract)
- Multi-client non-interactive verifiable computation
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- Multi-input functional encryption and its application in outsourcing computation
- Verifiable multi-party computation with perfectly private audit trail
- Secure and traceable framework for data circulation
- Adaptive succinct garbled RAM or: how to delegate your database
- Succinct non-interactive arguments via linear interactive proofs
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- zk-SNARKs from codes with rank metrics
- Delegating a product of group exponentiations with application to signature schemes
- Verifiable pattern matching on outsourced texts
- Efficient proof composition for verifiable computation
- Private polynomial commitments and applications to MPC
- Verifiable pattern matching on outsourced texts
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- On privacy-preserving biometric authentication
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Garbled circuits as randomized encodings of functions: a primer
- Flexible and efficient verifiable computation on encrypted data
- Round-optimal black-box commit-and-prove with succinct communication
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Secure outsourced computation
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Multi-key Homomorphic Authenticators
- Arguments of proximity (extended abstract)
- Rinocchio: SNARKs for ring arithmetic
- Verifiable computation for randomized algorithm
- Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
- On subversion-resistant SNARKs
- Non-interactive publicly-verifiable delegation of committed programs
- Batch verifiable computation of outsourced functions
- Linearly homomorphic structure-preserving signatures and their applications
- CRT-based outsourcing algorithms for modular exponentiations
- LOVE a pairing
- MyOPE: malicious security for oblivious polynomial evaluation
- Non-interactive and verifiable outsourcing computation scheme for modular exponentiation
- Verifiable computation with reduced informational costs and computational costs
- Practical verified computation with streaming interactive proofs
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Secure and efficient outsourcing computation on large-scale linear regressions
- On the Power of Secure Two-Party Computation
- Secure and efficient delegation of elliptic-curve pairing
- Computational integrity with a public random string from quasi-linear PCPs
- Efficient algorithms for secure outsourcing of bilinear pairings
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Identity-based re-encryption scheme with lightweight re-encryption key generation
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Boosting verifiable computation on encrypted data
- Confidentiality-preserving publicly verifiable computation
- Thrackles: an improved upper bound
- No-signaling linear PCPs
- Efficient and secure outsourced approximate pattern matching protocol
- Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
- The feasibility of outsourced database search in the plain model
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
This page was built for publication: Non-interactive verifiable computing: outsourcing computation to untrusted workers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582771)
