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

sufficient condition

biblio

Visible to the public Authentication with Mildly Myopic Adversaries

Submitted by grigby1 on Thu, 01/28/2021 - 1:11pm
  • no-adversary capacity
  • zero authentication capacity
  • unsecured communications settings
  • underlying channel
  • transmitted sequences
  • telecommunication security
  • telecommunication channels
  • sufficient condition
  • stochastic encoder
  • Scalability
  • Resiliency
  • resilience
  • received information
  • pubcrawl
  • positive authentication capacity
  • noisy versions
  • Adversary Models
  • mildly myopic adversaries
  • Metrics
  • message authentication
  • malicious adversary
  • keyless authentication
  • Human behavior
  • essentially omniscient adversary
  • deterministic encoder
  • Cryptographic Protocols
  • channel states
  • channel condition
  • channel coding
  • channel capacity
  • binary channel model
biblio

Visible to the public A Decision Procedure for Deadlock-Free Routing in Wormhole Networks

Submitted by BrandonB on Wed, 05/06/2015 - 2:54pm
  • Linear programming
  • wormhole switching technique
  • wormhole networks
  • torus topologies
  • Topology
  • telecommunication network topology
  • telecommunication network routing
  • System recovery
  • Switches
  • sufficient condition
  • Routing protocols
  • routing functions
  • Routing
  • network topology
  • necessary condition
  • adaptive routing function
  • integer programming
  • Grippers
  • formal methods
  • Design methodology
  • decision procedure
  • deadlocks
  • deadlock-free routing
  • deadlock freedom
  • computer networks
  • computational complexity
  • Communication networks
  • communication network design
  • co-NP-complete problem
  • automatic verification

Terms of Use  |  ©2023. CPS-VO