Pages that link to "Item:Q2061972"
From MaRDI portal
The following pages link to Flexible and efficient verifiable computation on encrypted data (Q2061972):
Displaying 10 items.
- Fine-grained secure computation (Q1631318) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- A domain-specific language for computing on encrypted data. (Invited talk) (Q2911606) (← links)
- Batch Computations Revisited: Combining Key Computations and Batch Verifications (Q3084250) (← links)
- Information Security and Cryptology - ICISC 2005 (Q5899299) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
- How to prove statements obliviously? (Q6660309) (← links)