Encryption means for proving satisfiable logical formula from propositional logic

摘要

(57) Proof side to hold a certain number on the secret of [summary] multiple, from propositional logic is a logical relationship secret between atomic propositions, encryption means to prove satisfiable logical expression is disclosed. More information than is included in the logical expression itself does not reveal the proof. Without revealing additional information about the secret, there is a means that allows an unlimited number is no such proof. On the other hand, there is also a means to ensure that if it is run more than the number of times proof has been decided beforehand, part of the secret or secret all becomes clear. Proof, may be a signed proof or zero-knowledge proof.