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 30 for “"random-oracle model"”.

  1. Signature Schemes in the Quantum Random-Oracle Model

    … protocols, it is equally important that the models in which we consider security are also updated to consider the possibility of a malicious 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 …

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

  2. Post-Quantum Security of Authenticated Key Establishment Protocols

    We present a security model for authenticated key establishment that allows for quantum 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 …

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

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

    … for the post-quantum era. Proofs in security models that consider quantum adversaries are notoriously more challenging compared 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 …

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

  4. 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)

  5. 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)

  6. 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)

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

  8. 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)

  9. 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)

  10. Designated confirmer signatures: modelling, design and analysis

    … signatures. This thesis is mainly devoted to the modelling, design and analysis of designated confirmer signatures. By exploiting the existing security notions, we theoretically analyse the relations among unimpersonation, invisibility, non-transferability and transcript-simulatability. To this …

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

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

    … key generation, and anti-counterfeiting. Modeling 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 …

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

  12. 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)

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

    cornell Repository record for Proactive Obfuscation (opens in a new tab)

  14. Authenticating Computation on Groups: New Homomorphic Primitives and Applications

    … show how to instantiate this primitive (in the random oracle model) to support Paillier's ciphertexts. This immediately yields a very simple and efficient (publicly) verifiable computation mechanism for encrypted (outsourced) data based on Paillier's cryptosystem. As a second result, we show how …

    catania Repository record for Authenticating Computation on Groups: New Homomorphic Primitives and Applications (opens in a new tab)

  15. Chosen Ciphertext Security from Zero Knowledge Proofs

    … security of our generic construction in the random oracle model, and we provide an instantiation of it using existing schemes. For the instantiation, we use ElGamal as our underlying PKE, and an application of Fischlin's transfomation to a variant of Schnorr's protocol for our zero-knowledge …

    waterloo Repository record for Chosen Ciphertext Security from Zero Knowledge Proofs (opens in a new tab)

  16. Efficient Blind Signatures and Threshold Signatures from Pairing-Free Groups and Lattices

    … logarithm (DL) assumption in the algebraic group model (AGM) and the random oracle model (ROM). - Pairing-free threshold signatures: This thesis introduces a new syntax and security hierarchy for analyzing FROST, the state-of-the-art pairing-free threshold signature scheme. It provides the first …

    washington Repository record for Efficient Blind Signatures and Threshold Signatures from Pairing-Free Groups and Lattices (opens in a new tab)

  17. On the security and efficiency of encryption

    … for encryption that are carried out in the random oracle model, where one declares that a scheme's hash functions are ``off limits' for an attacker in order to make a proof go through. Such proofs leave some doubt as to the security of the scheme in practice, when attackers are free to …

    gatech Repository record for On the security and efficiency of encryption (opens in a new tab)

  18. Practical Distributed Key Generation and Signatures

    … Discrete Logarithm (ℓ-AOMDL) assumption in the Random Oracle Model (ROM). Secondly, we present Storm, a simplified three-round distributed key generation protocol (DKG). Storm presents a simplified alternative to prior DKGs with a similar security model, assuming the Discrete Logarithm Problem …

    waterloo Repository record for Practical Distributed Key Generation and Signatures (opens in a new tab)

  19. Unclonable Secret Keys

    … etc., remain classical. We study this model in the authentication and encryption setting giving a plethora of definitions and positive results as well as several applications that are impossible in a purely classical setting. In the authentication setting, we define the notion of …

    cuny-grad Repository record for Unclonable Secret Keys (opens in a new tab)

  20. Constructing Secure Protocols from Proofs of Knowledge and Isogenies

    … its evaluation proof to construct a verifiable random function (VRF), in the random oracle model. As an independent contribution, we prove the security of the associated generic VRF transformation. As an orthogonal contribution, we explore the shortcomings of various works which construct proofs …

    auckland-ms Repository record for Constructing Secure Protocols from Proofs of Knowledge and Isogenies (opens in a new tab)

Page 1 of 2