An Efficient and Provably Secure Private Polynomial Evaluation Scheme

DOI10.1007/978-3-319-99807-7_38zbMath1515.68129OpenAlexW2892261686MaRDI QIDQ6163697

Mingwu Zhang, Yi Mu, Zhe Xia, Bo Yang

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verifiable private polynomial evaluation
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Oblivious transfer and polynomial evaluation
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Constant-Size Commitments to Polynomials and Their Applications
• The random oracle methodology, revisited
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Signatures of Correct Computation
• Multi-Client Non-interactive Verifiable Computation
• Two Protocols for Delegation of Computation

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