Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation

@article{Dolev2014AccumulatingAA,
  title={Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation},
  author={Shlomi Dolev and Niv Gilboa and Ximing Li},
  journal={IACR Cryptology ePrint Archive},
  year={2014},
  volume={2014},
  pages={611}
}
Information theoretically secure multi-party computation implies severe communication overhead among the computing participants, as there is a need to reduce the polynomial degree after each multiplication. In particular, when the input is (practically) unbounded, the number of multiplications and therefore the communication bandwidth among the participants may be practically unbounded. In some scenarios the communication among the participants should better be avoided altogether, avoiding… CONTINUE READING