军事学 >>> 军事学 >>> 军队指挥学 >>> 密码学 >>>
搜索结果: 1-11 共查到密码学 Concurrent Zero Knowledge相关记录11条 . 查询时间(0.089 秒)
We introduce the notion of non-uniformly sound certificates: succinct single-message (unidirectional) argument systems that satisfy a ``best-possible security'' against non-uniform polynomial-time att...
The traditional setting for concurrent zero knowledge considers a server that proves a statement in zero-knowledge to multiple clients in multiple concurrent sessions, where the server’s actions in a...
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguish...
As recent studies show, the notions of *program obfuscation* and *zero knowledge* are intimately connected. In this work, we explore this connection further, and prove the following general result. If...
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in STOC'06). This not...
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in STOC'06). This not...
A proof is concurrent zero-knowledge if it remains zero-knowledge when run in an asynchronous environment, such as the Internet. It is known that zero-knowledge is not necessarily preserved in such ...
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating and usefulzero knowledge” property is guaranteed even in situations where multiple concurrent ...
We provide unconditional constructions of concurrent statistical zero-knowledge proofs for a variety of non-trivial problems (not known to have probabilistic polynomial-time algorithms). The problem...
Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worstcase) time spent ...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...