搜索结果: 1-4 共查到“密码学 derandomization”相关记录4条 . 查询时间(0.093 秒)
On Perfect Correctness without Derandomization
Indistinguishability Obfuscation Correctness Functional Encryption
2019/9/16
We give a method to transform any indistinguishability obfuscator that suffers from correctness errors into an indistinguishability obfuscator that is perfectlyperfectly correct, assuming hardness of ...
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
black-box barriers one-way functions derandomization
2018/11/19
The key observation underlying our approach is that Rudich's impossibility result applies not only to one-way functions as the underlying primitive, but in fact to a variety of "unstructured'' primiti...
A Note on Perfect Correctness by Derandomization
Derandomization Public-Key Encryption Indistinguishability Obfuscation
2015/12/21
In this note, we show how to transform a large class of erroneous cryptographic schemes into
perfectly correct ones. The transformation works for schemes that are correct on every input
with probabi...
Derandomization in Cryptography
interactive proofs witness-indistinguishable proofs commitment schemes
2009/3/10
Our witness-indistinguishable proofs are obtained by using the NW-type generator to derandomize
the ZAPs of Dwork and Naor (FOCS ‘00). To our knowledge, this is the first construction
of an NP proof...