Blind polynomial evaluation and data trading
From MaRDI portal
Publication:2117031
Recommendations
- Oblivious Polynomial Evaluation
- Oblivious multi-variate polynomial evaluation
- Oblivious evaluation of multivariate polynomials
- Oblivious polynomial evaluation and oblivious neural learning
- scientific article; zbMATH DE number 2081076
- Blind identification of polynomial matrix fraction with applications
- Polynomial computations for blind image deconvolution
- A novel blind estimation algorithm
- Privacy-preserving polynomial interpolation and its applications on predictive analysis
Cites work
- scientific article; zbMATH DE number 1440055 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Differential Privacy
- Encryption switching protocols
- Encryption switching protocols revisited: switching modulo \(p\)
- Fully homomorphic encryption using ideal lattices
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use bitcoin to design fair protocols
- Modeling Bitcoin contracts by timed automata
- Oblivious Polynomial Evaluation
- Oblivious evaluation of multivariate polynomials
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Universal circuits (Preliminary Report)
- Valiant's universal circuits revisited: an overall improvement and a lower bound
Cited in
(2)
This page was built for publication: Blind polynomial evaluation and data trading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117031)
