A Cryptographically t-Private Auction System

Abstract

We present a feasible cryptographically t-private protocol for electronic auctions. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNG). Our protocol involves a field of (t+1)^2 parties for the generation of the garbled circuit and permits an arbitrary large number of bidders. The computational requirements are low… (More)
DOI: 10.1109/NSS.2009.41

Topics

3 Figures and Tables

Slides referencing similar topics