(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks

In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are required to receive their correct output values, irrespective of how the corrupted parties under the control of the adversary behave. The adversary should not be able to learn anything more about the input values of the honest parties, then what can be inferred from the input and output values of the corrupted parties and structure of the function. Almost all the works that have appeared in the literature so far assume the presence of authenticated channels between the parties. This assumption is far from realistic. Two directions of research have been borne from relaxing this (strong) assumption: (a) The adversary is virtually omnipotent and can control all the communication channels in the network, (b) Only a partially connected topology of authenticated channels is guaranteed and adversary controls a sobset o...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Shailesh Vaya
• Keywords: Communication Channels, CORR 2010, Education, Honest Parties, Secure Multi-party Computation