A general, flexible and efficient proof of inclusion and exclusion

Abstract

Inclusion proof shows that a secret committed message is in a finite group of messages, while exclusion proof shows that a secret committed message is not in a finite group of messages. A general, flexible and efficient solution to inclusion proof and exclusion proof is proposed in this paper. It overcomes the drawbacks of the existing solutions to inclusion proof and exclusion proof. It achieves all the desired security properties in inclusion proof and exclusion proof. It is the most efficient general solution to inclusion proof and exclusion proof and only costs O(n√) for any inclusion proof and exclusion proof regarding any finite group of n messages. © 2011 Springer-Verlag Berlin Heidelberg.