國立虎尾科技大學 |

Information-Theoretic Secure Outsourced Computation in Distributed Systems.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Information-Theoretic Secure Outsourced Computation in Distributed Systems./
Author:	Wang, Zhaohong.
Description:	1 online resource (117 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 78-03, Section: B.
Contained By:	Dissertations Abstracts International78-03B.
Subject:	Electrical engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9781369089714

Information-Theoretic Secure Outsourced Computation in Distributed Systems.
Wang, Zhaohong.

Information-Theoretic Secure Outsourced Computation in Distributed Systems. - 1 online resource (117 pages)

Source: Dissertations Abstracts International, Volume: 78-03, Section: B.

Thesis (Ph.D.)--University of Kentucky, 2016.

Includes bibliographical references

Secure multi-party computation (secure MPC) has been established as the de facto paradigm for protecting privacy in distributed computation. One of the earliest secure MPC primitives is the Shamir's secret sharing (SSS) scheme. SSS has many advantages over other popular secure MPC primitives like garbled circuits (GC) - it provides information-theoretic security guarantee, requires no complex long-integer operations, and often leads to more efficient protocols. Nonetheless, SSS receives less attention in the signal processing community because SSS requires a larger number of honest participants, making it prone to collusion attacks. In this dissertation, I propose an agent-based computing framework using SSS to protect privacy in distributed signal processing. There are three main contributions to this dissertation. First, the proposed computing framework is shown to be significantly more efficient than GC. Second, a novel game-theoretical framework is proposed to analyze different types of collusion attacks. Third, using the proposed game-theoretical framework, specific mechanism designs are developed to deter collusion attacks in a fully distributed manner. Specifically, for a collusion attack with known detectors, I analyze it as games between secret owners and show that the attack can be effectively deterred by an explicit retaliation mechanism. For a general attack without detectors, I expand the scope of the game to include the computing agents and provide deterrence through deceptive collusion requests. The correctness and privacy of the protocols are proved under a covert adversarial model. Our experimental results demonstrate the efficiency of SSS-based protocols and the validity of our mechanism design.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9781369089714Subjects--Topical Terms:

596380
Electrical engineering.
Subjects--Index Terms:

Collusion deterrenceIndex Terms--Genre/Form:

554714
Electronic books.

Information-Theoretic Secure Outsourced Computation in Distributed Systems.
LDR:03166ntm a22003857 4500 001 1144180
005 20240531083751.5
006 m o d
007 cr mn ---uuuuu
008 250605s2016 xx obm 000 0 eng d
020 $a 9781369089714
035 $a (MiAaPQ)AAI10153850
035 $a AAI10153850
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Wang, Zhaohong. $3 1469119
245 1 0 $a Information-Theoretic Secure Outsourced Computation in Distributed Systems.
264 0 $c 2016
300 $a 1 online resource (117 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 78-03, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Cheung, Sen-ching Samson.
502 $a Thesis (Ph.D.)--University of Kentucky, 2016.
504 $a Includes bibliographical references
520 $a Secure multi-party computation (secure MPC) has been established as the de facto paradigm for protecting privacy in distributed computation. One of the earliest secure MPC primitives is the Shamir's secret sharing (SSS) scheme. SSS has many advantages over other popular secure MPC primitives like garbled circuits (GC) - it provides information-theoretic security guarantee, requires no complex long-integer operations, and often leads to more efficient protocols. Nonetheless, SSS receives less attention in the signal processing community because SSS requires a larger number of honest participants, making it prone to collusion attacks. In this dissertation, I propose an agent-based computing framework using SSS to protect privacy in distributed signal processing. There are three main contributions to this dissertation. First, the proposed computing framework is shown to be significantly more efficient than GC. Second, a novel game-theoretical framework is proposed to analyze different types of collusion attacks. Third, using the proposed game-theoretical framework, specific mechanism designs are developed to deter collusion attacks in a fully distributed manner. Specifically, for a collusion attack with known detectors, I analyze it as games between secret owners and show that the attack can be effectively deterred by an explicit retaliation mechanism. For a general attack without detectors, I expand the scope of the game to include the computing agents and provide deterrence through deceptive collusion requests. The correctness and privacy of the protocols are proved under a covert adversarial model. Our experimental results demonstrate the efficiency of SSS-based protocols and the validity of our mechanism design.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
653 $a Collusion deterrence
653 $a Mechanism design
653 $a Secret sharing
653 $a Secure multi-party computation
653 $a Secure outsourced computation
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Kentucky. $b Engineering. $3 1469120
773 0 $t Dissertations Abstracts International $g 78-03B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10153850 $z click for full text (PQDT)