Searcharxiv⌕ Search

arXiv subjects

J. Almeida

Publications and source records attributed to J. Almeida.

24 records · Page 2Linked to original sources

Physical-Layer Security over Correlated Erasure Channels

We explore the additional security obtained by noise at the physical layer in a wiretap channel model setting. Security enhancements at the physical layer have been proposed recently using a secrecy metric based on the degrees of freedom that an attacker has with respect to the sent ciphertext. Prior work focused on cases in which the wiretap channel could be modeled as statistically independent packet erasure channels for the legitimate receiver and an eavesdropper. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the two communication channels. The resulting security enhancement is presented as a function of the correlation coefficient and the erasure probabilities for both channels. It is shown that security improvements are achievable by means of judicious physical-layer design even when the eavesdropper has a better channel than the legitimate receiver. The only case in which this assertion may not hold is when erasures are highly correlated across channels. However, we are able to prove that correlation cannot nullify the expected security enhancement if the channel quality of the legitimate receiver is strictly better than that of the eavesdropper.

cs.CR↗

Coding for Cryptographic Security Enhancement using Stopping Sets

In this paper we discuss the ability of channel codes to enhance cryptographic secrecy. Toward that end, we present the secrecy metric of degrees of freedom in an attacker's knowledge of the cryptogram, which is similar to equivocation. Using this notion of secrecy, we show how a specific practical channel coding system can be used to hide information about the ciphertext, thus increasing the difficulty of cryptographic attacks. The system setup is the wiretap channel model where transmitted data traverse through independent packet erasure channels with public feedback for authenticated ARQ (Automatic Repeat reQuest). The code design relies on puncturing nonsystematic low-density parity-check codes with the intent of inflicting an eavesdropper with stopping sets in the decoder. Furthermore, the design amplifies errors when stopping sets occur such that a receiver must guess all the channel-erased bits correctly to avoid an expected error rate of one half in the ciphertext. We extend previous results on the coding scheme by giving design criteria that reduces the effectiveness of a maximum-likelihood attack to that of a message-passing attack. We further extend security analysis to models with multiple receivers and collaborative attackers. Cryptographic security is enhanced in all these cases by exploiting properties of the physical-layer. The enhancement is accurately presented as a function of the degrees of freedom in the eavesdropper's knowledge of the ciphertext, and is even shown to be present when eavesdroppers have better channel quality than legitimate receivers.

cs.CR↗

VBS State Induced by Impurity Frustration in Cr8Ni

We provide a physically meaningful picture of the nature of the ground state of the Cr8Ni compound in the regime where it is a spin singlet. According to this picture, the anisotropy of the $Ni$ atom in the $Cr$ ring induces a dimerization in the molecule that makes the ground state to stabilize in a Valence Bond Solid phase of virtual spins. We characterize rigorously this phase by means of a particular non-local order parameter denoted the generalized string order parameter. In the completely antiferromagnetic regime, the system becomes frustrated. We have performed a numerical real-time evolution study of the correlations between the spin of the $Ni$ impurity and the rest of the spins in order to show the reaction of the system under this frustration. We provide results that manifestly show the agreement with the Valence Bond Solid picture introduced.

cond-mat.str-el↗

Twisted Order Parameter applied to Dimerized Ladders

We apply the twisted order parameter (TOP) for dimerized quantum spin ladders to locate the critical phases that separate gapped phases representing quantum spin liquids of various types. Using the DMRG, method we find that the TOP is a good order parameter for these systems regardless the number of legs. As a check, we reproduce with DMRG and periodic boundary conditions the computations previously done with Quantum Montecarlo for one-dimensional S=1/2, S=1, S=3/2 and S=2 Heisenberg chains with alternating bonds.

cond-mat.str-el↗

DMRG study of the Bond Alternating \textbf{S}=1/2 Heisenberg ladder with Ferro-Antiferromagnetic couplings

We obtain the phase diagram in the parameter space $(J'/J, γ)$ and an accurate estimate of the critical line separating the different phases. We show several measuments of the magnetization, dimerization, nearest neighbours correlation, and density of energy in the different zones of the phase diagram, as well as a measurement of the string order parameter proposed as the non vanishing phase order parameter characterizing Haldane phases. All these results will be compared in the limit $J'/J\gg 1$ with the behaviour of the $\textbf{S}=1$ Bond Alternated Heisenberg Chain (BAHC). The analysis of our data supports the existence of a dimer phase separated by a critical line from a Haldane one, which has exactly the same nature as the Haldane phase in the $\textbf{S}=1$ BAHC.

cond-mat.str-el↗

Can two chaotic systems give rise to order?

The recently discovered Parrondo's paradox claims that two losing games can result, under random or periodic alternation of their dynamics, in a winning game: "losing+losing=winning". In this paper we follow Parrondo's philosophy of combining different dynamics and we apply it to the case of one-dimensional quadratic maps. We prove that the periodic mixing of two chaotic dynamics originates an ordered dynamics in certain cases. This provides an explicit example (theoretically and numerically tested) of a different Parrondian paradoxical phenomenon: "chaos+chaos=order"

nlin.CD↗