Dissertation/Thesis Abstract

Deciding static inclusion for Δ-strong and ω▿-strong intruder theories: Applications to cryptographic protocol analysis
by Gero, Kimberly A., Ph.D., State University of New York at Albany, 2015, 58; 3709128
Abstract (Summary)

In this dissertation we will be studying problems relating to indistinguishability. This topic is of great interest and importance to cryptography. Cryptographic protocol analysis is currently being studied a great deal due to numerous high profile security breaches. The form of indistinguishability that we will be focusing on is static inclusion and its subcase static equivalence. Our work in this dissertation is based on “Intruders with Caps.” Our main results are providing co-saturation procedures for deciding whether a frame A is statically included in a frame B over Δ-strong and ω▿-strong intruder theories, where a frame consists of hidden data and substitutions that represent knowledge that an intruder could have gained from eavesdropping on message exchanges by agents.

Indexing (document details)
Advisor: Narendran, Paliath
Commitee: Lynch, Christopher, Murray, Neil V.
School: State University of New York at Albany
Department: Computer Science
School Location: United States -- New York
Source: DAI-B 76/11(E), Dissertation Abstracts International
Subjects: Computer science
Keywords: Cryptographic protocol analysis, Guessing attacks, Indistinguishability, Static inclusion, Term rewriting systems, Unification
Publication Number: 3709128
ISBN: 978-1-321-84623-2
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy