Abstract
We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmic blow-up. Our most efficient instantiation (built from length-flexible additively homomorphic public key encryption) improves the communication complexity of secure multi-party computation for a number of problems in the literature. Underlying our approach is a new multi-party variant of oblivious transfer which may be of independent interest. © International Association for Cryptology Research 2007.
Author supplied keywords
Cite
CITATION STYLE
Franklin, M., Gondree, M., & Mohassel, P. (2007). Multi-party indirect indexing and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 283–297). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
