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 38 for “"security proof"”.

  1. Security proof methods for quantum key distribution protocols

    … tools for quantum key distribution (QKD) security proofs. We apply the tools to provide security proofs for several protocols, ranging from discrete variable protocols in high dimensions, protocols with realistic implementations, measurement device independent QKD and continuous-variable …

    waterloo Repository record for Security proof methods for quantum key distribution protocols (opens in a new tab)

  2. Security Analysis of Quantum Key Distribution: Methods and Applications

    … of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools …

    waterloo Repository record for Security Analysis of Quantum Key Distribution: Methods and Applications (opens in a new tab)

  3. The Physical Underpinning of Security Proofs for Quantum Key Distribution

    … of a quantum computer could threaten the security of messages encoded using public key cryptosystems based on one-way function such as RSA. Quantum key distribution (QKD) offers an unconditionally secure alternative to such schemes, even in the advent of a quantum computer, as it does not …

    waterloo Repository record for The Physical Underpinning of Security Proofs for Quantum Key Distribution (opens in a new tab)

  4. Non-Constructivity in Security Proofs

    … one generally obtains assurances for the security of a cryptographic protocol by giving a reductionist security proof, which is comprised of a reduction from breaking a mathematical problem (that is well-studied and widely believed to be intractable) to the breaking of the cryptographic …

    waterloo Repository record for Non-Constructivity in Security Proofs (opens in a new tab)

  5. Provably Correct Compilation for Distributed Cryptographic Applications

    … advanced cryptography must be used to achieve security goals. We present Viaduct, a compiler that transforms high-level programs into secure, efficient distributed realizations. Instead of implementing a system of communicating processes, the Viaduct programmer implements a centralized, …

    cornell Repository record for Provably Correct Compilation for Distributed Cryptographic Applications (opens in a new tab)

  6. A proof-technique-independent framework for detector imperfections in QKD

    The security of Quantum Key Distribution (QKD) protocols is theoretically established using idealised device models. However, the physical implementations upon which practical security relies inevitably deviate from these ideals. This thesis develops a rigorous and versatile framework to address a …

    waterloo Repository record for A proof-technique-independent framework for detector imperfections in QKD (opens in a new tab)

  7. Digital Signature Schemes Based on Hash Functions

    Cryptographers and security experts around the world have been awakened to the reality that one day (potentially soon) large-scale quantum computers may be available. Most of the public-key cryptosystems employed today on the Internet, in both software and in hardware, are based on number-theoretic …

    waterloo Repository record for Digital Signature Schemes Based on Hash Functions (opens in a new tab)

  8. Rigorous Security Proofs for Practical Quantum Key Distribution

    This thesis is concerned with the rigorous security analysis of practical Quantum Key Distribution (QKD) protocols, using a variety of modern proof techniques. Throughout, the emphasis is on mathematical rigor across a wide range of security proof frameworks. We begin by presenting a security proof …

    waterloo Repository record for Rigorous Security Proofs for Practical Quantum Key Distribution (opens in a new tab)

  9. Study of realistic devices for quantum key-distribution

    … estimation in optical QKD, and 3) Modifying the security proof formalism of QKD to account for imperfect devices.

    waterloo Repository record for Study of realistic devices for quantum key-distribution (opens in a new tab)

  10. Tools for the Security Analysis of Quantum Key Distribution in Infinite Dimensions

    … in quantum-secured networks. Importantly, our security proof does not require the photon-number cutoff assumption relied upon in previous works. We also demonstrate that our method can provide practical advantages over the flag-state squasher when applied to discrete-variable protocols.

    waterloo Repository record for Tools for the Security Analysis of Quantum Key Distribution in Infinite Dimensions (opens in a new tab)

  11. Protocols and Resources for New Generation Continuous Variable Quantum Key Distribution

    … relation for CV tripartite states a new security proof was applied to the family of Gaussian CV QKD protocols. This resulted in the discovery of six new protocols with the special property of being one side device independent. Using the new security proof three of the protocols were …

    anu Repository record for Protocols and Resources for New Generation Continuous Variable Quantum Key Distribution (opens in a new tab)

  12. State-Separating Proofs and Their Applications

    … protocols are commonly used to provide security for network traffic and digital interactions in general. Security means different things in different contexts. The most common security properties include confidentiality and authenticity of transmitted information, but …

    aalto Repository record for State-Separating Proofs and Their Applications (opens in a new tab)

  13. The Security of Simplified Trusted Relays

    This thesis examines the security of performing quantum key distribution (QKD) with a simplified trusted relay (STR). The protocol carries out the quantum phase of a conventional trusted relay, however, reduces the required complexity of the nodes by carrying out an altered classical phase. Rather …

    waterloo Repository record for The Security of Simplified Trusted Relays (opens in a new tab)

  14. Exploring the limits of device-independent quantum cryptography via self-testing

    … the need for device characterisation in their security proof, and leverage nonlocal observations only. However, identifying which quantum correlations are optimal for a given task is challenging, and an answer could lead to more efficient protocols.<br/>This thesis presents quantum correlations …

    bristol Repository record for Exploring the limits of device-independent quantum cryptography via self-testing (opens in a new tab) Download PDF for Exploring the limits of device-independent quantum cryptography via self-testing (opens in a new tab)

  15. SOFTWARE DEFINED NETWORKS: DIALECTING SECURITY

    … linked to OpenFlow. With the use of TLS as a security solution, it inherits the vulnerabilities of TLS in downgrade attacks. Furthermore, TLS is optional. To enhance the security in OpenFlow, previous research work provided a solution that comes with the notion of protocol dialects. Protocol …

    nps Repository record for SOFTWARE DEFINED NETWORKS: DIALECTING SECURITY (opens in a new tab)

  16. Proving Cryptographic C Programs Secure with General-Purpose Verification Tools

    Security protocols, such as TLS or Kerberos, and security devices such as the Trusted Platform Module (TPM), Hardware Security Modules (HSMs) or PKCS#11 tokens, are central to many computer interactions. Yet, such security critical components are still often found vulnerable to attack after their …

    the-open-u Download PDF for Proving Cryptographic C Programs Secure with General-Purpose Verification Tools (opens in a new tab)

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

    … groups and lattices, along with rigorous security analyses. Pairing-free constructions are attractive because of their compact key/signature sizes and well-established library support, while lattice-based constructions are of particular interest as they are conjectured to remain secure …

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

  18. Quantum Cryptography in Rreal-life Applications: Assumptions and Security

    … of unconditionally secure communication. The security is in principle based on the fundamental laws of physics. Security proofs show that if quantum cryptography is appropriately implemented, even the most powerful eavesdropper cannot decrypt the message from a cipher. The implementations of …

    toronto-retro Repository record for Quantum Cryptography in Rreal-life Applications: Assumptions and Security (opens in a new tab)

  19. Security of chip-scale quantum key distribution

    … (QKD) offers an alternative, promising security through security proofs that not even the most advanced, theoretically possible computer could break. However, even with security proofs, QKD only offers perfect security with devices perfectly meeting any assumptions made in the security …

    bristol Repository record for Security of chip-scale quantum key distribution (opens in a new tab) Download PDF for Security of chip-scale quantum key distribution (opens in a new tab)

  20. An Application of Secure Data Aggregation for Privacy-Preserving Machine Learning on Mobile Devices

    … from O(n2) to a constant value. We correct the security proof of Harn-Gong key establishment protocol and provide a secure threshold of degree of polynomial according to Byzantine Problem. We implement KDC side Harn-Gong key establishment primitives and prepare a proof-of- concept Android mobile …

    waterloo Repository record for An Application of Secure Data Aggregation for Privacy-Preserving Machine Learning on Mobile Devices (opens in a new tab)

Page 1 of 2