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 20 of 43 for “"random oracle"”.

  1. 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 …

    waterloo Repository record for Signature Schemes in the Quantum Random-Oracle Model (opens in a new tab)

  2. Delegation of quantum computation using a random oracle

    … of symmetric-key primitives, modeled by a random oracle, changes the complexity of quantum computation delegation. In contrast with public-key primitives, there are many candidates for symmetric-key schemes secure against quantum attacks. We aim for protocols that require as little quantum …

    bu Repository record for Delegation of quantum computation using a random oracle (opens in a new tab)

  3. Relative to a random oracle, co-NP [not equal to or included in] IP/poly

    … given polynomial-length advice along with the random oracle R, it still does not include all of co-NPᴿ. In this case, intuition says that since co-NP is uniform, adding nonuniformity to IPᴿ won't be of any help. On the other hand, IP accomplishes surprising things with few resources, and advice …

    iastate Repository record for Relative to a random oracle, co-NP [not equal to or included in] IP/poly (opens in a new tab)

  4. Formal Algebraic Reasoning About Compression Function Security

    … resistance, and indifferentiability from a random oracle (RO). Creating efficient hash functions with provable security has long posed a challenge. Security proofs for hash functions usually fall under the random oracle model or the ideal cipher model, which assumes access to an ideal …

    uvic Repository record for Formal Algebraic Reasoning About Compression Function Security (opens in a new tab)

  5. Post-Quantum Security of Authenticated Key Establishment Protocols

    … interactions between the adversary and quantum oracles that emulate classical parties, resulting in a truly post-quantum security definition. We then give a generic construction for a secure protocol in the quantum random oracle model by combining a signature scheme which is existentially …

    waterloo Repository record for Post-Quantum Security of Authenticated Key Establishment Protocols (opens in a new tab)

  6. On the Descriptive Complexity and Ramsey Measure of Sets of Oracles Separating Common Complexity Classes

    … and Gill first demonstrated that, relative to a randomly chosen oracle, P is not equal to NP with probability 1, the random oracle hypothesis began piquing the interest of mathematicians and computer scientists. This was quickly disproven in several ways, most famously in 1992 with the result …

    unt Repository record for On the Descriptive Complexity and Ramsey Measure of Sets of Oracles Separating Common Complexity Classes (opens in a new tab)

  7. 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 …

    bu Repository record for Mining out of Delphi: bitcoin proofs of work without random oracles (opens in a new tab)

  8. New Design and Analysis Techniques for Post-Quantum Cryptography

    … to their classical analogues. The quantum random oracle model abstracts real world hash functions to a black box, but allows for superposition queries. This model is important as it often makes possible the reduction of the security of a protocol to the hardness of an underlying hard …

    waterloo Repository record for New Design and Analysis Techniques for Post-Quantum Cryptography (opens in a new tab)

  9. A post-quantum digital signature scheme based on supersingular isogenies

    … against quantum adversaries in the quantum random oracle model with small key sizes. This scheme is an application of Unruh’s construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by De Feo, Jao, and Plut. We implement our proposed scheme on an …

    waterloo Repository record for A post-quantum digital signature scheme based on supersingular isogenies (opens in a new tab)

  10. Machine-checked verification of digital signature schemes in EasyCrypt

    … scheme with tight security in the random oracle model. The EDL signature size is lengthier than the traditional ones (more exponentiations). At CRYPTO ‘05, Chevallier-Mames proposed a new signature scheme (CM) where he shortened the size of the EDL scheme. The scheme benefitted from …

    bristol Repository record for Machine-checked verification of digital signature schemes in EasyCrypt (opens in a new tab) Download PDF for Machine-checked verification of digital signature schemes in EasyCrypt (opens in a new tab)

  11. Group key agreement from bilinear pairings

    … prove the security of our protocols in the random oracle model and show that they are communication and computationally efficient in comparison to the pairing-based protocols from the literature.

    ottawa-retro Repository record for Group key agreement from bilinear pairings (opens in a new tab)

  12. Secure channel free public key encryption with multiple keywords search

    … so that it proves to be semantic secure under Random Oracle Models by Bilinear Diffie-Hellman (BDH) and 1-Bilinear Diffie-Hellman Inversion(1-BDHI) assumptions for preventing OKGA. Besides, the efficiency and performance of tSCF-MPEKS is presented from both the theoretical analysis and the …

    london-metro Download PDF for Secure channel free public key encryption with multiple keywords search (opens in a new tab)

  13. Forward-Anonymity for Anix: Formalization and Symbolic Analysis of a Blackout-Resistant Anonymous Broadcast System

    … through algorithms, protocol state, adversarial oracles, and security games, and prove correctness and one-wayness of the ratcheting construction in the random-oracle model. We then build symbolic models of the Anix-based instantiation in Tamarin and automatically prove soundness under both the …

    waterloo Repository record for Forward-Anonymity for Anix: Formalization and Symbolic Analysis of a Blackout-Resistant Anonymous Broadcast System (opens in a new tab)

  14. 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 …

    iastate Repository record for Pseudorandom generators and structural complexity (opens in a new tab)

  15. 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 …

    texas Repository record for Fine-grained non-interactive key-exchange protocols (opens in a new tab)

  16. On the use of randomness extractors for practical committee selection

    … we make no cryptographic assumptions such as the Random Oracle assumption and the existence of private channels. However, we do assume the network to be peer-to-peer, where a message receiver knows who the message sender is. Under the synchronous full information model, our solution is to utilize …

    uvic Repository record for On the use of randomness extractors for practical committee selection (opens in a new tab)

  17. On Abstract Models in Cryptography and Their Applications

    … ways of interactions which we usually call ‘oracles’. However, the scheme may have some underlying building blocks, such as cryptographic groups or hash functions. For example, if the scheme uses a hash function, a security proof can be in the Random Oracle Model (ROM) where the hash function …

    ethz Repository record for On Abstract Models in Cryptography and Their Applications (opens in a new tab)

  18. Designated confirmer signatures: modelling, design and analysis

    … maps, and such a construction is secure in the random oracle model under a new computational assumption. On the other hand, we build a generic transformation that is inspired by Gentry, Molnar, Ramzan’s DCS scheme. The new generic DCS scheme is proved to be secure in the standard model, and can …

    birmingham Download PDF for Designated confirmer signatures: modelling, design and analysis (opens in a new tab)

  19. Entropy Estimation for Arbiter PUF and Applications to Authenticated Key Exchange

    … and estimating the entropy of PUF responses to random challenges is the first step in formalizing the security of PUF-based cryptographic protocols. In this thesis, we consider the Arbiter PUF (APUF), a widely used and studied PUF construction. We propose a novel approach to modeling and …

    calgary Repository record for Entropy Estimation for Arbiter PUF and Applications to Authenticated Key Exchange (opens in a new tab)

  20. IOPs to SNARKs: Security from Practice to Theory

    Interactive Oracle Proofs (IOPs) are a powerful proof system model that combines features of probabilistically checkable proofs and interactive proofs. While IOPs have enabled remarkable advances in zero-knowledge proofs, verifiable computation, and other cryptographic applications, their security …

    jhu Repository record for IOPs to SNARKs: Security from Practice to Theory (opens in a new tab)

Page 1 of 3