搜索结果: 76-90 共查到“军事学 obfuscation”相关记录157条 . 查询时间(0.018 秒)
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption
foundations obfuscation
2016/1/23
We revisit the question of constructing secure general-purpose indistinguishability obfuscation (iO), with a security reduction based on explicit computational assumptions over multilinear maps. Pre...
One-Way Functions and (Im)perfect Obfuscation
one-way functions indistinguishability obfuscation
2016/1/9
A program obfuscator takes a program and outputs a “scrambled” version of it, where the
goal is that the obfuscated program will not reveal much about its structure beyond what is
apparent from exec...
Using Indistinguishability Obfuscation via UCEs
correlation-secure hash functions hardcore functions indistinguishability obfuscation
2016/1/9
We provide the first standard model construction for a powerful class of Universal Computational
Extractors (UCEs; Bellare et al. Crypto 2013) based on indistinguishability obfuscation.
Our construc...
Indistinguishability Obfuscation versus Multi-Bit Point Obfuscation with Auxiliary Input
indistinguishability obfuscation differing-inputs obfuscation point function obfuscation
2016/1/9
In a recent celebrated breakthrough, Garg et al. (FOCS 2013) gave the first candidate
for so-called indistinguishability obfuscation (iO) thereby reviving the interest in obfuscation for
a general p...
Fully Secure and Fast Signing from Obfuscation
public-key cryptography obfuscation digital signatures
2016/1/8
In this work we explore new techniques for building short signatures from obfuscation. Our goals are
twofold. First, we would like to achieve short signatures with adaptive security proofs. Second, w...
On Virtual Grey Box Obfuscation for General Circuits
Obfuscation Multilinear Graded Encodings Semantic Security
2016/1/8
An obfuscator O is Virtual Grey Box (VGB) for a class C of circuits if, for any C ∈ C and
any predicate π, deducing π(C) given O(C) is tantamount to deducing π(C) given unbounded
computational resou...
Functional Encryption Without Obfuscation
functional encryption graded encodings adaptive security
2016/1/7
Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability
obfuscation, which in turn either relies on an exponential number of assumptions
(basically, o...
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs
Iterated Circuits RAM Programs
2016/1/7
A key source of inefficiency in existing obfuscation schemes is that they operate on programs represented as Boolean circuits or (with stronger assumptions and costlier constructs) as Turing machines.
Program obfuscation is the process of making a program “unintelligible” without changing
the program’s underlying input/output behavior. Although there is a long line of work on
heuristic techniques...
Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation
functional encryption multilinear maps
2016/1/6
Deciding “greater-than” relations among data items just given their encryptions is at the heart of
search algorithms on encrypted data, most notably, non-interactive binary search on encrypted data.
...
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Adaptive Security Multiparty Computation Indistinguishability Obfuscation
2016/1/6
Adaptively secure Multi-Party Computation (MPC) first studied by Canetti, Feige,
Goldreich, and Naor in 1996, is a fundamental notion in cryptography. Adaptive security is particularly
hard to achie...
Adaptively Secure Two-party Computation From Indistinguishability Obfuscation
Indistinguishability Obfuscation cryptographic protocols
2016/1/6
We present the first two-round, two-party general function evaluation protocol that is secure against
honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible ...
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
random oracle model idealized models indistinguishability obfuscation
2016/1/6
It is well known that the random oracle model is not sound in the sense that there exist
cryptographic systems that are secure in the random oracle model but when instantiated by any
family of hash ...
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
Random oracle uninstantiability indistinguishability obfuscation
2016/1/6
Assuming the existence of indistinguishability obfuscation (iO), we show that a number of
prominent transformations in the random-oracle model are uninstantiable in the standard model. We
start by s...
Obfuscation, the task of compiling circuits or programs to make the internal computation unintelligible
while preserving input/output functionality, has become an object of central focus in
the cryp...