搜索结果: 121-135 共查到“军事学 obfuscation”相关记录157条 . 查询时间(0.03 秒)
Lower Bounds on Assumptions behind Indistinguishability Obfuscation
Indistinguishability Obfuscation Black-Box Separations Lower Bounds
2015/12/21
Since the seminal work of Garg et al. (FOCS’13) in which
they proposed the first candidate construction for indistinguishability obfuscation
(iO for short), iO has become a central cryptographic pri...
Patchable Obfuscation
we exhibit some simple applications of multi-program patchable obfuscation to demonstrate how these concepts can be applied
2015/12/21
In this work, we introduce patchable obfuscation: our notion adapts the notion of indistinguishability
obfuscation (iO) to a very general setting where obfuscated software evolves over
time. We mode...
Obfuscation ==> (IND-CPA Security =/=> Circular Security)
Circular Security Related Key Attack Obfuscation
2014/3/6
Circular security is an important notion for public-key encryption schemes and is needed by several cryptographic protocols. In circular security the adversary is given an extra ``hint'' consisting of...
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input
Auxiliary Input Virtual-Black-Box
2014/3/6
We show that if there exist indistinguishability obfuscators for a certain class C of circuits then there do not exist independent-auxiliary-input virtual-black-box (VBB) obfuscators for any family of...
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
Indistinguishability Obfuscation Deniable Encryption
2014/3/11
We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. We use this technique to carry out a systematic study of the ap...
We show that indistinguishability obfuscation implies that all functions with sufficient ``pseudo-entropy'' cannot be obfuscated under a virtual black box definition with a universal simulator. Let ${...
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
obfuscation multi-party key exchange,
2014/3/7
In this work, we show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy several intere...
Obfuscation from Semantically-Secure Multi-linear Encodings
obfuscation semantically secure
2014/3/5
We define a notion of semantic security of multi-linear (a.k.a. graded) encoding schemes: roughly speaking, we require that if an algebraic attacker (obeying the multi-linear restrictions) cannot tell...
Recently, Garg, Gentry, Halevi, Raykova, Sahai, and Waters (FOCS 2013) constructed a general-purpose obfuscating compiler for NC1 circuits. We describe a simplified variant of this compiler, and prove...
Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation
Indistinguishability Obfuscation Full Domain Hash
2014/3/10
Our main result gives a way to instantiate the random oracle with a concrete hash function in ``full domain hash'' applications. The term full domain hash was first proposed by Bellare and Rogaway and...
We initiate the study of {\em extractability obfuscation}, a notion first suggested by Barak et al. (JACM 2012): An extractability obfuscator eO for a class of algorithms M guarantees that if an effic...
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
Differing-Inputs Obfuscation Extractable Witness Encryption
2014/3/5
The notion of differing-inputs obfuscation (diO) was introduced by Barak et al. (CRYPTO 2001). It guarantees that, for any two circuits $C_0, C_1$, if it is difficult to come up with an input $x$ on w...
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
Concurrent Zero Knowledge Non-black-box Simulation
2014/3/6
As recent studies show, the notions of *program obfuscation* and *zero knowledge* are intimately connected. In this work, we explore this connection further, and prove the following general result. If...
In this paper we study of the notion of differing-input obfuscation, introduced by Barak et al. (CRYPTO 2001, JACM 2012). For any two circuit C_0 and C_1, differing-input obfuscator diO guarantees tha...
An evasive circuit family is a collection of circuits C such that for every input x, a random circuit from C outputs 0 on x with overwhelming probability. We provide a combination of definitional, con...