| 本文已被：浏览 1047次 下载 4702次 |
码上扫一扫！ |
|
|
| 基于国密SM2的数字藏品网络拍卖隐私保护方法 |
|
邵宽1, 张镇勇1,2, 杨科迪1, 朱俊彦1, 王鑫2, 田有亮1, 马建峰1,3
|
|
1.公共大数据国家重点实验室 (贵州大学), 贵州 贵阳 550025;2.齐鲁工业大学(山东省科学院) 山东省计算中心 (国家超级计算济南中心), 山东 济南 250014;3.西安电子科技大学 网络与信息安全学院, 陕西 西安 710126
|
|
| 摘要: |
| 近年来, 数字藏品的线上交易越发频繁, 如阿里拍卖、OpenSea等, 网络拍卖作为数字藏品交易的重要手段, 有效支撑了数字藏品在市场中的流通. 然而, 网络拍卖中竞标者的竞价隐私存在泄露风险. 针对此问题, 提出一种基于国密的数字藏品网络拍卖隐私保护方案, 该方案在保护用户竞价隐私同时, 兼顾了竞价信息的可用性. 具体来说, 通过设计同态加密计算方法, 加密竞标者的竞价信息和运用同态运算对竞价信息添加噪声这两个步骤, 保障拍卖过程竞标者竞价隐私. 根据网络拍卖隐私保护协议执行效率需求设计了基于CRT-BSGS的国密SM2同态算法, 相较于Paillier算法具有显著的效率提升. 最后, 通过实验证明了所提方案的安全性和高效性. |
| 关键词: 数字藏品 网络拍卖 隐私保护 同态加密 |
| DOI：10.13328/j.cnki.jos.007171 |
| 分类号:TP309 |
| 基金项目:国家自然科学基金(62303126, 62362008); 贵州省基础研究计划(自然科学)一般项目(黔科合基础-ZK[2022] 一般149); 贵州省教育厅高等学校科学研究项目(青年项目)(黔教技[2022]104号); 算力互联网与信息安全教育部重点实验室开放课题(2023ZD037) |
|
| Privacy-preserving Online Auction Method of Digital Collection with SM2 |
|
SHAO Kuan1, ZHANG Zhen-Yong1,2, YANG Ke-Di1, ZHU Jun-Yan1, WANG Xin2, TIAN You-Liang1, MA Jian-Feng1,3
|
|
1.State Key Laboratory of Public Big Data (Guizhou University), Guiyang 550025, China;2.Shandong Computer Science Center (National Supercomputing Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan 250353, China;3.School of Cyber Engineering, Xidian University, Xi’an 710126, China
|
| Abstract: |
| In recent years, online transactions of digital collections have been increasing, with platforms such as Alibaba Auctions and OpenSea facilitating their circulation in the market. However, the bidder’s bidding privacy is at risk of being disclosed during an online auction. To address this issue, this study proposes a privacy-preserving online auction approach based on the homomorphic property of SM2, which not only protects the users’ bidding privacy but also ensures the usability of the bidding data. Specifically, this study creates a homomorphic encryption scheme based on SM2, encrypting bidders’ bidding information and constructing a piece of noisy bidding information to conceal the privacy data. The efficiency of the online auction privacy preservation approach is improved by integrating the Chinese reminder theorem and baby step giant step (CRT-BSGS) into the homomorphic encryption process with SM2, which has proved to be more efficient than the Paillier algorithm. Finally, the security and efficiency of the proposed scheme are verified in detail. |
| Key words: digital collection online auction privacy preservation homomorphic encryption |
