Show simple item record

dc.contributor.advisorGanesh, Chaya
dc.contributor.advisorKanukurthi, Bhavana
dc.contributor.authorShankar, Girisha
dc.date.accessioned2025-11-03T07:02:18Z
dc.date.available2025-11-03T07:02:18Z
dc.date.submitted2025
dc.identifier.urihttps://etd.iisc.ac.in/handle/2005/7300
dc.description.abstractSealed 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 introduce a novel way to handle collusion by suitably disincentivizing the bidders from forming collusion. We also put forth a new 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.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseries;ET01125
dc.rightsI grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertationen_US
dc.subjectAuctionsen_US
dc.subjectRational cryptographyen_US
dc.subjectSecure computationen_US
dc.subjectMPCen_US
dc.subjectPost-quantum cryptographyen_US
dc.subjectCryptographyen_US
dc.subjectUni-OTen_US
dc.subjectPublic Key Encryptionen_US
dc.subject.classificationResearch Subject Categories::TECHNOLOGY::Information technology::Computer scienceen_US
dc.titleSecure Auctions with Rational Partiesen_US
dc.typeThesisen_US
dc.degree.namePhDen_US
dc.degree.levelDoctoralen_US
dc.degree.grantorIndian Institute of Scienceen_US
dc.degree.disciplineEngineeringen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record