Efficient and Secure Evaluation of Multivariate Polynomials and Applications

DOI10.1007/978-3-642-13708-2_15MaRDI QIDQ3575049zbMATH OpenOpenAlexFDO

Authors Matthew Franklin, Payman Mohassel

Publication date 6 July 2010

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13708-2_15

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Recommendations

• Multi-Party Secure Computation of Multi-Variable Polynomials
• Complexity and performance of secure floating-point polynomial evaluation protocols
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
• Efficient evaluation of multivariate polynomials
• Verifiable private polynomial evaluation
• Security Analysis of Multivariate Polynomials for Hashing

Cited in

(10)

• Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
• Complexity and performance of secure floating-point polynomial evaluation protocols
• Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
• Multi-Party Secure Computation of Multi-Variable Polynomials
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• Multi-party computation of polynomials and branching programs without simultaneous interaction
• A geometric approach to homomorphic secret sharing
• Public Key Cryptography - PKC 2006
• Oblivious evaluation of multivariate polynomials
• Homomorphic secret sharing for low degree polynomials

This page was built for publication: Efficient and Secure Evaluation of Multivariate Polynomials and Applications

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