Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

equational theory

biblio

Visible to the public Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR

Submitted by grigby1 on Tue, 11/12/2019 - 4:30pm
  • Symbolic-Model
  • privacy
  • protocol verification
  • Protocols
  • pubcrawl
  • radiofrequency identification
  • RFID protocols
  • Security Properties
  • stateful cryptographic protocols
  • symbolic model
  • policy-based governance
  • Tamarin
  • Tamarin prover
  • Theorem Proving
  • tools
  • user-defined equational theories
  • verification tool
  • XOR operations
  • XOR theory
  • Cryptography
  • attack identification
  • automated unbounded verification
  • collaboration
  • composability
  • Compositionality
  • Computational modeling
  • Cryptographic Protocols
  • Cryptographic-Protocols
  • Analytical models
  • electronic payment protocols
  • equational theory
  • Exclusive-OR
  • exclusive-or operations
  • formal verification
  • Formal-Verification
  • Mathematical model
  • observational equivalence

Terms of Use  |  ©2023. CPS-VO