搜索结果: 31-45 共查到“军事学 indistinguishability”相关记录79条 . 查询时间(0.062 秒)
Indistinguishability Obfuscation with Non-trivial Efficiency
indistinguishability obfuscators XiO
2016/1/27
It is well known that inefficient indistinguishability obfuscators (iO) with running time
poly(|C|, λ) · 2
n, where C is the circuit to be obfuscated, λ is the security parameter, and n is
the inpu...
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation
Function privacy functional encryption obfuscation
2016/1/27
Private functional encryption guarantees that not only the information in ciphertexts is
hidden but also the circuits in decryption tokens are protected. A notable use case of this notion
is query p...
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
formal verification computational security guarantees
2016/1/27
In recent years, a new approach has been developed for verifying security protocols with the aim of combining the benefits of symbolic attackers and the benefits of unconditional soundness: the techni...
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
Randomized encodings Obfuscation UCE Random oracle
2016/1/26
Random oracles are powerful cryptographic objects. They facilitate the security proofs
of an impressive number of practical cryptosystems ranging from KDM-secure and deterministic
encryption to poin...
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
ZAP NIZK Obfuscation NIWI
2016/1/23
Zero-knowledge proofs [GMR89] and their feasibility for NP [GMW91] are fundamental to modern cryptography, allowing to prove any NP statement while guaranteeing total privacy of the witness. One of ...
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...
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...
Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical Key Assignment Schemes
Access control key assignment provable security
2016/1/7
A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a
set of classes in a partially ordered hierarchy, in such a way that the private informatio...
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.
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...
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...