The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Probabilistically checkable proofs with zero knowledge
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Universal Accumulators with Efficient Nonmembership Proofs
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Linear Algebra with Sub-linear Zero-Knowledge Arguments
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Batch verification of validity of bids in homomorphic e-auction
Computer Communications
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient bid validity check in ElGamal-based sealed-bid e-auction
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Efficiency improvement of homomorphic e-auction
TrustBus'10 Proceedings of the 7th international conference on Trust, privacy and security in digital business
Efficient Proof of Validity of Votes in Homomorphic E-Voting
NSS '10 Proceedings of the 2010 Fourth International Conference on Network and System Security
Non-interactive zero-knowledge arguments for voting
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
| Hi-index | 0.00 |
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.