Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Cryptology
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A proposal of encoded computations for distributed massively multiplayer online services
Proceedings of the 2006 ACM SIGCHI international conference on Advances in computer entertainment technology
Encoding for secure computations in distributed interactive real-time applications
Computer Communications
Secure Multi-party Protocols for Privacy Preserving Data Mining
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
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.