Computing Sensitive Data while keeping it private can be achieved through Secure Computation, but efficiency is the bottleneck on practical applications using it. Secure computation protocol design using Boolean circuits can be optimized using the proposed Batch-Key Cipher Encryption, and Universal Gates with GRR-2 optimizations. Optimizing the Garbled Circuit (GC) design will improve the efficiency of Secure Computation protocols in terms of communication complexity and computation complexity, which in turn will find its place in day-to-day applications, proving secure computation as the Holy Grail of distributed and decentralized applications.
In this research, two major optimizations on GC construction are proposed, and their efficiency is proved with complexity and security analysis. The first optimization, Batch-Key Cipher Optimization achieves reduction of computation complexity by 35%, and the second optimization, Universal gates with GRR-2 optimization achieves reduction in computation complexity by 67%, and communication complexity by 33%. All protocols developed under these two optimizations are proved to be secure as of the existing systems. Also, combining the power of Blockchain with secure computation, the FGUGChain framework is proposed, to improve the security of blockchain. And, to improve the computation efficiency using the power of cloud computation, the CaFGUGChain framework is proposed.
Department of Computer Science Engineering, School of Engineering, Bengaluru
Knowledge on Secure Computation, Blockchain technology, GNU C for framework development
Assistant Professor,
Department of Computer Science and Engineering,
School of Engineering,
Amrita Vishwa Vidyapeetham, Bengaluru