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

trilemma

biblio

Visible to the public Resolving the Trilemma in Logic Encryption

Submitted by grigby1 on Fri, 04/03/2020 - 12:56pm
  • post SAT approaches
  • trilemma
  • traditional logic encryption algorithms
  • structural security
  • SAT attack
  • Resiliency
  • resilience
  • query complexity
  • pubcrawl
  • provable security
  • provable logic obfuscation
  • pre-SAT approaches
  • Compositionality
  • Metrics
  • logic resynthesis
  • logic design
  • logic circuits
  • locking robustness
  • locked circuit
  • hardware ip protection
  • error number
  • encryption efficiency
  • Cryptography
  • computability
biblio

Visible to the public Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency - Choose Two

Submitted by grigby1 on Thu, 01/31/2019 - 12:18pm
  • low latency overhead
  • trilemma
  • telecommunication security
  • Synchronization
  • strong anonymity
  • sender anonymity
  • Resiliency
  • resilience
  • Recipient Anonymity
  • pubcrawl
  • Protocols
  • privacy
  • Petri nets
  • nontraditional bandwidth
  • Metrics
  • AC protocol nodes
  • low bandwidth overhead
  • latency overhead choices
  • Human Factors
  • Human behavior
  • fundamental constraints
  • Cryptography
  • composability
  • bandwidth overhead
  • Bandwidth
  • anonymous communication protocols
  • anonymity trilemma
  • anonymity
  • AC systems
  • AC protocols

Terms of Use  |  ©2023. CPS-VO