Pages that link to "Item:Q3582771"
From MaRDI portal
The following pages link to Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (Q3582771):
Displaying 44 items.
- On Garbling Schemes with and Without Privacy (Q2827734) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation (Q2890014) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- On Privacy-Preserving Biometric Authentication (Q2980853) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)
- Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Revocation in Publicly Verifiable Outsourced Computation (Q3454572) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Confidentiality-Preserving Publicly Verifiable Computation (Q4605653) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Identity-based re-encryption scheme with lightweight re-encryption key generation (Q5031868) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation (Q6100507) (← links)
- Function-Dependent Commitments for Verifiable Multi-party Computation (Q6108843) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail (Q6162313) (← links)
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme (Q6163697) (← links)
- Game-Theoretic Analysis of an Incentivized Verifiable Computation System (Q6166529) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
- Verification protocol for stable matching from conditional disclosure of secrets (Q6547974) (← links)
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
- On black-box verifiable outsourcing (Q6581787) (← links)
- zk-SNARKs from codes with rank metrics (Q6595937) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
- How to prove statements obliviously? (Q6660309) (← links)