Secure Distributed Computation and Communication
From Anita Borg Institute Wiki
Presenter: Arpita Patra (IIT Madras)
Secure Multiparty Computation (MPC) is simultaneously, a fundamental problem, both in distributed computing and cryptography and models real-life applications like E-Voting, Oblivious Transfer, Privacy-Preserving Database Operations etc. The key primitives for designing MPC are: Verifiable Secret Sharing; Byzantine Agreement; Reliable/Secure Message Transmission. Any effective solution for these problems helps to arrive at efficient MPC solutions. My focus is to carry on deeper research on these three problems along with MPC.
Liz Kiewiet, GHC 2009 Live Notetaker. I also blog on the official Grace Hopper blog at http://ghcbloggers.blogspot.com
Research area: Secure Multiparty Computation
- Core problem in Distributed Computing and Cryptography
Key primitives:
- Verifiable Secret Sharing
- Byzantine Agreement
- Secure Message Transmission
Focus: Carry out deep research in above primitives.
Secure Two Party Computation: Millionaires Problem (millionaires don’t trust each other. Solved by person who mediates between the two.) Secure Function Evaluation Protocol acts as this “mediator”
- Everybody has private input. Adversary should not learn anything from other parties.
Multiparty Computation Using TTP Implementing MPC Protocol Structure of General MPC Protocol” – input, computational, output stages “Tools used in general MPC protocol”- Verifiable Secret Sharing, Byzantine Agreement, Secure Message Transmission
Conclusion: Attack more problems on secure communication, computation, and distributed computing
Questions: How do you verify I have a secret in VSS? -* Depends on the dealer. Part of the secret he wants to share, he will share. After the sharing, the parties will reconvene…protocol will verify that all the secrets are correct.
Liz Kiewiet, GHC 2009 Live Notetaker. I also blog on the official Grace Hopper blog at http://ghcbloggers.blogspot.com
