Scribd Logo
Upload

Welcome to Scribd!

  • BAN Rules

    Uploaded by

    Larisa Dumitrache
    9 views1 page
    The document outlines inference rules for beliefs in message authentication codes (MACs) using shared keys and public keys. It includes rules for: 1) believing a message was said by another agent based on a MAC with a shared key; 2) believing a message was said based on a MAC with a public key; 3) believing a message is fresh and was said based on nonce verification; 4) believing a message based on an agent's control and belief in the message; 5) combining beliefs; and 6) seeing message components from MACs.

    Original Description:

    Original Title

    1. BAN Rules

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document outlines inference rules for beliefs in message authentication codes (MACs) using shared keys and public keys. It includes rules for: 1) believing a message was said by another agent based on a MAC with a shared key; 2) believing a message was said based on a MAC with a public key; 3) believing a message is fresh and was said based on nonce verification; 4) believing a message based on an agent's control and belief in the message; 5) combining beliefs; and 6) seeing message components from MACs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views1 page

    BAN Rules

    Uploaded by

    Larisa Dumitrache
    The document outlines inference rules for beliefs in message authentication codes (MACs) using shared keys and public keys. It includes rules for: 1) believing a message was said by another agent based on a MAC with a shared key; 2) believing a message was said based on a MAC with a public key; 3) believing a message is fresh and was said based on nonce verification; 4) believing a message based on an agent's control and belief in the message; 5) combining beliefs; and 6) seeing message components from MACs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    BAN inference rules

    Message meaning rules for shared keys:


    P |≡ (Q ↔K P ), P ▹ {X}K P believes (Q ↔K P ), P sees {X}K
    M M − SK
    P |≡ (Q |∼ X) P believes (Q said X)

    Message meaning rules for public keys:

    P |≡7→K Q, P ▹ {X}K −1
    MM − PK
    P |≡ (Q |∼ X)
    The nonce-verification rule:
    P |≡ ♯(X), P |≡ Q |∼ X P believes fresh(X), P believes Q said X
    NV NV
    P |≡ (Q |≡ X) P believes (Q believes X)
    The jurisdiction rule:
    P |≡ Q |⇒ X, P |≡ Q |≡ X P believes (Q controls X), P believes (Q believes X
    JR JR
    P |≡ X P believes X
    Belief and components:
    P |≡ X, P |≡ Y P |≡ (X, Y )
    BC1 BC2
    P |≡ (X, Y ) P |≡ X

    P |≡ Q |≡ (X, Y ) P |≡ Q |∼ (X, Y )
    BC3 BC4
    P |≡ Q |≡ X P |≡ Q |∼ X

    Seeing and components:


    P ▹ (X, Y ) P ▹ hXiY
    SC1 SC2
    P ▹X P ▹X

    P |≡ Q ↔K P, P ▹ {X}K P |≡7→K P, P ▹ {X}K


    SC3 SC4
    P ▹X P ▹X

    P |≡7→K Q, P ▹ {X}K −1
    SC5
    P ▹X
    Nonces concatenation

    P |≡ ♯(X)
    NC
    P |≡ ♯(X, Y )
    Commutativity of secrets:

    P |≡ R
    X R′ P |≡ Q |≡ R
    X R′
    P |≡ R′
    X R P |≡ Q |≡ R′
    X R

    Commutativity of keys:

    P |≡ R ↔X R′ P |≡ Q |≡ R ↔X R′
    P |≡ R′ ↔X R P |≡ Q |≡ R′ ↔X R
    1

    You might also like