搜索结果: 1-5 共查到“军队指挥学 Constant Degree”相关记录5条 . 查询时间(0.062 秒)
How to leverage hardness of constant degree expanding polynomials over R to build iO
public-key cryptography Obfuscation
font style='font-size:12px;'>
2019/9/16
In this work, we introduce and construct DD-restricted Functional Encryption (FE) for any constant D≥3D≥3, based only on the SXDH assumption over bilinear groups. This generalizes the notion of 33-res...
How to leverage hardness of constant-degree expanding polynomials over $\mathbb{R}$ to build iO
FE Indistinguishability Obfuscation
font style='font-size:12px;'>
2018/11/6
DD -restricted FE allows for useful evaluation of constant-degree polynomials, while only requiring the SXDH assumption over bilinear groups. As such, it is a powerful tool for leveraging hardness tha...
Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings
Obfuscation Constant-Degree Graded Encoding Schemes SXDH
font style='font-size:12px;'>
2016/12/10
All constructions of general purpose indistinguishability obfuscation (IO) rely on either meta-assumptions that encapsulate an exponential family of assumptions (e.g., Pass, Seth and Telang, CRYPTO 20...
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
Indistinguishability Obfuscation Graded Encoding Scheme Constant Degree
font style='font-size:12px;'>
2016/3/9
We construct a general-purpose indistinguishability obfuscation (IO) scheme for all polynomial-size circuits from {\em constant-degree} graded encoding schemes in the plain model, assuming the existen...
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
VBB obfuscation graded encodings
font style='font-size:12px;'>
2015/12/31
A celebrated result by Barak et al (JACM’12) shows the impossibility
of general-purpose virtual black-box (VBB) obfuscation in the
plain model. A recent work by Canetti, Kalai, and Paneth (TCC’15)
...