Pages that link to "Item:Q5402969"
From MaRDI portal
The following pages link to Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing (Q5402969):
Displaying 7 items.
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- Confidentiality-Preserving Publicly Verifiable Computation (Q4605653) (← links)
