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 14 of 14 for “"random oracles"”.
-
Uncloneable Quantum Encryption via Random Oracles
… 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.
-
Mining out of Delphi: bitcoin proofs of work without random oracles
The Random Oracle (RO) model has proven to be very powerful for building cryptographic tools, but is known to be unrealistic. As such, finding security proofs for various crypto primitives that do not involve the random oracle model is of utmost importance. One property of the RO – Correlation …
-
Exploring Trusted Platform Module Capabilities: A Theoretical and Experimental Study
… features of TPMs to construct applications like random oracles that are impossible to implement in a standard model of computation. Apart from random oracles, I construct a new cryptographic primitive which is basically a non-interactive form of the standard cryptographic primitive of oblivious …
-
On Pairing-Based Signature and Aggregate Signature Schemes
… scheme which does not assume the existence of random oracles. In 2007, Lu, Ostrovsky, Sahai, Shacham, and Waters presented the LOSSW aggregate signature scheme which does not assume the existence of random oracles. The BLS, BGLS, Waters, and LOSSW authors each chose to work with a restricted …
-
Pseudorandom generators and structural complexity
… provide an in-depth exposition of a theorem on randomization in the polynomial-time hierarchy. This theorem, stated "almost-Σpk= BP• Σpk for all k≥1" in notation defined below, says that, at each level of the polynomial-time hierarchy, the randomization in bounded-error probabilistic algorithms …
-
Fine-grained non-interactive key-exchange protocols
… contributions are the following. We show that random oracles can be used to obtain fine-grained K-NIKE protocols for every constant K. In particular, we show how to generalize Merkle's two-party protocol to K parties in such a way that the honest parties ask n queries each, while the adversary …
-
THINKING INSIDE THE BOX: PRIVACY AGAINST STRONGER ADVERSARIES
… (and also non-malleable) secret sharing requires randomness sources that are also extractable. This rules out the possibility of using min-entropic sources. In the second, we introduce collision-resistant seeded extractors and show that any seeded extractor can be made collision resistant at a …
-
Proactive Obfuscation
… assumptions or are proven secure only in the random oracle model. In contrast, we exhibit practical constructions of multi-verifier signature schemes that are provably secure in the plain model assuming the existence of pseudorandom functions and without assuming access to random oracles.
-
MAC Constructions: Security Bounds and Distinguishing Attacks
… distinguishing attack for n-bit PMAC based on a random function is bounded by O(σq / 2^n), where σ is the total number of blocks in all q queries made by the attacker. In the original paper by Black and Rogaway at Eurocrypt 2002 where PMAC was introduced, the bound is O(σ^2 / 2^n). We also …
-
Deniable Key Exchanges for Secure Messaging
… instantiations that remain secure without random oracles.
-
Frameworks for efficient quantum oblivious transfer in the QROM
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-05-01
-
Signature Schemes in the Quantum Random-Oracle Model
… adversary having a quantum computer. In the random-oracle model, a hash function is replaced by a truly random function that any relevant party is able to query. This model can enable security reductions where otherwise none are known. However, it has been noted that this model does not …
-
Non-interactive key exchange for many users
… that this relaxed notion can be achieved in the random oracle model without any computational assumption. This result shows an important difference between identity-based NIKE and identity-based encryption (IBE), because bounded-collusion IBE implies public-key encryption (PKE), which is known to …