搜索结果: 46-60 共查到“军事学 obfuscation”相关记录157条 . 查询时间(0.018 秒)
All known candidate indistinguishibility obfuscation (iO) schemes rely on candidate multilinear maps. Until recently, the strongest proofs of security available for iO candidates were in a generic mod...
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
cryptographic agents obfuscation simulation-based security
2016/12/10
We extend the simulation-based definition of Virtual Grey Box (VGB) security -- originally proposed for obfuscation (Bitansky and Canetti, 2010) -- to a broad class of cryptographic primitives. These ...
Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
Multilinear Maps CLT13 Indistinguishability Obfuscation
2016/12/8
In this work, we describe a new polynomial-time attack on the multilinear maps of Coron,
Lepoint, and Tibouchi (CLT13), when used in candidate iO schemes. More specifically, we show that
given the o...
Preventing CLT Zeroizing Attacks on Obfuscation
Multilinear Maps CLT13 Indistinguishability Obfuscation
2016/12/7
We describe a defense against zeroizing attacks on indistinguishability obfuscation (iO) over the CLT13 multilinear map construction. This defense applies to the most recent extension of the attack by...
Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs
Indistinguishability Obfuscation 5-linear Maps Local PRG
2016/12/7
When plugging in a candidate PRG with locality-5 (eg, [Goldreich, ECCC 2010, O'Donnell and Witmer, CCC 2014]), we obtain a construction of IO from subexponential DDH on 5-linear maps and LWE. Previous...
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps
Indistinguishability Obfuscation constant degree multilinear maps arithmetic functional encryption
2016/12/7
In this work, we propose a variant of functional encryption called projective arithmetic functional encryption (PAFE). Roughly speaking, our notion is like functional encryption for arithmetic circuit...
Leakage-Resilient Public-Key Encryption from Obfuscation
leakage resilient cryptography program obfuscation
2016/7/28
The literature on leakage-resilient cryptography contains various leakage models that provide different
levels of security. In this work, we consider the bounded leakage and the continual leakage mod...
Multilinear maps enable homomorphic computation on encoded values and a public procedure to check if the computation on the encoded values results in a zero. Encodings in known candidate constructions...
Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks
obfuscation multilinear maps annihilating polynomials
2016/6/7
All known candidate indistinguishibility obfuscation (iO) schemes rely on candidate multilinear maps. Until recently, the strongest proofs of security available for iO candidates were in a generic mod...
Structure vs Hardness through the Obfuscation Lens
Indistinguishability Obfuscation Statistical Zero-knowledge NP ∩ coNP
2016/6/6
Cryptography relies on the computational hardness of structured problems. While one-way
functions, the most basic cryptographic object, does not seem to require much structure, as we
advance up the ...
Indistinguishability Obfuscation Does Not Reduce to Structured Languages
indistinguishability obfuscation one-way functions
2016/6/6
We prove that indistinguishability obfuscation (iO) and one-way functions do not naturally
reduce to any language within NP∩coNP. This is proved within the framework introduced by
Asharov and Segev ...
Shorter Circuit Obfuscation in Challenging Security Models
virtual-black-box indistinguishability-secure
2016/5/3
The study of program obfuscation is seeing great progress in recent years, which is crucially
attributed to the introduction of graded encoding schemes by Garg, Gentry and Halevi (Eurocrypt
2013). I...
Indistinguishability obfuscation is a central primitive in cryptography. Security of existing multilinear maps constructions on which current obfuscation candidates are based is poorly understood. In ...
A Note on Black-Box Complexity of Indistinguishability Obfuscation
Indistinguishability Obfuscation Black-Box Separations
2016/3/23
Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a semi-black-box way is as hard as basing public-key cryptography on one-way func...
Obfuscation is challenging; we currently have practical candidates with rather vague security guarantees on the one side, and theoretical constructions which have recently experienced jeopardizing att...