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 7 of 7 for “"functional encryption"”.
-
Functional Encryption as Mediated Obfuscation
… a simple and generic construction based on functional encryption. If a functional encryption scheme supports decryption functionality F (m, k), then our construction yields a mediated obfuscation of the class of functions {F (m, ·) | m}. In our construction, the interaction between the …
-
Functional Encryption as Mediated Obfuscation
… a simple and generic construction based on functional encryption. If a functional encryption scheme supports decryption functionality F (m, k), then our construction yields a mediated obfuscation of the class of functions {F (m, ·) | m}. In our construction, the interaction between the …
-
FIFE : a Framework for Investigating Functional Encryption
In functional encryption, keys are associated with functions, and ciphertexts with messages. Decrypting a message with a key gives the evaluation of the associated function on that message. We look at bounded-collusion functional encryption, where the number of keys for which security is guaranteed …
-
Cryptanalysis by Algebraic Relations
… Macaulay matrices up to some sublinear degree. Functional Encryption. A functional encryption (FE) scheme allows fine-grained access to encrypted data. More specifically, in an FE scheme a master secret key-holder can issue special functional keys that only admit the decryption of evaluations of …
-
Cryptographic agents
… of ''cryptographic objects'' -- identity-based encryption, fully-homomorphic encryption, functional encryption, and most recently, various forms of obfuscation -- have opened up exciting new possibilities for computing on encrypted data. Initial foundational results on this front consisted of …
-
Structure vs. hardness through the obfuscation lens
… applications such as public-key and homomorphic encryption, but on the other, also puts their hardness in question. Their structure is exactly what puts them in low complexity classes such as SZK or NP [set-theoretic intersection symbol] coNP, and is in fact the reason behind (sub-exponential or …
-
Secure and practical computation on encrypted data
This Dissertation was approved for publication on 2016-04-21 at 13:02.