Augmented oblivious polynomial evaluation protocol and its applications
From MaRDI portal
Recommendations
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Efficient proofs that a committed number lies in an interval
- scientific article; zbMATH DE number 2085426 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- Noisy polynomial interpolation and noisy Chinese remaindering
- Oblivious keyword search
- Oblivious transfer and polynomial evaluation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
Cited in
(5)- Unconditionally secure distributed oblivious polynomial evaluation
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- scientific article; zbMATH DE number 2081076 (Why is no real title available?)
- Information Security and Privacy
- MyOPE: malicious security for oblivious polynomial evaluation
This page was built for publication: Augmented oblivious polynomial evaluation protocol and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862667)