搜索结果: 61-75 共查到“军事学 obfuscation”相关记录157条 . 查询时间(0.021 秒)
From Obfuscation to the Security of Fiat-Shamir for Proofs
Fiat-Shamir Obfuscation Interactive Proofs
2016/3/18
The Fiat-Shamir paradigm [CRYPTO’86] is a heuristic for converting three-round identification
schemes into signature schemes, and more generally, for collapsing rounds in constant-round
public-coin ...
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security
Indistinguishability Obfuscation Witness Encryption Combiners
2016/3/14
Over the last few years a new breed of cryptographic primitives has arisen: on one hand they have previously unimagined utility and on the other hand they are not based on simple to state and tried ou...
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
Indistinguishability Obfuscation Graded Encoding Scheme Constant Degree
2016/3/9
We construct a general-purpose indistinguishability obfuscation (IO) scheme for all polynomial-size circuits from {\em constant-degree} graded encoding schemes in the plain model, assuming the existen...
On Statistically Secure Obfuscation with Approximate Correctness
obfuscation approximate iO statistical iO
2016/3/2
Goldwasser and Rothblum (TCC '07) prove that statistical indistinguishability obfuscation (iO) cannot exist if the obfuscator must maintain perfect correctness (under a widely believed complexity theo...
I survey some of the recent progress on software obfuscation spurred by the exciting paper of Garg, Gentry, Halevi, Raykova, Sahai and Waters (FOCS 2013). This is a preprint version of a review articl...
Known methods for obfuscating a circuit need to represent the circuit as a branching
program and then use a multilinear map to encrypt the branching program. Multilinear
maps are, however, too ineff...
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
Indistinguishability Obfuscation GGH13
2016/2/23
In this work, we put forward a new class of polynomial-time attacks on the original multilinear
maps of Garg, Gentry, and Halevi (2013). Previous polynomial-time attacks on GGH13
were “zeroizing” at...
We provide the following negative results for differing-inputs obfuscation (diO): (1) If subexponentially
secure one-way functions exist then sub-exponentially secure diO for TMs does
not exist (2) ...
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...
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...
Optimizing Obfuscation: Avoiding Barrington's Theorem
natural function classes Optimizing Obfuscation
2016/1/23
In this work, we seek to optimize the efficiency of secure general-purpose obfuscation schemes. We focus on the problem of optimizing the obfuscation of Boolean formulas and branching programs – thi...
Chosen Ciphertext Security via Point Obfuscation
public key encryption lossy encryption key encapsulation mechanism
2016/1/23
In this paper, we show two new constructions of chosen ciphertext secure (CCA secure) public key encryption (PKE) from general assumptions. The key ingredient in our constructions is an obfuscator for...
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 ...
How to Avoid Obfuscation Using Witness PRFs
Witness PRFs multilinear maps multiparty key exchange
2016/1/23
We propose a new cryptographic primitive called witness pseudorandom functions (witness PRFs). Witness PRFs are related to witness encryption, but appear strictly stronger: we show that witness PRFs...