188,964 research outputs found
Vehicle Communication using Secrecy Capacity
We address secure vehicle communication using secrecy capacity. In
particular, we research the relationship between secrecy capacity and various
types of parameters that determine secrecy capacity in the vehicular wireless
network. For example, we examine the relationship between vehicle speed and
secrecy capacity, the relationship between the response time and secrecy
capacity of an autonomous vehicle, and the relationship between transmission
power and secrecy capacity. In particular, the autonomous vehicle has set the
system modeling on the assumption that the speed of the vehicle is related to
the safety distance. We propose new vehicle communication to maintain a certain
level of secrecy capacity according to various parameters. As a result, we can
expect safer communication security of autonomous vehicles in 5G
communications.Comment: 17 Pages, 12 Figure
Relating two standard notions of secrecy
Two styles of definitions are usually considered to express that a security
protocol preserves the confidentiality of a data s. Reachability-based secrecy
means that s should never be disclosed while equivalence-based secrecy states
that two executions of a protocol with distinct instances for s should be
indistinguishable to an attacker. Although the second formulation ensures a
higher level of security and is closer to cryptographic notions of secrecy,
decidability results and automatic tools have mainly focused on the first
definition so far.
This paper initiates a systematic investigation of the situations where
syntactic secrecy entails strong secrecy. We show that in the passive case,
reachability-based secrecy actually implies equivalence-based secrecy for
digital signatures, symmetric and asymmetric encryption provided that the
primitives are probabilistic. For active adversaries, we provide sufficient
(and rather tight) conditions on the protocol for this implication to hold.Comment: 29 pages, published in LMC
Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-Activation
We determine the secrecy capacities of AVQCs (arbitrarily varying quantum
channels). Both secrecy capacity with average error probability and with
maximal error probability are derived. Both derivations are based on one common
code construction. The code we construct fulfills a stringent secrecy
requirement, which is called the strong code concept. We determine when the
secrecy capacity is a continuous function of the system parameters and
completely characterize its discontinuity points both for average error
criterion and for maximal error criterion. Furthermore, we prove the phenomenon
"super-activation" for secrecy capacities of AVQCs, i.e., two quantum channels
both with zero secrecy capacity, which, if used together, allow secure
transmission with positive capacity. We also discuss the relations between the
entanglement distillation capacity, the entanglement generating capacity, and
the strong subspace transmission capacity for AVQCs.Comment: arXiv admin note: text overlap with arXiv:1702.0348
- …