On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On using probabilistic Turing machines to model participants in cryptographic protocols
scientific article

    Statements

    On using probabilistic Turing machines to model participants in cryptographic protocols (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    provable security
    0 references
    probabilistic Turing machine
    0 references
    \(\mathbb Z\)-algebra
    0 references
    cryptographic protocol
    0 references
    0 references
    0 references