Pages that link to "Item:Q4910295"
From MaRDI portal
The following pages link to Multi-Client Non-interactive Verifiable Computation (Q4910295):
Displaying 13 items.
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing (Q2666869) (← links)
- Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
- Revocation in Publicly Verifiable Outsourced Computation (Q3454572) (← links)
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
