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 3 of 3 for “"Computational Soundness"”.

  1. Computational soundness of formal reasoning about indistinguishability and non-malleability of cryptographic expressions

    … models of cryptography: formal cryptography and computational cryptography. Formal cryptography, originally inspired by the work of Dolev and Yao [14], takes an abstract and idealized view of security, and develops its proof techniques based on methods and ideas from logic and theory of …

    uvic Repository record for Computational soundness of formal reasoning about indistinguishability and non-malleability of cryptographic expressions (opens in a new tab)

  2. Automated Analysis in Generic Groups

    … (leveled) k-linear groups - and prove ''computational soundness'' theorems for the symbolic models. Based on this result, we formulate a master theorem that relates the hardness of an assumption to solving problems in polynomial algebra. We systematically analyze these problems …

    penn Repository record for Automated Analysis in Generic Groups (opens in a new tab)

  3. Verifying Cryptographic Security Implementations in C Using Automated Model Extraction

    … then be verified with CryptoVerif to obtain a computational security result directly, or with ProVerif, to obtain a computational security result by invoking a computational soundness theorem. In order to formalise the security properties of C programs and to prove the correctness of our …

    the-open-u Download PDF for Verifying Cryptographic Security Implementations in C Using Automated Model Extraction (opens in a new tab)