Pages that link to "Item:Q2061972"
From MaRDI portal
The following pages link to Flexible and efficient verifiable computation on encrypted data (Q2061972):
Displayed 6 items.
- Private polynomial commitments and applications to MPC (Q6067356) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption (Q6109434) (← 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)