Pages that link to "Item:Q3575049"
From MaRDI portal
The following pages link to Efficient and Secure Evaluation of Multivariate Polynomials and Applications (Q3575049):
Displaying 8 items.
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version (Q2120989) (← links)
- Oblivious evaluation of multivariate polynomials (Q2846947) (← links)
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (Q4924433) (← links)
- Multi-Party Secure Computation of Multi-Variable Polynomials (Q6080444) (← links)
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme (Q6163697) (← links)