搜索结果: 1-6 共查到“军事学 Non-black-box Simulation”相关记录6条 . 查询时间(0.068 秒)
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting
concurrent zero-knowledge non-black-box simulation
2016/1/4
We give a new proof of the existence of public-coin concurrent zero-knowledge arguments for
NP in the plain model under the existence of collision-resistant hash function families, which was
origina...
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
obfuscation zero-knowledge resettable-security
2015/12/31
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's technique ha...
Concurrent Secure Computation via Non-Black Box Simulation
Concurrent secure computation concurrent secure blind signatures
2015/12/21
We give first positive results for concurrent blind signatures and verifiable random functions
in the plain model as per the ideal/real world security definition. Our positive result is
somewhat sur...
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...
Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security
foundations / non-black-box simulations resettable security
2013/2/21
The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) introduced a novel non-bla...
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Simultaneous Resettability Conjecture New Non-Black-Box Simulation Strategy resettable zero-knowledge proofs
2009/6/11
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of
resettable zero-knowledge proofs, where the protocol must be zero-knowledge even if
a cheating verifier can reset the ...