搜索结果: 1-4 共查到“密码学 correlation intractability”相关记录4条 . 查询时间(0.093 秒)
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE
NIZK LWE
font style='font-size:12px;'>
2019/1/4
We construct non-interactive zero-knowledge (NIZK) arguments for NPNP from any circular-secure fully homomorphic encryption (FHE) scheme. In particular, we obtain such NIZKs under a circular-secure va...
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
KDM CI
font style='font-size:12px;'>
2018/2/6
A hash function family is called correlation intractable if for all sparse relations, it is hard to find, given a random function from the family, an input-output pair that satisfies the relation (Can...
On the Correlation Intractability of Obfuscated Pseudorandom Functions
Virtual-Grey-Box obfuscation evasive circuits
font style='font-size:12px;'>
2015/12/31
A family of hash functions is called “correlation intractable” if it is hard to find, given a random
function in the family, an input-output pair that satisfies any “sparse” relation, namely any rela...
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
foundations / indifferentiability correlation intractability Feistel construction
font style='font-size:12px;'>
2012/3/26
We show that the Feistel construction with six rounds and random round functions is publicly indifferentiable from a random invertible permutation (a result that is not known to hold for full indiffer...