Efficient non-interactive zero-knowledge proofs for privacy applications
Efficient non-interactive zero-knowledge proofs for privacy applications(2008)
摘要
Non-interactive zero-knowledge (NIZK) proofs can be an extremely powerful tool, allowing one to prove a statement in a single message without revealing any information besides the truth of the statement. Blum et al. showed that NIZK proof systems exist for all languages in NP. However, in practice, NIZK proofs are rarely used, because existing protocols are extremely inefficient. Here we examine some useful languages for which we can give efficient proof system.We define two useful building blocks: one for proving that a message has been signed, and a second for proving that a value has been chosen according to a pseudorandom function. We give applications of these building blocks to anonymous credential systems, to electronic cash, and to the design of other efficient NIZK proofs systems.
更多查看译文
关键词
nizk proof system,privacy application,useful building block,single message,useful language,efficient proof system,building block,efficient non-interactive zero-knowledge proof,anonymous credential system,nizk proof,efficient nizk proofs system,non-interactive zero-knowledge
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络