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 11 of 11 for “"Pseudorandom functions"”.
-
Privately Constrained Testable Pseudorandom Functions
Privately Constrained Pseudorandom Functions allow a PRF key to be delegated to some evaluator in a constrained manner, such that the key’s functionality is restricted with respect to some secret predicate. Variants of Privately Constrained Pseudorandom Func- tions have been applied to rich …
-
New constructions of cryptographic pseudorandom functions
Pseudorandom functions (PRFs) are the building blocks of symmetric-key cryptography. Almost all central goals of symmetric cryptography (e.g., encryption, authentication, identification) have simple solutions that make efficient use of a PRF. Most existing constructions of these objects are either …
-
Practical Multiparty Protocols From Lattice Assumptions: Threshold Signatures, Oblivious Pseudorandom Functions, And More
… type of protocol, namely verifiable oblivious pseudorandom functions, and propose a practical version of an existing protocol through different analysis techniques while also giving the first lattice-based threshold versions of such protocols. Using these techniques, we then rebuild our …
-
Uncloneable Quantum Encryption via Random Oracles
… decryption with high probability. Quantum-secure pseudorandom functions, modelled as random oracles, are then used to ensure that any partial information that the adversaries obtain does not give them an advantage in recovering the message.
-
Proactive Obfuscation
… in the plain model assuming the existence of pseudorandom functions and without assuming access to random oracles.
-
Quantum Pseudorandom Primitives Beyond Pseudorandom States
Quantum pseudorandomness is an emerging research area. Ji, Liu, and Song defined pseudorandom states (PRSs) and pseudorandom unitaries (PRUs) as quantum analogs of pseudorandom generators and pseudorandom functions. A unitary oracle separation result between one-way functions and PRSs/PRUs, …
-
On the Foundations of White-Box Cryptography
… our WKDF based on the assumption 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 Limits of Provable Efficiency in Cryptography
… security of message authentication codes or pseudorandom functions. Both results are proven via the meta-reduction paradigm, which has been applied to prove bounds on concrete security loss in the past, but all known meta-reductions in this space prior to our results have considerable …
-
Hiding secrets in public random functions
… the ability of privately embedding messages or functions in the code of a program. As an example, consider the task of building a searchable encryption scheme, which allows the users to search over the encrypted data and learn nothing other than the search result. Such a task is achievable if it …
-
Design and analysis of isogeny-based static-key protocols
… key exchanges (NIKE) and oblivious pseudorandom functions (OPRF). We first study the security of existing constructions with long-term static keys, and then we develop new protocols that outperform the existing ones. In particular, we first assess the security of the isogeny-based …
-
Distributional Security for OWF, PRF and Garbling
… to have. We also study input distributions to pseudorandom functions (PRF). A PRF is a function whose outputs are indistinguishable from random to an adversary who can query the function multiple times with any inputs. A weak PRF on the other hand is secure only when the inputs come from a …