Multi-Party Indirect Indexing and Applications

Matthew Franklin; Mark Gondree; Payman Mohassel

Paper 2007/341

Multi-Party Indirect Indexing and Applications

Matthew Franklin, Mark Gondree, and Payman Mohassel

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. This is the full version of an article to appear at Asiacrypt 2007.
Keywords: communication complexity oblivious RAM machine privacy-preserving protocols secure multiparty computation
Contact author(s): gondree @ cs ucdavis edu
History: 2007-09-05: received
Short URL: https://ia.cr/2007/341
License: CC BY

BibTeX

@misc{cryptoeprint:2007/341,
      author = {Matthew Franklin and Mark Gondree and Payman Mohassel},
      title = {Multi-Party Indirect Indexing and Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2007/341},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/341}},
      url = {https://eprint.iacr.org/2007/341}
}