Pages that link to "Item:Q6163697"
From MaRDI portal
The following pages link to An Efficient and Provably Secure Private Polynomial Evaluation Scheme (Q6163697):
Displaying 11 items.
- Verifiable private polynomial evaluation (Q1616917) (← links)
- Private multiplication over finite fields (Q1675211) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version (Q2120989) (← links)
- Private computation of polynomials over networks (Q2169792) (← links)
- High-precision privacy-preserving real-valued function evaluation (Q2656940) (← links)
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications (Q3575049) (← links)
- Private Computations over the Integers (Q4834387) (← links)
- Encrypted polynomial control based on tailored two‐party computation (Q4990598) (← links)
- Information Security and Privacy (Q5315291) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)