The Repository @ St. Cloud State

Open Access Knowledge and Scholarship

Date of Award

12-2023

Culminating Project Type

Thesis

Styleguide

ieee

Degree Name

Computer Science: M.S.

Department

Computer Science and Information Technology

College

School of Science and Engineering

First Advisor

Alanka Mailewa

Second Advisor

Dale Buske

Third Advisor

Mark Schmidt

Fourth Advisor

Aleksander Tomovic

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Keywords and Subject Headings

Blind Bidding Auction, Fully Homomorphic Encryption, FHE

Abstract

In blind-bidding auctions, determining the winner requires processing bids without revealing non-winning bid information. This study explores the use of Fully Homomorphic Encryption (FHE) as a solution for this challenge. FHE permits operations like addition and multiplication on encrypted data, enabling potentially arbitrary computations without exposing underlying values. However, leveraging FHE for blind-bidding auctions is not straightforward. Classic sorting algorithms are not directly applicable due to FHE’s constraints. This thesis presents our approach to designing a blind-bidding auction using FHE, focusing specifically on determining the maximum bid within the given computational boundaries.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.