Skip to main content
SpringerLink
Log in

A 3-Party Simultaneous Protocol for SUM-INDEX

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We show that the SUM-INDEX function can be computed by a 3-party simultaneous protocol in which one player sends only O(nɛ) bits and the other sends O(n1-C(ɛ)) bits (0<C(ɛ)<1 ). This implies that, in the Valiant—Nisan—Wigderson approach for proving circuit lower bounds, the SUM-INDEX function is not suitable as a target function.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, People's Republic of China

    Sun

Authors
  1. Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun A 3-Party Simultaneous Protocol for SUM-INDEX. Algorithmica 36, 89–111 (2003). https://doi.org/10.1007/s00453-002-1007-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-002-1007-0

Keywords

Search

Navigation