A Secure and Efficient Protocol for Electronic Treasury Auctions

被引:0
作者
Bektas, Atilla [1 ]
Kiraz, Mehmet Sabir [2 ]
Uzunkol, Osmanbey [2 ]
机构
[1] Middle E Tech Univ, IAM, TR-06531 Ankara, Turkey
[2] TUBITAK BILGEM, MCS Labs, Kocaeli, Turkey
来源
CRYPTOGRAPHY AND INFORMATION SECURITY IN THE BALKANS | 2015年 / 9024卷
关键词
Treasury auctions; Secure multi-party computation; Threshold homomorphic encryption; Confidentiality; Privacy;
D O I
10.1007/978-3-319-21356-9_9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:123 / 140
页数:18
相关论文
共 27 条
  • [11] Cramer R., 2005, CONT CRYPTOLOGY ADV
  • [12] Damgard Ivan, 2008, International Journal of Applied Cryptography, V1, P22, DOI 10.1504/IJACT.2008.017048
  • [13] Garay J.A., 2003, LNCS, V2357
  • [14] Garay J, 2007, LECT NOTES COMPUT SC, V4450, P330
  • [15] Goldreich O., 1987, P 19 ANN ACM S THEOR, P218, DOI DOI 10.1145/28395.28420
  • [16] Hazay C, 2012, LECT NOTES COMPUT SC, V7178, P313, DOI 10.1007/978-3-642-27954-6_20
  • [17] TASTY: Tool for Automating Secure Two-partY computations
    Henecka, Wilko
    Koegl, Stefan
    Sadeghi, Ahmad-Reza
    Schneider, Thomas
    Wehrenberg, Immo
    [J]. PROCEEDINGS OF THE 17TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'10), 2010, : 451 - 462
  • [18] Jonsson K. V., 2011, SECURE MULTIPARTY SO
  • [19] Katti R. S., 2012, CORR
  • [20] Lipmaa H, 2003, LECT NOTES COMPUT SC, V2357, P87