Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Secure and Efficient Protocol for Electronic Treasury Auctions
Date
2014-10-17
Author
Bektas, Atilla
Kiraz, Mehmet Sabir
Uzunkol, Osmanbey
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
181
views
0
downloads
Cite This
Auctions have become an important part of electronic commerce. Considering the gradually increasing importance of confidentiality and privacy in auction modeling, various designs have been proposed to ensure secure transmission especially in sealed-bid auctions. However, to the best of our knowledge there is no secure and privacy preserving Treasury Auction system. Looking at systems currently in use, many countries perform those auctions manually. Since all the bids are transferred to the system in clear form, confidentiality and privacy are not guaranteed. Therefore, the system is more vulnerable to potential threats especially due to the ongoing advances and developments in technology. In a secure electronic auction system, it is possible to determine the winner or the winners without revealing any private information. In this work, we propose a new, secure and efficient electronic auction protocol for Treasury Auctions based on secure multi-party computation, secret sharing and threshold homomorphic cryptosystem.
Subject Keywords
Privacy
,
Confidentiality
,
Threshold homomorphic encryption
,
Treasury auctions
,
Secure multi-party computation
,
Secure multi-party computation
URI
https://hdl.handle.net/11511/66217
DOI
https://doi.org/10.1007/978-3-319-21356-9_9
Collections
Graduate School of Applied Mathematics, Conference / Seminar
Suggestions
OpenMETU
Core
On secure electronic auction process of government domestic debt securities in Turkey
Bektaş, Atilla; Akyıldız, Ersan; Kiraz, Mehmet Sabır; Department of Cryptography (2013)
Auctions, today, have become an important part of electronic commerce. With the gradually increasing importance of confidentiality and privacy in auction modeling, considering these two concepts, various designs have been proposed to ensure secure transmission especially in sealed-bid auctions. However, to the best of our knowledge, there has not been many approaches to the Treasury auctions. Looking at the current systems, many countries including Turkey perform Treasury auctions mostly manually. While it ...
An Evolutionary Algorithm for Finding Efficient Solutions in Multi-Attribute Auctions
Koksalan, Murat; Karakaya, Gülşah (2014-05-01)
There is a growing interest in electronic auctions. Many researchers consider a single-attribute, although auctions are multi-attribute in nature in practice. Addressing multiple attributes increases the difficulty of the problem substantially. We develop an evolutionary algorithm (EA) for multi-attribute multi-item reverse auctions. We try to generate the whole Pareto front using the EA. We also develop heuristic procedures to find several good initial solutions and insert those in the initial population o...
A study combinatorial auctions
Bilge, Betül; Alpaslan, Ferda Nur; Department of Information Systems (2004)
By the emergence of electronic commerce and low transaction costs on the Internet, an interest in the design of new auction mechanisms has been arisen. Recently many researchers in computer science, economics, business, and game theory have presented many valuable studies on the subject of online auctions, and auctions theory. When faced from a computational perspective, combinatorial auctions are perhaps the most challenging ones. Combinatorial auctions, that is, auctions where bidders can bid on combinati...
An interactive approach for Bi-attribute multi-item auctions
Karakaya, Gülşah (2016-10-01)
The advances in the technological infrastructure and in the Internet led electronic auctions to become popular. With online sites, people buy/sell inexpensive products/services through auctions. In this paper, we develop an interactive approach that provides aid to both the buyer and the bidders in a bi-attribute, multi-item auction environment. Our approach is applicable for both reverse and forward auctions. We test our approach for underlying linear preference functions of the buyer. We also adapt it as ...
Approaches for multi-attribute auctions
Karakaya, Gülşah; Köksalan, Murat; Department of Industrial Engineering (2009)
There is a growing interest in electronic auctions in the literature. Many researchers work on the single attribute version of the problem. Multi-attribute version of the problem is more realistic. However, this brings a substantial difficulty in solving the problem. In order to overcome the computational difficulties, we develop an Evolutionary Algorithm (EA) for the case of multi-attribute multi-item reverse auctions. We generate the whole Pareto front using the EA. We also develop heuristic procedures to...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Bektas, M. S. Kiraz, and O. Uzunkol, “A Secure and Efficient Protocol for Electronic Treasury Auctions,” 2014, vol. 9024, p. 123, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66217.