Research Topic Area 11.1: ARO Special Programs: STIR Program - Limited Learning, Rational In attention, and Unawareness in Games and Decision Problems

Abstract

A first-order conditional logic is considered, with semantics given by a variant epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially---faster than any inverse polynomial. This type of convergence is needed for reasoning about security protocols. A complete axiomatization is provided for this semantics, and it is shown how a qualitative proof of the correctness of a security protocol can be automatically converted to a quantitative proof appropriate for reasoning about concrete security.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 13, 2017
Accession Number
AD1059365

Entities

People

  • Joseph Halpern

Organizations

  • Cornell University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Acquisition
  • Airport Security
  • Artificial Intelligence
  • Automata
  • Autonomous Agents
  • Computational Complexity
  • Cybersecurity
  • Decision Theory
  • Game Theory
  • Information Operations
  • Reasoning
  • Security
  • Security Protocols
  • Semantics
  • Students
  • Technology Transfer

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.