搜索结果: 1-11 共查到“军队指挥学 Obfuscating”相关记录11条 . 查询时间(0.046 秒)
Obfuscating simple functionalities from knowledge assumptions
Obfuscation VBB pattern matching
2019/1/26
This paper shows how to obfuscate several simple functionalities from a new Knowledge of OrthogonALity Assumption (KOALA) in cyclic groups which is shown to hold in the Generic Group Model. Specifical...
On the (non) obfuscating power of Garside Normal Forms
group based cryptography post-quantum digital signatures conjugacy search problem
2018/11/30
Braid groups are infinite non-abelian groups naturally arising from geometric braids that have been used in cryptography for the last two decades. In braid group cryptography public braids often conta...
New Techniques for Obfuscating Conjunctions
obfuscation conjunctions learning parity with noise
2018/11/7
We abstract the Bishop et al. scheme to obtain an equivalent yet more efficient "dual'' scheme that can handle conjunctions over exponential size alphabets. This scheme admits a straightforward proof ...
Obfuscating Compute-and-Compare Programs under LWE
public-key cryptography learning-with-errors
2017/3/27
We show how to obfuscate a large and expressive class of programs, which we call compute-and-compare programs, under the learning-with-errors (LWE) assumption. Each such program CC[f,y]CC[f,y] is para...
Privacy for arbitrary encrypted remote computation in the cloud depends on the running code on the server being obfuscated from the standpoint of the operator in the computer room. This paper shows fo...
In this work, we seek to extend the capabilities of the “core obfuscator” from the work of Garg, Gentry, Halevi, Raykova, Sahai, and Waters (FOCS 2013), and all subsequent works constructing general-p...
Obfuscating Circuits via Composite-Order Graded Encoding
Obfuscation Graded Encoding Schemes
2016/1/5
We present a candidate obfuscator based on composite-order Graded Encoding Schemes
(GES), which are a generalization of multilinear maps. Our obfuscator operates on circuits
directly without convert...
Efficiently Obfuscating Re-Encryption Program under DDH Assumption
Re-encryption circuit Average-case secure obfuscation DDH Assumption
2015/12/23
A re-encryption program (or a circuit) converts a ciphertext encrypted under Alice’s public
key pk1 to a ciphertext of the same message encrypted under Bob’s public key pk2. Hohenberger et
al. (TCC ...
Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups
Obfuscation generic group model pseudo-free groups
2014/3/10
We show that the class of polynomial-size branching programs can be obfuscated according to a virtual black-box notion akin to that of Barak et al. [Crypto 01], in an idealized black-box group model o...
We show how to securely obfuscate the class of conjunction functions (functions like $f(x_1, \ldots, x_n) = x_1 \land \lnot x_4 \land \lnot x_6 \land \cdots \land x_{n-2}$). Given any function in the ...
We study the problem of obfuscation in the context of point functions (also known as delta functions).A point function is a Boolean function that assumes the value 1 at exactly one point.