Seminars

View all Seminars  |  Download ICal for this event

Secure Auctions with Rational Parties

Series: Ph.D. Thesis Defense

Speaker: Girisha B S, Ph.D (Engg.) student, Dept. of CSA

Date/Time: Oct 22 13:45:00

Location: CSA Seminar Hall (Room No. 254, First Floor)

Faculty Advisor: Prof. Chaya Ganesh & Prof. Bhavana Kanukurthi

Abstract:
Sealed bid auctions are used to allocate a resource among a set of interested parties. Traditionally, auctions need the presence of a trusted auctioneer to whom the bidders provide their private bid values. Existence of such a trusted party is not an assumption easily realized in practice. Generic secure computation protocols can be used to remove a trusted party. However, generic techniques result in inefficient protocols and typically do not provide fairness -- that is, a corrupt party can learn the output and abort the protocol, thereby preventing other parties from learning the output.


In our work, we construct concretely efficient and provably secure protocol for First Price Auctions (FPA) in the rational setting. Bidders in these auctions are modelled as self-interested agents who care more about maximizing their utility than about learning information about the bids of other parties. Our protocol guarantees privacy, public verifiability, and fairness. We also put forth a novel solution concept that we call Privacy Preserving Computational Dominant Strategy Equilibrium that captures parties privacy and monetary concerns in the game theoretic context and show that our protocol realizes this. We believe this notion to be of independent interest, which can be used in a general rational security setting.


Subsequently, we improve these auction protocols such that they use 50 % less communication and run 2X faster. In order to realize this, we introduce a new cryptographic primitive called Uni-OT, which is our main technical tool in constructing the auction protocols. At a high level, Uni-OT is a two-party functionality with the sender having a single message and the receiver getting the message only if its choice bit is 0; and the sender is oblivious to whether the receiver chose to obtain the message or not. We provide generic constructions of Uni-OT. We believe that Uni-OT will have applications in building efficient secure computation protocols.

Speaker Bio:
Girisha Shankar is a PhD student in Cryptography at the Indian Institute of Science (IISc). Before pursuing his doctorate, he spent several years in the networking industry. He holds a Masters degree in Electrical Engineering from the Indian Institute of Technology, Kanpur, and a Bachelors degree in Electronics and Communication from RV College of Engineering, Bengaluru. His research focuses on foundational aspects of cryptography, with particular interest in rational adversarial models for secure computation. He is also exploring post‑quantum cryptographic solutions aimed at practical, real‑world deployment. Microsoft teams link: https://teams.microsoft.com/l/meetup-join/19%3ameeting_OTJjYzQ2ZGEtYWUzOC00YzkyLWI4ZWMtOWM5N2RhNmFkNGJi%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%221beaa166-3a14-437e-9106-75a2e2caebeb%22%7d Join the meeting now Meeting ID: 487 322 160 306 9 Passcode: XY7Bv2ex