Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"Indistinguishability Obfuscation"”.
-
Foundations and applications of program obfuscation
… and hacking. Beyond software protection, obfuscation is also a powerful cryptographic tool, enabling a variety of advanced applications. Ideally, an obfuscated program would hide any information about the original program that cannot be obtained by simply executing it. However, Barak et …
-
Program obfuscation: new applications and constructions from standard assumptions
Code obfuscation has been one of the main focal points of cryptographic research over the last few years. This proposed thesis studies two different aspects of program obfuscation. In the first part, we examine the power of indistinguishability obfuscation. This notion of indistinguishability …
-
Batching in cryptography : constructing efficient ciphertexts, time-locked puzzles and proofs
… batch solving rely on super-polynomially secure indistinguishability obfuscation, making them impractical. We present novel TLP constructions that offer batch-solving capabilities without using heavy cryptographic hammers. Furthermore, we introduce the concept of "rogue-puzzle attacks", where …
-
Trustless advanced encryption schemes from lattices
… pairing-based assumptions or strong tools like indistinguishability obfuscation and witness encryption. Notably, none of these schemes enjoy security from a reasonable post-quantum assumption. In this work, we make progress on filling this gap by constructing the first trustless advanced PKE …
-
Building and refining registered attribute-based encryption
… ABE, from composite-order bilinear groups and indistinguishability obfuscation. Building upon this, we show how this basic construction of R-ABE can be improved upon both in terms of efficiency and usability. Towards the first goal, we present two techniques - an asymptotic compression of the …
-
Black-Box Barriers Behind Registration-Based Encryption
… advanced cryptographic primitives such as indistinguishability obfuscation or garbled circuits. However, non-black-box constructions often face practical inefficiencies. Recent works have shown that black-box constructions of RBE are achievable, though these constructions often involve a …
-
On the Black-Box Impossibility of Hardness in TFNP from One-Way Functions
… permutations, collision-resistant hashing, indistinguishability obfuscation, factoring, and various others. However, the status of basing the hardness on a general assumption such as the existence of one-way functions remains unsuccessful. There have been several attempts at providing …
-
On Program Obfuscation
Program obfuscation is an exciting new area of research with wide-ranging applications and implications throughout cryptography and computer science. The most widely accepted security notion for obfuscation is indistinguishability obfuscation (iO ), which on one hand is surprisingly useful for many …
-
On the Foundations of White-Box Cryptography
… of puncturable pseudorandom functions (PPRF) and indistinguishability obfuscation. Our construction consists of a PPRF which we use for deriving keys and bind it to a pseudorandom function-like functionality which is used for verifying if the program is running on the intended device. Via …
-
Cryptanalysis by Algebraic Relations
… Since it is known that compact FE implies indistinguishability obfuscation (Bitansky-Vaikuntanatha FOCS 2015, Ananth-Jain CRYPTO 2015), investigating the feasibility of FE schemes is of large interest in cryptographic research. While FE schemes for linear functions do exist from a plethora …
-
Non-Black Box Use Of Code In Cryptography
… several new cryptographic primitives: indistinguishability obfuscators (IO), randomized encoding (RE), and functional encryption (FE). These primitives inherently leverage program code to provide new functionality beyond that offered by classical primitives, and they have allowed novel …
-
Non-interactive key exchange for many users
… of it, can be built from multilinear maps or indistinguishability obfuscation (iO). However, both of these constructions achieve only a weak security notion where the adversary has to specify the challenge users in the beginning and all key authorities must generate their public key honestly. …