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
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
polynomial time
biblio
Transparent IFC Enforcement: Possibility and (In)Efficiency Results
Submitted by grigby1 on Thu, 03/04/2021 - 2:34pm
security lattice
programming languages
pubcrawl
real-world programs
resilience
Resiliency
Runtime
secure information flow control
Secure Multi-Execution
secure programs
security condition
polynomial time
security of data
Semantics
SME family
termination insensitive noninterference
third-party systems
transparency
transparent enforcement
transparent IFC enforcement
white-box
FlowFox browser
white box
security
black-box
black-box enforcement
Browsers
composability
computational complexity
Computer languages
efficiency
faceted secure multiexecution
White Box Security
FSME
IFC community
Information Flow Control
Lattices
memory overhead
Metrics
Multiple Facets
no-write-down no-read-up style security policy
noninterference
biblio
Survey on Cryptanalysis of Code-Based Cryptography: From Theoretical to Physical Attacks
Submitted by grigby1 on Thu, 02/14/2019 - 11:12am
linear codes
theoretical cryptography
structural attacks
strong mathematical background
side-channel attacks
public-key cryptosystem
public-key cryptography
post-quantum standardization
Post-quantum cryptography
polynomials
polynomial time
oldest quantum-resistant proposition
number theory problems
number theory
NIST's announcement
McEliece scheme
pubcrawl
elliptic curve
discrete logarithm
coding theory
code-based cryptography
adequate post-quantum cryptographic schemes
quantum cryptography
side-channel analysis
public key cryptography
quantum computer
Decoding
Computers
Compositionality
physical attacks
encryption
composability
biblio
A fast information-theoretic approximation of joint mutual information feature selection
Submitted by grigby1 on Thu, 12/28/2017 - 1:37pm
polynomial time
JMI maximization
JMI scales
joint mutual information feature selection
joint mutual information maximization
Metrics
minimum features subset
Mutual information
pattern classification
Policy-Governed Secure Collaboration
information theory
pubcrawl
Redundancy
Resiliency
Scalability
Science of Security
search problems
UCI datasets
unified framework
Upper bound
fast information-theoretic approximation
classification
collaboration
Complexity theory
composability
computational complexity
data analysis
data reduction
dimensionality reduction
Entropy
approximation theory
Feature Selection
feature size
filtering theory
greedy algorithms
greedy forward search
greedy search complexity
high dimensional datasets
Human behavior
Human Factors
biblio
Robust-to-dynamics linear programming
Submitted by grigby1 on Wed, 03/08/2017 - 1:55pm
pubcrawl170110
upper bounds
uncertainty
structural properties
semidefinite programming based algorithm
semidefinite programming
Robustness
robust-to-dynamics optimization
robust-to-dynamics linear programming
robust optimization problems
Robust optimization
RDO
Asymptotic stability
polynomial time
optimization
Nonlinear dynamical systems
mathematical program
linear system
Linear programming
linear dynamics
Heuristic algorithms
Facsimile
Dynamical Systems
dynamical system
