By Topic

Improving Applicability, Efficiency and Security of Non-Membership Proof

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Peng, Kun ; Inst. for Infocomm Res., Singapore, Singapore ; Feng Bao

Two new non-membership proof protocols are proposed in this paper, which prove that a committed message is not in a finite set. They are concrete proof protocols rather than abstract principles. The first is a completely general non-membership proof suitable for any application. The second is a much more efficient non-membership proof protocol for special applications. It is simpler, more efficient and more applicable than the existing concrete solution to non-membership proof. Except for possible mathematical assumptions needed for the employed commitment algorithm, our non-membership proof protocols themselves do not need any additional mathematical assumption, so are proofs instead of arguments. They are flexible solutions suitable for various secure commitment algorithm. Once a commitment algorithm is chosen and proved to be secure, the new non-membership proof scheme can adopt it and achieve formally provable security without any additional assumption. This is also an advantage over the existing solution.

Published in:

Data, Privacy and E-Commerce (ISDPE), 2010 Second International Symposium on

Date of Conference:

13-14 Sept. 2010