Rapid Demonstration of Linear Relations Connected by Boolean Operators [chapter]

Stefan Brands
<span title="">1997</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Consider a polynomial-time prover holding a set of secrets. We describe how the prover can rapidly demonstrate any satis able boolean formula for which the atomic propositions are relations that are linear in the secrets, without revealing more information about the secrets than what is conveyed by the formula itself. Our protocols support many proof modes, and are as secure as the Discrete Logarithm assumption or the RSA/factoring assumption.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-69053-0_22">doi:10.1007/3-540-69053-0_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zr6akke3w5awbhaymccq3jsg3e">fatcat:zr6akke3w5awbhaymccq3jsg3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227131446/http://pdfs.semanticscholar.org/80e3/bfa2f5d5c418d7b6d819c29f23955e06b959.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/80/e3/80e3bfa2f5d5c418d7b6d819c29f23955e06b959.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-69053-0_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>