Pages that link to "Item:Q2306905"
From MaRDI portal
The following pages link to Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905):
Displaying 11 items.
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- Verifiable private polynomial evaluation (Q1616917) (← links)
- Cryptanalysis of Tran-Pang-Deng verifiable homomorphic encryption (Q1641169) (← links)
- Secure publicly verifiable computation with polynomial commitment in cloud computing (Q1784473) (← links)
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
- New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds (Q2195443) (← links)
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (Q2441503) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
