Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/117566
15 Visitors
17 Hits
0 Downloads
- Title
- Multi-party computation with omnipresent adversary
- Related
- International Workshop on Practice and Theory in Public Key Cryptography (12th : 2009) (18 - 20 March 2009 : Irvine, CA, USA)
- Related
- Jarecki, Stanislaw and Tsudik, Gene. Public key cryptography : PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18-20, 2009 : proceedings, p.180-195
- DOI
- 10.1007/978-3-642-00468-1_11
- Related
- Lecture notes in computer science Vol. 5443
- Publisher
- Berlin ; New York : Springer
- Date
- 2009
- FoR/RFCD Code(s)
-
080200 Computation Theory and Mathematics
080300 Computer Software
080400 Data Format
- Author/Creator
- Ghodosi, Hossein
- Author/Creator
- Pieprzyk, Josef
- Description
- Secure multi-party computation (MPC) protocols enable a set of n mutually distrusting participants P1, ..., Pn, each with their own private input xi, to compute a function Y = F(x1, ..., xn), such that at the end of the protocol, all participants learn the correct value of Y, while secrecy of the private inputs is maintained. Classical results in the unconditionally secure MPC indicate that in the presence of an active adversary, every function can be computed if and only if the number of corrupted participants, t a , is smaller than n/3. Relaxing the requirement of perfect secrecy and utilizing broadcast channels, one can improve this bound to ta< n/2. All existing MPC protocols assume that uncorrupted participants are truly honest, i.e., they are not even curious in learning other participant secret inputs. Based on this assumption, some MPC protocols are designed in such a way that after elimination of all misbehaving participants, the remaining ones learn all information in the system. This is not consistent with maintaining privacy of the participant inputs. Furthermore, an improvement of the classical results given by Fitzi, Hirt, and Maurer indicates that in addition to ta actively corrupted participants, the adversary may simultaneously corrupt some participants passively. This is in contrast to the assumption that participants who are not corrupted by an active adversary are truly honest. This paper examines the privacy of MPC protocols, and introduces the notion of an omnipresent adversary, which cannot be eliminated from the protocol. The omnipresent adversary can be either a passive, an active or a mixed one. We assume that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold. We will also show that the existence of a t-resilient protocol for a group of n participants, implies the existence of a t’-private protocol for a group of n′ participants. That is, the elimination of misbehaving participants from a t-resilient protocol leads to the decomposition of the protocol. Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario). Therefore, privacy of all participants who properly follow the protocol will be maintained. We present a novel disqualification protocol to avoid a loss of privacy of participants who properly follow the protocol.
- Description
- 16 page(s)
- Subject Keyword
- 080200 Computation Theory and Mathematics
- Subject Keyword
- 080300 Computer Software
- Subject Keyword
- 080400 Data Format
- Subject Keyword
- multi-party computation
- Subject Keyword
- omnipresent adversary
- Subject Keyword
- proactive secret sharing
- Subject Keyword
- t-resilient protocols
- Subject Keyword
- t-private protocols
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/117566
- Identifier
- ISBN:9783642004674
- Identifier
- mq-rm-2009004498
- Language
- eng
- Reviewed
