Blind polynomial evaluation and data trading
From MaRDI portal
Publication:2117031
DOI10.1007/978-3-030-78372-3_5zbMATH Open1489.68086OpenAlexW3126461432MaRDI QIDQ2117031FDOQ2117031
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_5
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
ElGamal encryptionblockchainPaillier encryptionblind polynomial evaluationencryption-switching protocol
Cites Work
- Differential Privacy
- Fully homomorphic encryption using ideal lattices
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Oblivious Polynomial Evaluation
- Oblivious evaluation of multivariate polynomials
- How to Use Bitcoin to Design Fair Protocols
- Universal circuits (Preliminary Report)
- Modeling Bitcoin Contracts by Timed Automata
- Encryption switching protocols revisited: switching modulo \(p\)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Encryption Switching Protocols
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
