Multiparty computation with full computation power and reduced overhead

To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system can still be assured. All existing approaches incur high overhead. Some do not support full computation power. In this paper, we propose a secure computation algorithm with the goals of reducing the communication overhead and providing full computation power. We reduce the communication overhead by aggregating multiple operations. Our algorithm has full computation power, and yields better performance than existing approaches. The proposed algorithm focuses on confidentiality assurance. Replication schemes can be combined with the algorithm to assure system integrity.