IIIT Hyderabad Publications |
|||||||||
|
Some Problems In Multi Party ComputationAuthor: Rajeevalochana M R Date: 2017-07-01 Report no: IIIT/TH/2017/35 Advisor:Kannan Srinathan AbstractThe rst problem is on anonymous communication, specically the so called "Anonymous Leader". A leader is one who has some special function such as decision making, etc. An anonymous leader is a leader who is anonymous, i.e.. no body knows who he is. The problem asks how a leader can perform its special function without revealing itself. We note that communication is the primary constraint to being anonymous. The anonymous leader must be able to send and receive messages without revealing its identitiy. Morever, other nodes/players must not be able to pretend to be the anonymous leader. There are many possible applications of this anonymous leader setting and here we will also describe one such application. Formally, we give denition of anonymous leader and give protocols with proof that enable anonymous communication while satisfying the dual requirements the leader must not be revealed, and other nodes/players should not be able to pretend to be the leader. Interestingly, this is the rst such formalisation in the literature to date; while anonymous communication itself is common, restricting it to only one anonymous node/party has not been attempted before The second problem is on broadcast, specifically ”Simultaneous Broadcast”. There are situations where the broadcasted message is required to reach nodes at the same time. This is especially true in auction bidding and gambling. Admitedly, it is possible to ensure that the time difference between reciepients is small enough to ensure that perfect simultanity is not required. Nevertheless this problem is interesting in its own right, especially considering the difficulty and the lack of any theory in the literature. Here, we try to solve the problem using ”time lock puzzles”. Time lock puzzles enable us to lock messages in such a way that a fixed amount of time is required to be invested to unlock the message. This can be used to setup synchrony in message receipt. However, the constraints and limitations are considerable, forcing this solution to be ultimately purely a first attempt at the problem. Formally, we give definition and protocol for simultaneous broadcast using time lock puzzles. Full thesis: pdf Centre for Security, Theory and Algorithms |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |