Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (11): 111-113.DOI: 10.3778/j.issn.1002-8331.2009.11.034

• 网络、通信、安全 • Previous Articles     Next Articles

Cryptanalysis of (M+1)-st auction scheme

ZHANG Chun-sheng1,YAO Shao-wen2,WANG Shi-pu2   

  1. 1.College of Computer and Information,Anqing Teachers College,Anqing,Anhui 246011,China
    2.College of Software,Yunnan University,Kunming 650091,China
  • Received:2008-02-25 Revised:2008-05-05 Online:2009-04-11 Published:2009-04-11
  • Contact: ZHANG Chun-sheng

一个M+1电子拍卖方案的密码学分析

张春生1,姚绍文2,王世普2   

  1. 1.安庆师范学院 计算机与信息学院,安徽 安庆 246011
    2.云南大学 软件学院,昆明 650091
  • 通讯作者: 张春生

Abstract: This paper analyzes Wu et al’s (M+1)-st auction scheme and shows that in their scheme,the presupposition of different bids of different bidders isn’t tenable.On the other hand,when several bidders simultaneously bid the maximum price or second,the scheme can’t implement(M+1)-st auction(namely tie problem).So their scheme isn’t applied value.This paper furnishes effective technique to solve the problem.

Key words: M+1)-st auction, secure multi-party computation, tie, zero-knowledge proof, privacy protection

摘要: 分析了伍前红等人最近提出的M+1电子拍卖方案,指出该方案假设不同投标者的标价不同的前提条件是不能成立的;另一方面,当有多个投标者同时投了最高价或次高价时,协议将不能实现M+1价位电子拍卖(称为结点问题),因此方案不具有实用价值。给出了解决这一问题的有效算法。

关键词: M+1密封拍卖, 安全多方计算, 结点, 零知识证明, 隐私保护