Sökning: "formal cryptography"

Hittade 4 avhandlingar innehållade orden formal cryptography.

  1. 1. Logics of Knowledge and Cryptography : Completeness and Expressiveness

    Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

    Sammanfattning : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. LÄS MER

  3. 2. Cryptographic Tools for Privacy Preservation

    Författare :Carlo Brunetta; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Outsourced Computation; Verifiability; Cryptography; Privacy; Cloud Computing;

    Sammanfattning : Data permeates every aspect of our daily life and it is the backbone of our digitalized society. Smartphones, smartwatches and many more smart devices measure, collect, modify and share data in what is known as the Internet of Things. LÄS MER

  4. 3. Equivalences and Calculi for Formal Verification of Cryptographic Protocols

    Författare :Johannes Borgström; Uwe Nestmann; Thomas A Henzinger; Martin Odersky; Andrew D Gordon; Viktor Kuncak; Björn Victor; EPFL; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. LÄS MER

  5. 4. Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results

    Författare :Johannes Åman Pohjola; Joachim Parrow; Björn Victor; Uwe Nestmann; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datavetenskap;

    Sammanfattning : As concurrent systems become ever more complex and ever more ubiquitous, the need to understand and verify them grows ever larger. For this we need formal modelling languages that are well understood, with rigorously verified foundations and proof techniques, applicable to a wide variety of concurrent systems. LÄS MER