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 7 of 7 for “"Deniable encryption"”.

  1. Ensuring Data Confidentiality in Computing Devices via Plausibly Deniable Encryption and Secure Deletion

    … confidentiality during the data lifetime, encryption is often applied to local devices. However, traditional encryption is not able to defend against coercive attackers. To mitigate this problem, plausibly deniable encryption (PDE) can be utilized. Existing PDE frameworks which are designed …

    mtu Repository record for Ensuring Data Confidentiality in Computing Devices via Plausibly Deniable Encryption and Secure Deletion (opens in a new tab)

  2. Towards Reliable And Efficient Blockchain Applications

    … Another contribution is FSPDE, a plausible deniable encryption system designed specifically for blockchain applications to protect private keys against physical coercion. Lastly, FALCON offers an innovative Oracle solution to address the latency challenges commonly seen in existing …

    wayne-thes Repository record for Towards Reliable And Efficient Blockchain Applications (opens in a new tab)

  3. Deniable Storage Encryption for Mobile Devices

    … can be effectively preserved through storage encryption. All major mobile OSes now incorporate some form of storage encryption. In certain situations, this is inadequate, as users may be coerced into disclosing their decryption keys. In this case, the data must be hidden so that its very …

    concordia Repository record for Deniable Storage Encryption for Mobile Devices (opens in a new tab) Download PDF for Deniable Storage Encryption for Mobile Devices (opens in a new tab)

  4. Frontiers in Lattice Cryptography and Program Obfuscation

    … Our first contribution is the construction of a deniable attribute-based encryption scheme from lattices. A deniable encryption scheme is secure against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. An attribute-based …

    maryland Repository record for Frontiers in Lattice Cryptography and Program Obfuscation (opens in a new tab)

  5. Hiding secrets in public random functions

    … consider the task of building a searchable encryption scheme, which allows the users to search over the encrypted data and learn nothing other than the search result. Such a task is achievable if it is possible to embed the secret key of an encryption scheme into the code of a program that …

    bu Repository record for Hiding secrets in public random functions (opens in a new tab)

  6. ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY

    … of lattice-based cryptographic schemes. Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. The …

    cornell Repository record for ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY (opens in a new tab)

  7. Studies in incoercible and adaptively secure computation

    … keys - e.g. via threats, bribe, or court order. Deniable (or, incoercible) protocols allow coerced participants to convincingly lie about their inputs and secret keys, thereby still maintaining their privacy. While the concept was proposed more than twenty years ago, to date secure protocols …

    bu Repository record for Studies in incoercible and adaptively secure computation (opens in a new tab)