Our solutions provide cryptographic guarantees on the confidentiality of our profiles, habits, comments, photos, etc. We also have solutions for secure authentication using social networks with the fourth paradigm of authentication: “Someone You Know“.
Our solutions work with dynamic data (both keywords and documents can be efficiently changed, added, removed), providing security against fully malicious servers, under both random oracle and the standard model. We also provide forward privacy: if a document is added containing a previously searched keyword, many existing solutions leak this information, while our solution does not leak such additional information.
Using our techniques, both users and companies will benefit. Users will enjoy increased security and provable cryptographic guarantees, while companies can charge premium fees for offering such guarantees, or bring more customers who were worried about security issues. We hold several patents on this topic.
Cloud computing presents unique challenges that need to be addressed by cryptography and security experts, as well as game theory and mechanism design principles. Our goal is to combine different techniques to ensure result reliability and inline participation incentives. Further goals may include computation privacy, such as privacy of queries and data in outsourced databases.
We also have efficient solutions for fair and secure two-party and multi-party computation (2PC and MPC). These solutions enable two or more parties to compute a function together, where each party provides some input, but the other parties do not learn any useful information about that input (except, of course, the output of the function). We enable such protocols to be done fairly efficiently, where either all parties receive the output of the computation, or no one receives anything useful.
We also separate the job of the regular database management system (DBMS), and the database authentication system (DBAS). We leave the DBMS unmodified, and introduce a DBAS system that can work with any DMBS solution. We further let the data owner and queriers to be different parties.
There has been a great deal of research on fairly exchanging two items. But when one considers peer-to-peer systems, efficiency and performance of the fair exchange protocol matters. We created an efficient and scalable optimistic fair exchange protocol suitable for use in high-churn peer-to-peer file sharing systems. Our fairness solutions are also applicable to scenarios including secure two-party or multi-party computation, as well as cloud storage systems.
Furthermore, while analyzing the limits of fair exchange protocols, we looked at distributing centralized parties, such as the trusted third party, the arbiter. Our results include impossibility cases and optimality proofs.
Contact us with a research proposal if interested. See the Work with Us page.