.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Concurrent executions of a zero-knowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zero-knowledge
in toto
. In this article, we study the problem of maintaining zero-knowledge.We introduce the notion of an (α, β)
timing constraint
: for any two processors
P
1
and
P
2
, if
P
1
measures α elapsed time on its local clock and
P
2
measures β elapsed time on its local clock, and
P
2
starts
after
P
1
does, then
P
2
will finish after
P
1
does. We show that if the adversary is constrained by an (α, β) assumption then there exist four-round almost concurrent zero-knowledge interactive proofs and perfect concurrent zero-knowledge arguments for every language in
NP
. We also address the more specific problem of
Deniable Authentication
, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case; our concurrent solutions yield sequential solutions
without recourse to timing
, that is, in the standard model.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息