Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2011, Vol. 28 ›› Issue (2): 262-265.DOI: 10.7523/j.issn.2095-6134.2011.2.019

• Research Articles • Previous Articles     Next Articles

On the security proof of a protocol for private integer comparison

SHAO Xiu-Feng1, LI Rong-Hua2   

  1. 1. Artificial Intelligence Institute, Beijing City University, Beijing 100083, China;
    2. State Key Lab of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China
  • Received:2009-12-21 Revised:2010-06-25 Online:2011-03-15

Abstract:

In 1990 ACM Conference on Computer and Communications Security, Cachin proposed a protocol for private bidding and auctions and gave the security proof. We show that there is a mistake in Cachin’s security proof, and we correct the mistake.

Key words: information security, secure protocol, provable security, secure multiparty computation, millionaires&rsquo, problem

CLC Number: