Normal view MARC view ISBD view

Rational Secure Computation New Definitions and Constructions

By:

Agarwal, Siddharth

Contributor(s):

Material type: Text

TextPublication details: Bangalore : Indian Institute of Science, 2024.Description: vii, 91 p. : col. ill. e- Thesis 1.643MbSubject(s):

DDC classification:

005.82 AGA

Online resources:

Click here to access online

Dissertation note: MTech(Res);2024;Computer Science and Automation Summary: Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory typically uses monetary utilities to accomplish the same. While cryptography assumes that parties are either purely honest or malicious, game theory treats parties as rational agents governed by their utility functions. The specific problem we consider in this work is that of enabling secure computation when parties behave rationally. We make the following contributions: 1) We provide a rigorous definition of security that overcomes gaps in prior definitions as well as takes an “entropic” view of utilities, 2) We place rational security in the hierarchy of traditional security for two-party computation, and finally, 3) We construct a protocol for two-party computation that is rationally secure as per our definition for a class of functions called NCC functions

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	URL	Status	Date due	Barcode
Thesis	JRD Tata Memorial Library	005.82 AGA (Browse shelf(Opens below))	Link to resource	Not for loan		ET00514

Include bibliographical references

MTech(Res);2024;Computer Science and Automation

Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory typically uses monetary utilities to accomplish the same. While cryptography assumes that parties are either purely honest or malicious, game theory treats parties as rational agents governed by their utility functions. The specific problem we consider in this work is that of enabling secure computation when parties behave rationally. We make the following contributions: 1) We provide a rigorous definition of security that overcomes gaps in prior definitions as well as takes an “entropic” view of utilities, 2) We place rational security in the hierarchy of traditional security for two-party computation, and finally, 3) We construct a protocol for two-party computation that is rationally secure as per our definition for a class of functions called NCC functions

There are no comments on this title.

to post a comment.