搜索结果: 1-11 共查到“密码学 Concurrent Zero Knowledge”相关记录11条 . 查询时间(0.089 秒)
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
non-uniform certificates concurrent zero-knowledge
2019/6/4
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...
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
Constant Rounds Guaranteed Complexity
2016/1/7
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...
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Concurrent ZK Constant-Round Indistinguishability Obfuscation
2016/1/5
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...
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
Concurrent Zero Knowledge Non-black-box Simulation
2014/3/6
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 Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge
2009/9/27
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 Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge Interactive Proofs and Arguments
2009/9/22
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...
Concurrent Zero-Knowledge in Poly-logarithmic Rounds
Concurrent Zero-Knowledge Poly-logarithmic Rounds
2009/4/17
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
Concurrent Zero-Knowledge public coin HVZK protocol
2009/4/14
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
Concurrent Zero Knowledge Proofs Logarithmic Round-Complexity
2009/4/14
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating
and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent
...
Concurrent Zero Knowledge without Complexity Assumptions
concurrent zero-knowledge proofs problem-dependent commitments quadratic residuosity
2009/2/26
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 ...