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
computational complexity
biblio
CPSS: CP-ABE based Platoon Secure Sensing Scheme against Cyber-Attacks
Submitted by
grigby1
on Fri, 07/24/2020 - 12:41pm
pubcrawl
Access Control
access control structure
authorisation
Cloud Computing
collaboration
computational complexity
CP-ABE
CP-ABE based platoon
CPSS
Cryptography
cyber-attacks
cyphertext-policy attribute-based encryption
distance fluctuations
driving applications
encryption
Gold
key distribution process
life-threatening accidents
LTE-V2X
malicious attacks
platoon key
platoon maneuvers
platoon secure sensing scheme
platoon stability
policy-based governance
polynomial time solution
position information
Public key
Safety
Scalability
security insurance
sensing data
sensors
Stability analysis
traffic efficiency
traffic engineering computing
Veins platform
biblio
Protect white-box AES to resist table composition attacks
Submitted by
aekwall
on Mon, 07/20/2020 - 10:54am
Resiliency
pubcrawl
composability
Metrics
Data protection
public key cryptography
computational complexity
Secret key
Table lookup
affine mappings
Billet et al.'s attack
cryptographic software protection
De Mulder et al.'s attack
key recovery attacks
key-embedding lookup tables
table-composition-targeting cryptanalysis techniques
table-composition-targeting white-box attacks
Time complexity
WBAC
white-box AES protection
white-box attack context
white-box cryptography
white box cryptography
biblio
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
Submitted by
aekwall
on Mon, 07/20/2020 - 10:45am
Resiliency
composability
graph theory
Cryptography
Computational modeling
Metrics
testing
computational complexity
Complexity theory
pubcrawl
Integrated circuit modeling
Resistance
search problems
black-box complexity
black-box hardness
box times
collision-resistant hashing
description size
graph property testing
graph size
hard property
Ramsey theory
succinct black-box
TFNP problems
the Ramsey problem
white-box complexity
white-box hardness
white-box model
white-box Ramsey problem
white box cryptography
biblio
Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and Complexity
Submitted by
grigby1
on Fri, 07/10/2020 - 11:41am
privacy
query processing
Scalability
computer science
computational complexity
Heuristic algorithms
pubcrawl
Databases
Complexity theory
approximation
Approximation algorithms
approximations
conjunctive queries
conjunctive query
data cleaning
data lineage
debugging
deletion propagation
dichotomy
dynamic programming
investigated problem
key preserving
multiple key preserving conjunctive queries
multiple project-free
multiple queries
nontrivial set
polynomials
problem funda-mental
quality management
query feedback
realistic case
repairing data
single query case
standard deletion propagation problem
tuples
view propagation
view side-effect
data deletion
biblio
Reasoning about Sequential Cyberattacks
Submitted by
aekwall
on Mon, 07/06/2020 - 10:15am
Scalability
invasive software
Resiliency
pubcrawl
Social network services
Computational modeling
Metrics
Cybersecurity
optimisation
Mathematical model
Lattices
computational complexity
Complexity theory
cognition
Human Factors
Compositionality
computer systems
adversarial reasoning
Cost function
cyber adversaries
cyber-adversary
cyber-attack modeling
fixed-point operator
NP-complete problem
sequential chained attacks
sequential cyberattacks
simulated vulnerability data
vulnerability dependencies
Cyber Dependencies
biblio
Efficient Implementation of Cryptography on Points of an Elliptic Curve in Residue Number System
Submitted by
grigby1
on Fri, 06/26/2020 - 12:54pm
adding points
arithmetic operations
computational complexity
Cryptography
doubling points
elliptic curve
Elliptic curve cryptography
Elliptic curves
Galois fields
Jacobian matrices
Mathematical model
Metrics
Modular Multiplication
pubcrawl
public key cryptography
residue number system
residue number systems
resilience
Resiliency
RNS
Scalability
weighted number system
biblio
A Game Theoretic Approach for Dynamic Information Flow Tracking with Conditional Branching
Submitted by
aekwall
on Mon, 06/08/2020 - 11:55am
reachability probability
polynomial-time algorithm
NetRecon attack
Linear programming
infinite-horizon undiscounted stochastic games
infinite-horizon stochastic game
DIFT
data-flow handling
control-flow commands
conditional-branch tracking
conditional branching
APT
advanced persistent threats
nonlinear programming
game theoretic security
Dynamic Information Flow Tracking
game theoretic approach
Nash Equilibrium
stochastic games
linear optimization problem
Predictive Metrics
Human Factors
system security
Games
process control
computational complexity
probability
Stochastic processes
Analytical models
Data protection
reachability analysis
data flow analysis
pubcrawl
security
Scalability
security of data
biblio
Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket
Submitted by
aekwall
on Mon, 06/08/2020 - 11:33am
C2LSH
Compositionality
computational complexity
Cryptography
data sorting
file organisation
hash algorithms
Hash functions
hash table
heap sort of hash bucket algorithm
Heapsort
Image detection
locality sensitive hashing
locality-sensitive hashing algorithm
machine learning
nearest neighbor query
nearest neighbor search
nearest neighbour methods
NNS
Pattern recognition
pubcrawl
query processing
Resiliency
Sorting
space complexity
tree search method
tree searching
biblio
An Efficient Secure Coded Edge Computing Scheme Using Orthogonal Vector
Submitted by
grigby1
on Tue, 06/02/2020 - 11:54am
actual EC deployments
Cloud Computing
communication overhead
computational complexity
compute-intensive applications
data confidentiality
data matrix
Data Security
Decoding
edge computing
edge devices
efficient edge
efficient secure coded edge computing scheme
high decoding complexities
Human behavior
Human Factors
information theoretic security
information theoretical security
irrelevant random blocks
last mile problem
linear codes
linear coding
Metrics
original data blocks
orthogonal vector
policy-based governance
pubcrawl
resilience
Resiliency
Scalability
secure edge
security of data
unreliable edge nodes
user device
Vectors
widespread solution
biblio
Asymptotically Optimal Pruning for Nonholonomic Nearest-Neighbor Search
Submitted by
grigby1
on Fri, 05/22/2020 - 2:39pm
pubcrawl
mobile robots
Metrics
Measurement
nearest neighbour methods
computational complexity
search problems
nearest neighbor search
asymptotic computational bottleneck
asymptotic properties
computationally demanding task
differential geometry
distance evaluations
exact Nearest-Neighbor Search
explicit distance comparisons
geodesic distance
k-d tree algorithm
nonholonomic constraints
optimal pruning
Path Planning
pruning techniques
sampling-based motion planning algorithms
set theory
tree searching
1
2
3
4
5
6
7
8
next ›
last »
