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
Fostering collaboration among CPS professionals in academia, government, and industry
CPS-VO
Upper bound
biblio
Secrecy Capacity of Indoor Visible Light Communication Channels
Submitted by
grigby1
on Mon, 01/21/2019 - 11:20am
security
pubcrawl
Metrics
Resiliency
Scalability
Wireless communication
telecommunication security
optical receivers
optical transmitters
physical layer security
secrecy capacity
optical communication
indoor communication
channel capacity
closed-form expressions
dimmable average optical intensity constraint
future wireless communications
indoor scenario
indoor visible light communication channels
indoor VLC
information theory principle
Optical noise
peak optical intensity constraint
Upper bound
visible light communications
VLC system
Visible Light Communications Security
biblio
Verification of Randomized Security Protocols
Submitted by
grigby1
on Thu, 05/24/2018 - 11:22am
Complexity theory
Compositionality
computability
computational complexity
coNEXPTIME
Cryptographic Protocols
Electronic mail
encryption
formal logic
Indistinguishability
matching lower bound
monadic first order logic
nonsatisfiability problem
Policy
policy-based collaboration
privacy
probability
protocol verification
Protocols
pubcrawl
randomized security protocol Verification
secrecy problem
secret sec
sequence
sequences
standard cryptographic primitives
Upper bound
biblio
Evaluating power system vulnerability to false data injection attacks via scalable optimization
Submitted by
el_wehby
on Mon, 05/14/2018 - 3:07pm
Algorithm design and analysis
bi-level optimization problem
false data injection cyber-attacks
Generators
IEEE 118-bus system
integer programming
Linear programming
Load flow
lower bounds
mixed-integer linear program
optimization
physical power flow maximization
Polish system
power system security
power system vulnerability evaluation
scalable optimization
security of data
Smart Grids
state estimation
Upper bound
upper bounds
vulnerability assessments
worst-case attack consequences
1449080
biblio
A Robust Decentralized Control Framework for Enhancing Smart Grid Transient Stability
Submitted by
grigby1
on Tue, 02/27/2018 - 1:36pm
Compositionality
Cyber Dependencies
cyber-physical systems
Decentralized Control
distributed storage systems
Generators
Human behavior
Human Factors
Metrics
power system stability
pubcrawl
resilience
Resiliency
Rotors
Scalability
Smart Grids
Stability analysis
Transient analysis
Upper bound
biblio
Interactive message transmission over adversarial wiretap channel II
Submitted by
grigby1
on Wed, 01/10/2018 - 11:20am
active adversary
adversarial noise
adversarial wiretap channel II
collaboration
composability
Conferences
Cryptographic Protocols
Human behavior
human factor
information theoretic security
interactive message transmission
interactive protocols
Jamming
jamming signal
Metrics
Mobile communication
perfect information theoretic security
perfectly secure protocol family
Policy
Protocols
pubcrawl
public key infrastructure
quantum computers
Random variables
Reliability
Resiliency
Scalability
security
telecommunication security
two-way wiretap II channel
Upper bound
wireless channels
wireless setting
Wyner wiretap II model
biblio
Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model
Submitted by
grigby1
on Wed, 01/10/2018 - 11:20am
adaptive adversaries
collaboration
Complexity theory
composability
concrete upper bounds
Cryptographic Protocols
Cryptography
Databases
EASYCRYPT proof assistant
game parameters
game theory
Games
games approach sequence
honest-but-curious security
Human behavior
human factor
information theoretic security
information-theoretic security
Metrics
multiparty cryptographic protocols
nonprogrammable random choices
oracle knowledge
party private count retrieval protocol
Policy
Protocols
pubcrawl
random oracle model
real-ideal paradigm
Resiliency
Scalability
security of data
Servers
Upper bound
biblio
A fast information-theoretic approximation of joint mutual information feature selection
Submitted by
grigby1
on Thu, 12/28/2017 - 12:37pm
approximation theory
classification
collaboration
Complexity theory
composability
computational complexity
data analysis
data reduction
dimensionality reduction
Entropy
fast information-theoretic approximation
Feature Selection
feature size
filtering theory
greedy algorithms
greedy forward search
greedy search complexity
high dimensional datasets
Human behavior
Human Factors
information theory
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
polynomial time
pubcrawl
Redundancy
Resiliency
Scalability
Science of Security
search problems
UCI datasets
unified framework
Upper bound
biblio
Evaluating power system vulnerability to false data injection attacks via scalable optimization
Submitted by
grigby1
on Mon, 11/27/2017 - 11:24am
Algorithm design and analysis
bi-level optimization problem
composability
false data injection cyber-attacks
Generators
IEEE 118-bus system
integer programming
Linear programming
Load flow
lower bounds
Metrics
mixed-integer linear program
optimization
physical power flow maximization
Polish system
power grid vulnerability analysis
power system security
power system vulnerability evaluation
pubcrawl
Resiliency
scalable optimization
security of data
Smart Grids
state estimation
Upper bound
upper bounds
vulnerability assessments
worst-case attack consequences
biblio
The Unreasonable Effectiveness of Address Clustering
Submitted by
grigby1
on Fri, 11/03/2017 - 10:33am
address clustering
address reuse
Bipartite graph
bitcoin
Bitcoin system
blockchain
blockchain security
cryptocurrency
Electronic mail
electronic money
financial data processing
merging
one-to-many mapping
Online banking
pattern clustering
Protocols
pubcrawl
Resiliency
Scalability
security of data
Size measurement
transaction microstructure
Upper bound
biblio
"Discovery of De-identification Policies Considering Re-identification Risks and Information Loss"
Submitted by
grigby1
on Thu, 02/23/2017 - 11:14am
Computational modeling
data analysis
data privacy
de-identification
deidentification policies
deidentified data
Entropy
HIPPA
information entropy
information loss
Lattices
learning (artificial intelligence)
privacy
privacy leakage
pubcrawl170105
reidentification risks
risk analysis
Safe Harbor
Synthetic aperture sonar
UCI machine learning repository
Upper bound
1
2
next ›
last »
