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 57 for “"Provable security"”.

  1. Provable Security for Cryptocurrencies

    … However, it is difficult to reason about the security of cryptocurrencies. Bitcoin is a complex system, comprising many intricate and subtly-interacting protocol layers. At each layer it features design innovations that (prior to our work) have not undergone any rigorous analysis. Compounding …

    maryland Repository record for Provable Security for Cryptocurrencies (opens in a new tab)

  2. Provable Security of Permutation-Based Cryptography

    … adversaries. In this thesis, we focus on the provable security of permutation-based cryptography, which has become central to lightweight symmetric schemes, particularly through the sponge construction. The work strengthens their theoretical foundations by tightening some existing security …

    radboud Repository record for Provable Security of Permutation-Based Cryptography (opens in a new tab) Download PDF for Provable Security of Permutation-Based Cryptography (opens in a new tab)

  3. Provable security support for kerberos (and beyond)

    … standard protocols, Kerberos is no exception to security flaws and weaknesses, as has been demonstrated in several prior works. Provable security guarantees go a long way in restoring users' faith, thus making a protocol an even stronger candidate for standards. In this thesis, our goal was thus …

    gatech Repository record for Provable security support for kerberos (and beyond) (opens in a new tab)

  4. Transformation of cryptographic primitives: provable security and proof presentation

    … for each transformation, we do two studies: its provable security (proving that if the original cryptographic primitive is secure, then the transformed cryptographic primitive is also secure); its proof presentation (exploring improved ways of presenting the proof). Our contributions divide into …

    kent Download PDF for Transformation of cryptographic primitives: provable security and proof presentation (opens in a new tab)

  5. Towards secure communication and authentication: Provable security analysis and new constructions

    … lives. It is a crucial goal to provide formal security guarantees for such protocols. In this thesis, we apply the provable security approach, a standard method used in cryptography to formally analyze the security of cryptographic protocols, to three problems related to secure communication …

    gatech Repository record for Towards secure communication and authentication: Provable security analysis and new constructions (opens in a new tab)

  6. Empirical analysis of using erasure coding in outsourcing data storage with provable security

    Proof of retrievability (POR) and proof of data possession (PDP) are cryptographic tools for auditing big data on a storage server or in the cloud. Their goals are to verify that the server is storing data and, in case of data alteration, recovering this data. These tools provide probabilistic …

    nps Repository record for Empirical analysis of using erasure coding in outsourcing data storage with provable security (opens in a new tab)

  7. Pseudorandom number generators using multiple sources of entropy

    … is in the generation of keys, used as a security measure for many cryptographic protocols. The main measure of randomness is achieved by looking at entropy, a measure of the disorder of a system. Nature is able to provide us with many sources that are high in entropy. However, many …

    uvic Repository record for Pseudorandom number generators using multiple sources of entropy (opens in a new tab)

  8. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication

    … requirements for these protocols: efficiency and security. Efficiency is evaluated using the computational overhead to execute a protocol. In modern cryptography, one way to ensure the security of a protocol is by means of provable security. Provable security consists of a security model that …

    waterloo Repository record for Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication (opens in a new tab)

  9. Symmetric schemes for efficient range and error-tolerant search on encrypted data

    … varying levels of efficiency, functionality, and security, and efficient searchable encryption focuses on schemes enabling sub-linear (in the size of the database) search time. I present the first cryptographic study of efficient searchable symmetric encryption schemes supporting two types of …

    gatech Repository record for Symmetric schemes for efficient range and error-tolerant search on encrypted data (opens in a new tab)

  10. Machine-aided analysis of vote privacy using computationally complete symbolic attacker

    Security protocols employ cryptographic primitives such as encryption and digital signatures to provide security guarantees of confidentiality and authenticity in the presence of malicious attackers. Due to the complexities of cryptographic primitives, subtle nature of the security guarantees and …

    missouri Repository record for Machine-aided analysis of vote privacy using computationally complete symbolic attacker (opens in a new tab)

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

    … problem often suffer from their length. Their security reduction usually involves either rewinding [1] (leading to looseness) or complex reasoning (requiring non-standard assumptions) [2, 3, 4, 5]. At EURO CRYPT ‘03, Goh and Jarecki presented a signature scheme (EDL), a discrete logarithm-based …

    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)

  12. Secure Group Communication

    … However, many of the protocols do not provide provable security and do not provide other security guarantees about the conversation. One example of a missing security property is message order consistency between all participants. In this dissertation I demonstrate practical attacks against a …

    umn Repository record for Secure Group Communication (opens in a new tab)

  13. Proof-of-stake longest chain protocols: security vs predicability

    … remarkably simple and has been proven to provide security against any adversary with less than 50% of the total hashing power. Proof-of-stake (PoS) protocols are an energy-efficient alternative; however existing protocols adopting Nakamoto’s longest chain design achieve provable security only by …

    uiuc Repository record for Proof-of-stake longest chain protocols: security vs predicability (opens in a new tab)

  14. Security in watermarking and authentication of noisy data

    … random noises. In this thesis, we study the security aspect of digital image watermarking and biometric authentication. Unlike many previous approaches where the attackers are random, we consider ``smart'' attackers, who can add carefully designed noises to the data to fail the system. We …

    nus Repository record for Security in watermarking and authentication of noisy data (opens in a new tab) Download file for Security in watermarking and authentication of noisy data (opens in a new tab)

  15. Security Models and Proofs for Key Establishment Protocols

    … over an open network. In the past, the purported security of a key establishment protocol was justified if it could be shown to withstand popular attack scenarios by heuristic analysis. Since this approach does not account for all possible attacks, the security guarantees are limited and often …

    waterloo Repository record for Security Models and Proofs for Key Establishment Protocols (opens in a new tab)

  16. PERFORMANCE OF HYBRID SIGNATURES FOR PUBLIC KEY INFRASTRUCTURE CERTIFICATES

    … rely on a mathematical hardness assumption for provable security. As we transition into a post-quantum era, the hardness assumptions used by traditional digital signature algorithms are increasingly at risk of being solvable in polynomial time. This renders the entirety of public key …

    nps Repository record for PERFORMANCE OF HYBRID SIGNATURES FOR PUBLIC KEY INFRASTRUCTURE CERTIFICATES (opens in a new tab)

  17. Real World Secret Leaking

    … ceremony analysis and other techniques from the provable security paradigm to formally describe and evaluate security goals for both constructions.

    mcmaster Repository record for Real World Secret Leaking (opens in a new tab)

Page 1 of 3