Search
Search Results
-
Computational Wiretap Coding from Indistinguishability Obfuscation
A wiretap coding scheme for a pair of noisy channels...
-
On the Complexity of Compressing Obfuscation
Indistinguishability obfuscation has become one of the most exciting cryptographic primitives due to its far-reaching applications in cryptography...
-
Use of cryptography in malware obfuscation
Malware authors often use cryptographic tools such as XOR encryption and block ciphers like AES to obfuscate part of the malware to evade detection....
-
Fully Succinct Batch Arguments for \(\textsf{NP}\) from Indistinguishability Obfuscation
Non-interactive batch arguments for \(\textsf{NP} \)...
-
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness
There is some evidence that indistinguishability obfuscation (iO) requires either exponentially many assumptions or (sub)exponentially hard...
-
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation
A wiretap coding scheme (Wyner in Bell Syst Tech J 54(8):1355–1387, 1975) enables Alice to reliably communicate a message m to an honest Bob by...
-
Constructions for Quantum Indistinguishability Obfuscation
An indistinguishability obfuscator is a polynomial-time probabilistic algorithm that takes a circuit as input and outputs a new circuit that has the...
-
Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation
(Fully) homomorphic encryption ((F)HE) allows users to publicly evaluate circuits on encrypted data. Although public homomorphic evaluation property...
-
Vehicle Trajectory Obfuscation and Detection
A vehicle in road networks shares location data with other vehicles and location-based services (LBS) through Internet-of-vehicles (IoV). By...
-
Indistinguishability Obfuscation from LPN over \(\mathbb {F}_p\) , DLIN, and PRGs in NC \(^0\)
In this work, we study what minimal sets of assumptions suffice for constructing indistinguishability obfuscation (...
-
The Pseudorandom Oracle Model and Ideal Obfuscation
We introduce a new idealized model of hash functions, which we refer to as the pseudorandom oracle (Pr...
-
Homomorphic Witness Encryption from Indistinguishable Obfuscation
Witness encryption (WE) is a new encryption paradigm that allows encrypting a message using the instance of a particular NP problem, and someone who...
-
White-Box Cryptography with Global Device Binding from Message-Recoverable Signatures and Token-Based Obfuscation
Device binding for white-box cryptography ensures that a white-box program is only executable on one specific device and is unusable elsewhere. In...
-
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation
Laconic function evaluation (LFE) is a “flipped” version of fully homomorphic encryption, where the server performing the computation gets the...
-
COA-Secure Obfuscation and Applications
We put forth a new paradigm for program obfuscation, where obfuscated programs are endowed with proofs of “well formedness.” In addition to asserting...
-
Lockable Obfuscation from Circularly Insecure Fully Homomorphic Encryption
In a lockable obfuscation scheme, a party called the obfuscator takes as input a circuit...
-
R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications
In recent breakthrough results, novel use of grabled circuits yielded constructions for several primitives like Identity-Based Encryption (IBE) and...
-
-
Public data integrity auditing without homomorphic authenticators from indistinguishability obfuscation
Cloud storage services allow users to outsource their data to remote cloud servers to relieve from the burden of local data storage and maintenance....
-
Enhancing frequent location privacy-preserving strategy based on geo-Indistinguishability
The increasing use of hand-held devices which have access to location information, has raised the risk of privacy disclosure. To implement privacy...
