A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Non-Interactive Zero-Knowledge Proofs of Non-Membership
[chapter]
2015
Lecture Notes in Computer Science
Often, in privacy-sensitive cryptographic protocols, a party commits to a secret message m and later needs to prove that m belongs to a language L or that m does not belong to L (but does not want to reveal any further information). We present a method to prove in a non-interactive way that a committed value does not belong to a given language L. Our construction is generic and relies on the corresponding proof of membership to L. We present an efficient realization of our proof system by
doi:10.1007/978-3-319-16715-2_8
fatcat:ccypmrgasrekxffeii6c6desgi