Pages that link to "Item:Q2055689"
From MaRDI portal
The following pages link to Boosting verifiable computation on encrypted data (Q2055689):
Displaying 7 items.
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Batch Computations Revisited: Combining Key Computations and Batch Verifications (Q3084250) (← 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)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- How to prove statements obliviously? (Q6660309) (← links)