22,478 research outputs found
Enhancement of Secrecy of Block Ciphered Systems by Deliberate Noise
This paper considers the problem of end-end security enhancement by resorting
to deliberate noise injected in ciphertexts. The main goal is to generate a
degraded wiretap channel in application layer over which Wyner-type secrecy
encoding is invoked to deliver additional secure information. More
specifically, we study secrecy enhancement of DES block cipher working in
cipher feedback model (CFB) when adjustable and intentional noise is introduced
into encrypted data in application layer. A verification strategy in exhaustive
search step of linear attack is designed to allow Eve to mount a successful
attack in the noisy environment. Thus, a controllable wiretap channel is
created over multiple frames by taking advantage of errors in Eve's
cryptanalysis, whose secrecy capacity is found for the case of known channel
states at receivers. As a result, additional secure information can be
delivered by performing Wyner type secrecy encoding over super-frames ahead of
encryption, namely, our proposed secrecy encoding-then-encryption scheme. These
secrecy bits could be taken as symmetric keys for upcoming frames. Numerical
results indicate that a sufficiently large secrecy rate can be achieved by
selective noise addition.Comment: 11 pages, 8 figures, journa
Optimal sequential fingerprinting: Wald vs. Tardos
We study sequential collusion-resistant fingerprinting, where the
fingerprinting code is generated in advance but accusations may be made between
rounds, and show that in this setting both the dynamic Tardos scheme and
schemes building upon Wald's sequential probability ratio test (SPRT) are
asymptotically optimal. We further compare these two approaches to sequential
fingerprinting, highlighting differences between the two schemes. Based on
these differences, we argue that Wald's scheme should in general be preferred
over the dynamic Tardos scheme, even though both schemes have their merits. As
a side result, we derive an optimal sequential group testing method for the
classical model, which can easily be generalized to different group testing
models.Comment: 12 pages, 10 figure
Quantum cryptography: key distribution and beyond
Uniquely among the sciences, quantum cryptography has driven both
foundational research as well as practical real-life applications. We review
the progress of quantum cryptography in the last decade, covering quantum key
distribution and other applications.Comment: It's a review on quantum cryptography and it is not restricted to QK
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
An information-theoretic approach is proposed to watermark embedding and
detection under limited detector resources. First, we consider the attack-free
scenario under which asymptotically optimal decision regions in the
Neyman-Pearson sense are proposed, along with the optimal embedding rule.
Later, we explore the case of zero-mean i.i.d. Gaussian covertext distribution
with unknown variance under the attack-free scenario. For this case, we propose
a lower bound on the exponential decay rate of the false-negative probability
and prove that the optimal embedding and detecting strategy is superior to the
customary linear, additive embedding strategy in the exponential sense.
Finally, these results are extended to the case of memoryless attacks and
general worst case attacks. Optimal decision regions and embedding rules are
offered, and the worst attack channel is identified.Comment: 36 pages, 5 figures. Revised version. Submitted to IEEE Transactions
on Information Theor
- …