We understand the importance of covering cryptographic applications with sound theoretical foundations and therefore focus on theoretical correctness and soundness of different cryptographic primitives that are in use and those that might be used in the future. Since complexity assumptions, namely computational hardness assumptions drive many of these primitives, we investigate these underlying computational assumptions for their validity and feasibility. We also explore new assumptions that enable efficiency improvements while being close to the long standing trusted assumptions.
We also work on open problems in foundational primitives such as Multi party computation, Garbled circuits and Zero-knowledge proofs. These primitives enable a conceptual generalization of a wide variety of cryptographic primitives and therefore we lay emphasis on developing new secure schemes with formally proven properties which not only serve specific purposes but also spawn further research in the direction. It is also our sincere effort to solve real world problems with foundational breakthrough results in these primitives.
