TR2013-002

Information-Theoretically Secure Three-Party Computation with One Corrupted Party


    •  Wang, Y.; Ishwar, P.; Rane, S., "Information-Theoretically Secure Three-Party Computation with One Corrupted Party," Tech. Rep. TR2013-002, arXiv, February 2013.
      BibTeX Download PDF
      • @techreport{Wang2013feb,
      • author = {Wang, Y. and Ishwar, P. and Rane, S.},
      • title = {Information-Theoretically Secure Three-Party Computation with One Corrupted Party},
      • journal = {arXiv},
      • year = 2013,
      • month = feb,
      • url = {http://www.merl.com/publications/TR2013-002}
      • }
  • MERL Contact:
  • Research Area:

    Multimedia


The problem in which one of three pairwise interacting parties is required to securely compute a function of the inputs held by the other two, when one party may arbitrarily deviate from the computation protocol (active behavioral model), is studied. An information-theoretic characterization of unconditionally secure computation protocols under the active behavioral model is provided. A protocol for Hamming distance computation is provided and shown to be unconditionally secure under both active and passive behavioral models using the information theoretic characterization. The difference between the notions of security under the active and passive behavioral models is illustrated through the BGW protocol for computing quadratic and Hamming distances; this protocol is secure under the passive model, but is shown to be not secure under the active model.