基于数字背包的密封投标拍卖分析
Analysis of Digital Knapsack Based Sealed Bid Auction
摘要：
完全安全的在线拍卖的需要导致了许多拍卖协议的发明。但随着新的攻击手段的发展，拍卖协议也需要相应的加强。我们分析了拍卖协议的基础上著名的数学公钥背包问题的非对称公钥背包陷门密码系统的设计。尽管背包系统在密码学上不安全，但它可以用于某些拍卖情况。我们描述了该协议的局限性，如检测和解决投标人之间的联系，参与者的恶意行为，以及卖方设定的价格和提供解决方案的选择。
英文摘要：
The need of totally secure online auction has led to the invention of many auction protocols. But as new attacks are developed, auction protocols also require corresponding strengthening. We analyze the auction protocol based on the well-known mathematical public-key knapsack problem for the design of asymmetric public-key knapsack trapdoor cryptosystem. Even though the knapsack system is not cryptographically secure, it can be used in certain auction situations. We describe the limitations of the protocol like detecting and solving the tie between bidders, malicious behavior of participants and also selection of price set by the seller and offer solutions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
