首页>
外国专利>
Cryptographic methods for demonstrating satisfiable formulas from propositional logic
Cryptographic methods for demonstrating satisfiable formulas from propositional logic
展开▼
机译:通过命题逻辑证明可满足公式的密码学方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
Cryptographic methods are disclosed, which allow a prover party, who holds a number of secrets, to demonstrate satisfiable formulas of propositional logic, wherein the atomic propositions are linear relations between the secrets. The demonstration reveals no more information than is contained in the formula itself. Some implementations allow an unlimited number of such demonstrations to be made, without revealing any additional information about the secrets, whereas other implementations ensure that the secrets, or some of the secrets, will be revealed, if a demonstration is performed more than a predetermined number of times. The demonstrations may be zero-knowledge proofs, or signed proofs.
展开▼