搜索结果: 31-45 共查到“军事学 obfuscation”相关记录157条 . 查询时间(0.766 秒)
Indistinguishable Predicates: A New Tool for Obfuscation
program obfuscation indistinguishable/opaque predicates
2017/8/22
Opaque predicates are a commonly used technique in program obfuscation, intended to add complexity to control flow and to insert dummy code or watermarks. We survey a number of methods to remove opaqu...
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives
Obfuscation Witness Encryption Predicate Encryption
2017/6/9
Indistinguishability obfuscation (IO) enables many heretofore out-of-reach applications in cryptography. However, currently all known constructions of IO are based on multilinear maps which are poorly...
Obfuscation of Bloom Filter Queries from Ring-LWE
obfuscation virtual black-box Bloom filters
2017/5/25
We devise a virtual black-box (VBB) obfuscator for querying whether set elements are stored within Bloom filters, with security based on the Ring Learning With Errors (RLWE) problem and strongly unive...
Indistinguishability Obfuscation for All Circuits from Secret-Key Functional Encryption
Indistinguishability obfuscation Secret-key functional encryption Puncturable secret-key functional encryption
2017/4/27
We show that indistinguishability obfuscation (IO) for all circuits can be constructed solely from secret-key functional encryption (SKFE). In the construction, SKFE need to be able to issue a-priori ...
Towards Practical Obfuscation of General Circuits
Obfuscation randomized encoding graded encoding scheme
2017/4/17
Known approaches for obfuscating a circuit are only feasible in theory: the complexity polynomially depends on the security parameter and circuit measures, but with too large polynomials and/or holds ...
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
pseudorandom generators local computation obfuscation
2017/4/12
As a corollary, we refute some conjectures recently made in the cryptographic literature. This includes refuting the assumptions underlying Lin and Tessaro's recently proposed candidate construction f...
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation
PRG Blockwise 2-Local PRGs
2017/4/11
Lin and Tessaro (Eprint 2017/250) recently proposed indistinguishability obfuscation and functional encryption candidates and proved their security based on a standard assumption on bilinear maps and ...
Lockable Obfuscation
LWE Obfuscation
2017/3/27
We follow this by describing multiple applications of lockable obfuscation. First, we show how to transform any attribute-based encryption (ABE) scheme into one in which the attributes used to encrypt...
Indistinguishability Obfuscation: Simpler Constructions using Secret-Key Functional Encryption
Indistinguishability Obfuscation Functional Encryption
2017/3/27
We propose simple generic constructions of indistinguishability obfuscator (IO). Our key tool is exponentially-efficient indistinguishability obfuscator (XIO), which is the same as IO except that the ...
Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs
Indistinguishability Obfuscation Bilinear Maps Block-wise Local PRGs
2017/3/21
Recent works (Lin, EUROCRYPT'16, ePrint'16; Lin and Vaikunthanathan, FOCS'16; Ananth and Sahai, EUROCRYPT'17) establish a tight connection between constructions of indistinguishability obfuscation fro...
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
quasi-optimal SNARGs obfuscation lattices
2017/3/13
Succinct non-interactive arguments (SNARGs) enable verifying NP computations with substantially lower complexity than that required for classical NP verification. In this work, we first construct a la...
Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness
indistinguishability obfuscation functional encryption
2017/3/2
There is some evidence that indistinguishability obfuscation (iO) requires either exponentially many assumptions or (sub)exponentially hard assumptions, and indeed, all known ways of building obfuscat...
We implementated (a simplified version of) the branching-program obfuscator due to Gentry et al.\@ (GGH15), which is itself a variation of the first obfuscation candidate by Garg et al. (GGHRSW13). To...
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
Indistinguishability Obfuscation Universal Constructions Correctness Amplifiers
2017/2/20
Indistinguishability Obfuscation (iO) has enabled an incredible number of new and exciting applications. However, our understanding of how to actually build secure iO remains in its infancy. While man...
Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings
Obfuscation Constant-Degree Graded Encoding Schemes SXDH
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...