Multi-party computation of polynomials and branching programs without simultaneous interaction

DOI10.1007/978-3-642-38348-9_34MaRDI QIDQ4924433zbMATH OpenOpenAlexFDO

Authors S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee

Publication date 31 May 2013

Published in Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38348-9_34

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secure computation on the web: computing without simultaneous interaction
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Secure multiparty computation with free branching
• Oblivious evaluation of multivariate polynomials
• Secure multiparty computation without one-way functions

Cited in

(10)

• Polynomial expressions of \(p\)-ary auction functions
• Secure multiparty computation with free branching
• Is information-theoretic topology-hiding computation possible?
• Evaluating Branching Programs on Encrypted Data
• On the bottleneck complexity of MPC with correlated randomness
• Secure computation on the web: computing without simultaneous interaction
• Multi-party Indirect Indexing and Applications
• Topology-hiding computation on all graphs
• Multi-Party Secure Computation of Multi-Variable Polynomials
• How to obfuscate MPC inputs

This page was built for publication: Multi-party computation of polynomials and branching programs without simultaneous interaction

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