搜索结果: 31-45 共查到“军事学 Indistinguishability Obfuscation”相关记录51条 . 查询时间(0.12 秒)
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...
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
Turing Machines Unbounded Memory
2016/1/6
We show how to build indistinguishability obfuscation (iO) for Turing Machines where the overhead
is polynomial in the security parameter λ, machine description |M| and input size |x| (with only a
n...
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Concurrent ZK Constant-Round Indistinguishability Obfuscation
2016/1/5
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol
relies on the existence of families of collision-resistant hash functions, one-way permutations,
and indistinguish...
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
self-bilinear map indistinguishability obfuscation multilinear map
2016/1/4
A self-bilinear map is a bilinear map where the domain and target groups are identical. In
this paper, we introduce a self-bilinear map with auxiliary information which is a weaker variant
of a self...
Indistinguishability Obfuscation from Functional Encryption
obfuscation functional encryption
2016/1/3
Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptio...
Indistinguishability Obfuscation from Compact Functional Encryption
program obfuscation functional encryption
2016/1/3
The arrival of indistinguishability obfuscation (iO) has transformed the cryptographic landscape
by enabling several security goals that were previously beyond our reach. Consequently,
one of the pr...
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
security assumptions functional encryption scheme
2015/12/31
Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a
“central hub” for almost all known cryptographic tasks, and as an extremely powerful building
block for new...
Computation-Trace Indistinguishability Obfuscation and its Applications
computation-trace indistinguishability obfuscation indistinguishability obfuscation computation trace
2015/12/31
We introduce a new, instance-based notion of indistinguishability obfuscation, called computation-trace
indistinguishability obfuscation (CiO), for (parallel) RAM computation. CiO only obfuscates a f...
Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation
Universal computational extractors standard model superfluous padding assumption
2015/12/29
Universal Computational Extractors (UCEs), introduced by Bellare, Hoang and Keelveedhi
(CRYPTO 2013), are a framework of assumptions on hash functions that allow to instantiate random
oracles in a l...
Indistinguishability Obfuscation: from Approximate to Exact
Functional Encryption Program Obfuscation Secure Function Evaluation
2015/12/24
We show general transformations from subexponentially-secure approximate indistinguishability
obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 +
fraction of ...
Indistinguishability Obfuscation from Functional Encryption for Simple Functions
Functional Encryption Simple Functions
2015/12/24
We show how to construct indistinguishability obfuscation (iO) for circuits from any
non-compact functional encryption (FE) scheme with sub-exponential security against unbounded
collusions. We acco...
Self-bilinear Map from One Way Encoding System and Indistinguishability Obfuscation
Encoding System ndistinguishability Obfuscation
2015/12/24
The bilinear map whose domain and target sets are identical is called the self-bilinear map. Original self-bilinear maps are defined over cyclic groups. This brings a lot of limitations to construct s...
Indistinguishability Obfuscation with Constant Size Overhead
Indistinguishability Obfuscation Constant Size Overhead
2015/12/22
Present constructions of indistinguishability obfuscation (iO) create obfuscated programs
where the size of the obfuscated program is at least a factor of a security parameter larger
than the size o...
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...
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...