Published Articles >> Table of Contents >> Abstract

Eighth IEEE International Symposium on High Assurance Systems Engineering (HASE'04)   pp. 241-248
Multiparty Computation with Full Computation Power and Reduced Overhead
Qingkai Ma, University of Texas at Dallas
Wei Hao, University of Texas at Dallas
I-Ling Yen, University of Texas at Dallas
Farokh Bastani, University of Texas at Dallas

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HASE.2004.1281748
Send link to a friend

Abstract
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.
Back to Top Additional Information
Citation:  Qingkai Ma, Wei Hao, I-Ling Yen, Farokh Bastani, "Multiparty Computation with Full Computation Power and Reduced Overhead," hase, pp. 241-248,  Eighth IEEE International Symposium on High Assurance Systems Engineering (HASE'04),  2004