The potential for capacity increase in multiantenna wireless communication systems has drawn considerable attention to space-time codes. However, most of the existing space-time code construction methods have assumed ideal channel models: either quasi-static fading or fast fading. In this work, we derive the performance criteria for space-time coded wireless communication systems taking into ac...

Forecasting and preventing silting of hydraulic structures, irrigation canals, reservoirs, as well improving methods for maintaining their throughput, is particularly important. In this regard, special attention paid to research work aimed at calculation methods, taking into account the variability channel factors in design construction structures planned construction. This article analyzes inf...

Enhancing the public’s awareness of environmental protection is an important measure to achieve goal carbon peak and neutrality. This article takes improvement public participation in as starting point, discusses enthusiasm its legal channels for reporting complaining pollution, summarizes achievements existing problems construction complaint channels, proposes improve reports. Channel counterm...

Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Buttyán [4] and Beye & Veugen [3] devised trees to withstand such attacks, but assumed adversaries to be non-adaptive, without acce...

Oblivious Signature-Based Envelope (OSBE) has been widely employed for anonymity-orient and privacypreserving applications. The conventional OSBE execution relies on a secure communication channel to protect against eavesdroppers. In TCC 2012, Blazy, Pointcheval and Vergnaud proposed a framework of OSBE (BPV-OSBE) without requiring any secure channel by clarifying and enhancing the OSBE securit...

Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys and computing on them in a manner that preserves security even when the adversary is able to obtain information leakage during the computation on the key. Using any fully homomorphic encryption with re-randomizable ciph...

Secure channel protocols protect data transmission over a network from being overheard or tampered with. In the common abstraction, cryptographic models for channels involve a single key for ensuring the central security notions of confidentiality and integrity. The currently developed next version of the Transport Layer Security protocol, TLS 1.3, however introduces a key updating mechanism in...

In this paper, we deal with the stabilizability of a scalar plant through a noisy discrete channel. Our scheme can be regarded as a variation of the controllers based on dynamic quantizers introduced in [3] and [4], but our analysis based on Lyapunov function allows us to take into consideration more general discrete memoryless channels. Given a plant and a discrete memoryless channel we will p...

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include nodeor linkfailures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Kötter and Kschischang, we introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based o...

A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the channel operates in the broadcast mode. The channel switches to the multiple access mode when the relay transmits. If the broadcast component channel is physica...