An Efficient and Provably Secure Private Polynomial Evaluation Scheme

DOI10.1007/978-3-319-99807-7_38zbMATH Open1515.68129OpenAlexW2892261686MaRDI QIDQ6163697FDOQ6163697

Authors: Zhe Xia, Bo Yang, Mingwu Zhang, Yi Mu 

Publication date: 30 June 2023

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99807-7_38

Recommendations

• Verifiable private polynomial evaluation
• Private computation of polynomials over networks
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Computationally private randomizing polynomials and their applications
• Complexity and performance of secure floating-point polynomial evaluation protocols
• Symmetric Private Polynomial Computation From Lagrange Encoding
• Multi-Party Secure Computation of Multi-Variable Polynomials
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Information Security and Privacy

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Privacy of data (68P27)

Cites Work

• Short signatures without random oracles and the SDH assumption in bilinear groups
• Title not available (Why is that?)
• Oblivious transfer and polynomial evaluation
• The random oracle methodology, revisited.
• Title not available (Why is that?)
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Two protocols for delegation of computation
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• Signatures of correct computation
• Title not available (Why is that?)
• Verifiable private polynomial evaluation
• Constant-Size Commitments to Polynomials and Their Applications
• Multi-client non-interactive verifiable computation

Cited In (12)

• Encrypted polynomial control based on tailored two‐party computation
• Private Computations over the Integers
• Verifiable private polynomial evaluation
• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Private polynomial commitments and applications to MPC
• MyOPE: malicious security for oblivious polynomial evaluation
• High-precision privacy-preserving real-valued function evaluation
• Private computation of polynomials over networks
• Information Security and Privacy
• Private multiplication over finite fields
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications

This page was built for publication: An Efficient and Provably Secure Private Polynomial Evaluation Scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163697)