scholarly journals Probability of Error in Information-Hiding Protocols

2007 ◽  
Author(s):  
Konstantinos Chatzikokolakis ◽  
Catuscia Palamidessi ◽  
Prakash Panangaden
Keyword(s):  
Information Hiding ◽  
Probability Of Error

scholarly journals Compositional methods for information-hiding

2014 ◽  
Vol 26 (6) ◽  
pp. 908-932 ◽  
Author(s):  
KONSTANTINOS CHATZIKOKOLAKIS ◽  
CATUSCIA PALAMIDESSI ◽  
CHRISTELLE BRAUN
Keyword(s):  
Information Hiding ◽  
Process Calculus ◽  
Modular Construction ◽  
Probability Of Error ◽  
Secret Information ◽  
Degree Of Protection ◽  
Probabilistic Process

Systems concerned with information hiding often use randomization to obfuscate the link between the observables and the information to be protected. The degree of protection provided by a system can be expressed in terms of the probability of error associated with the inference of the secret information. We consider a probabilistic process calculus to specify such systems, and we study how the operators affect the probability of error. In particular, we characterize constructs that have the property of not decreasing the degree of protection, and that can therefore be considered safe in the modular construction of these systems. As a case study, we apply these techniques to the dining cryptographers, and we derive a generalization of Chaum's strong anonymity result.

Structured Data Entry for Reliable Acquisition of Pharmacokinetic Data

1996 ◽  
Vol 35 (03) ◽  
pp. 261-264 ◽  
Author(s):  
T. Schromm ◽  
T. Frankewitsch ◽  
M. Giehl ◽  
F. Keller ◽  
D. Zellner
Keyword(s):  
Text Processing ◽  
Data Entry ◽  
Processing System ◽  
Database System ◽  
Structured Data ◽  
Pharmacokinetic Parameters ◽  
Pharmacokinetic Data ◽  
Probability Of Error ◽  
Error Frequency ◽  
Estimated Error

Abstract:A pharmacokinetic database was constructed that is as free of errors as possible. Pharmacokinetic parameters were derived from the literature using a text-processing system and a database system. A random data sample from each system was compared with the original literature. The estimated error frequencies using statistical methods differed significantly between the two systems. The estimated error frequency in the text-processing system was 7.2%, that in the database system 2.7%. Compared with the original values in the literature, the estimated probability of error for identical pharmacokinetic parameters recorded in both systems is 2.4% and is not significantly different from the error frequency in the database. Parallel data entry with a text-processing system and a database system is, therefore, not significantly better than structured data entry for reducing the error frequency.

PROBABILITY OF BPSK SIGNAL RECEPTION ERROR IN PRESENCE OF SIMILAR HINDRANCE

2019 ◽  
pp. 55-59
Author(s):  
V. V. Zvonarev ◽  
I. A. Karabelnikov ◽  
A. S. Popov
Keyword(s):  
Initial Phase ◽  
Information Transfer ◽  
Radio Channel ◽  
Mutual Coherence ◽  
Coherent Noise ◽  
Probability Of Error ◽  
Discrete Signals ◽  
Average Probability ◽  
Correlation Receiver ◽  
Computer Type

The paper considers the problem of calculation of average probability of error of optimum symbol‑by‑symbol coherent reception of binary opposite phase‑shift keyed signals (BPSK) in the presence of similar synchronous noise. The noise similar to signal of PSK‑2 (BPSK), synchronous on clock periods, matching on frequency, differing in sequence of information characters and, perhaps, on initial phase of the bearing fluctuation is considered, up to mutual coherence of signal and noise. Formulas for calculation of probability of error are derived and results of partial computer type of diagrams of tension are given in some points of the correlation receiver. Optimum reception of discrete signals is carried out by means of the correlation receiver or the coordinated filter configured on signal in lack of noise in the presence of only receiver noises. It is shown that availability of synchronous similar or harmonious coherent noise, aim on structure, leads to decrease in noise stability of radio channel of information transfer. Than the level of noise is higher, that the probability of error is more.

Spatial filtering of signals with spectrum overlapping

2019 ◽  
pp. 27-33
Author(s):  
M. E. Shevchenko ◽  
A. V. Gorovoy ◽  
S. N. Solovyov
Keyword(s):  
Antenna Arrays ◽  
A Priori ◽  
Spatial Filtering ◽  
Spatial Filter ◽  
Radio Sources ◽  
Probability Of Error ◽  
Shift Keying ◽  
A Priori Uncertainty

The paper considers the spatial filtering methods of signals with spectrum overlapping under conditions of a priori uncertainty of the directions of arrival from radio sources. The estimates of the directions of signals arrival obtained by ESPRIT or MUSIC are used in order to build a spatial filter. It is shown that when using ESPRIT, unlike MUSIC, an additional calculations of filter coefficients based on estimates of the directions of signals arrival are not required, and the quadrature components of the signals are formed simultaneously with estimates of the direction of their arrival. The probability of error performances of minimum shift keying signals which were divided by spatial filtering on the basis of ESPRIT and MUSIC using seven-element circular and angular antenna arrays are given.

Restoring the Order of Information Packets Based on Hash Sequence Analysis

2020 ◽  
Vol 24 (1) ◽  
pp. 175-188
Author(s):  
M. O. Tanygin
Keyword(s):  
Communication Channel ◽  
System Analysis ◽  
Open Communication ◽  
Probability Of Error ◽  
Original Sequence ◽  
Blockchain Technology ◽  
Service Information ◽  
Field Information ◽  
Additional Service ◽  
Acceptable Reliability

Purpose of research. Currently, various technologies and methods are used to control the integrity and authenticity of data transmitted through open communication channels. One of them is the technology for transmitting sequences of information packets connected to each other in chains using certain cryptographic algorithms. Similar approaches are used in the well-known blockchain technology and are focused on large volumes of transmitted and protected information and large sizes of additional service information fields. The purpose of this article is to study the characteristics of systems, transmission of small information packets in comparison with traditional size frames of TCP/IP stack, in which the broken packet sequence order is restored using the chain method, by analyzing hash sequences available in each of such packets.Methods. In this article, simulation modeling, system analysis method, method of systematization and ranking of the obtained results are used.Results. It is shown that increasing the size of the additional field with the hash of the previous message from 4 to 6 bits has a significant effect on reducing the probability of erroneous restore of the order of information packets. Further increasing the length of the hash field reduces the probability of error by only 2 to 5 % for each additional bit of the hash field for any length of the chain being restored. It is shown that the coefficient of the usage of the communication channel (the ratio of useful chain of packets to the volume of information transmitted through the communication channel) is maximum when the length of the hash field is 6 in the whole range of sizes of the field information part of the data packet.Conclusion. The paper shows that the chain method is applicable for restoring the original sequence of information packets transmitted from the source to the receiver in systems where the preservation of the sequence of packets is not guaranteed. The obtained values of the transmission system parameters allow us to ensure acceptable reliability of data transmission with a minimum amount of additional service information, and achieve information redundancy less than that in similar ones by 10-15.

Sign in / Sign up

Export Citation Format

Share Document