Pages that link to "Item:Q1616917"
From MaRDI portal
The following pages link to Verifiable private polynomial evaluation (Q1616917):
Displaying 12 items.
- Private multiplication over finite fields (Q1675211) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Private computation of polynomials over networks (Q2169792) (← links)
- High-precision privacy-preserving real-valued function evaluation (Q2656940) (← links)
- Oblivious transfer and polynomial evaluation (Q2819551) (← links)
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications (Q3575049) (← links)
- Private Computations over the Integers (Q4834387) (← links)
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Q4924437) (← 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)
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme (Q6163697) (← links)
