2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012
ABSTRACT The use of cooperation to increase the information-theoretic secrecy in a decentralized ... more ABSTRACT The use of cooperation to increase the information-theoretic secrecy in a decentralized ad-hoc wireless network is investigated. In particular, four cases of cooperative relaying are analyzed and compared. These cases include the no-cooperation case, the case with single-hop cooperation with multiple relays, the case with single-hop cooperation with the strongest relay, and finally the case of multi-hop cooperation with the strongest relay. From the results, it is seen that cooperation increases the probability of a positive secrecy rate between two nodes in a network with friendly (cooperative) nodes and eavesdropping nodes. The improved information-theoretic secrecy increases the probability that two nodes can share a secret message with perfect secrecy using a multi-hop route of trusted nodes. Cooperative jamming is also studied, and it is observed that very often it is more beneficial to use friendly nodes for cooperative jamming than cooperative relaying. Finally, a combination of cooperative relaying and jamming is considered.
Cloud Computing: Definition, Model, Architecture. The rationale. Main obstacles/Security issues. ... more Cloud Computing: Definition, Model, Architecture. The rationale. Main obstacles/Security issues. Human Factor. Solutions.
This manuscript presents a novel approach based on blind component processing to estimate the par... more This manuscript presents a novel approach based on blind component processing to estimate the parameters of the jump-diffusion model for stock pricing processes used in finance theory. While emerging markets suffer by huge frequent changes and well developed markets bubble burst effect, the resultant heavy tails violate the assumption of normality of stock data for both types of market. This research work, by assuming a linear time in-variance behavior for stock options, removes the heavy tails at blind component level by deploying blind component processing. The stock with heavy tails removed in components matches better with available stock pricing models because of their higher normality. Numerical evaluations approve the validation of the proposed method in bringing higher normality to stock pricing data.
ABSTRACT Transmission of confidential messages over wireless networks between a transmitter and a... more ABSTRACT Transmission of confidential messages over wireless networks between a transmitter and a receiver in the presence of illegitimate receivers called eavesdroppers is an active area of research. Cooperation by jamming can improve informationtheoretic secrecy in wireless networks. However, randomly chosen jammers can have a negative impact on the secrecy capacity. This raises the question about the configuration of the jammers which minimizes the negative impact on the secrecy capacity. For this purpose, we consider a network configuration with two legitimate communicating parties, one eavesdropper and randomly positioned jammers. The jammers follow a spatial Poisson process. Only the jammer closest to the eavesdropper is active. For a simplified model of this network configuration, we derive analytical results on the size of the secrecy region.
Abstract The use of multiple network configurations for cooperative jamming with the aim to incre... more Abstract The use of multiple network configurations for cooperative jamming with the aim to increase the region with information-theoretic secrecy is analysed. The case with a single eavesdropper at an unknown location is investigated. A pre-master key message is broken into multiple data blocks, which are then sent for different network configurations. Provided that the secrecy capacity for a given eavesdropper's position is positive for at least one configuration, the corresponding data block can be securely delivered to the receiver, and ...
Abstract OpenCL platform provides unified development environment for various multicore processor... more Abstract OpenCL platform provides unified development environment for various multicore processors. In this paper, we evaluate the OpenCL framework for application in pattern recognition. We have selected the most common algorithm for Artificial Neural Networks (ANN) training—the backpropagation algorithm for parallelization with OpenCL because of its high demand for processing resources. We will show a SIMD version of the algorithm suitable for OpenCL implementation. Our OpenCL implementation showed 25.8 speedup ...
We propose a novel approach for constructing synchronized chaotic arrays and demonstrate its appl... more We propose a novel approach for constructing synchronized chaotic arrays and demonstrate its application for encoding messages. When applied to the problem of communicating information signals, in this case, the transmitted signal is a hyper-chaotic. Therefore, this approach provides an efficient encoding of the information and may be useful in private communication applications.
AbstractMD5 hash function was designed as an improvement and strengthened successor of the MD4 h... more AbstractMD5 hash function was designed as an improvement and strengthened successor of the MD4 hash function by Ron Rivest [4]. It quickly gained popularity, but not long after its publication it was subjected to a number of attacks which discovered many weaknesses [1][2][3]. ...
Abstract. Software industry is still based on manufactory production, and most of the programming... more Abstract. Software industry is still based on manufactory production, and most of the programming code is still hand-crafted. Considerable enhancements in the technologies, methods and techniques in software development occurred in the past 30 years, and reuse and productivity have increased in the past 20 years due to the introduction of the object-oriented programming and serviceoriented architecture. Still, we are very far away from the ultimate goal of industrialization in software production, something which has been ...
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: FUNDAMENTAL THEORY AND APPLICATIONS, Jun 1, 1997
Abstract—The concept of time-discontinuous coupling of two identical chaotic systems called spora... more Abstract—The concept of time-discontinuous coupling of two identical chaotic systems called sporadic coupling is addressed. The conditions for the occurrence of synchronization between two sporadically coupled chaotic systems are given. Amplitude quantization of the driving signal in addition to the sporadic coupling allows digital exchange of digital information signals between the sporadically coupled chaotic systems. Index Terms—Chaos, chaos synchronization, digital coding.
Abstract: A method for generating a random number sequence whose randomness properties are determ... more Abstract: A method for generating a random number sequence whose randomness properties are determined a priori, comprises the steps of defining a parametric map; calculating, in function of parameters of the map, the entropy and the Lyapunov exponent of random number sequences obtainable using the parametric map; identifying at least a set of values of parameters for which the entropy and the Lyapunov exponent are positive numbers the map has no attracting point; assigning a pre-established value as a first ...
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012
ABSTRACT The use of cooperation to increase the information-theoretic secrecy in a decentralized ... more ABSTRACT The use of cooperation to increase the information-theoretic secrecy in a decentralized ad-hoc wireless network is investigated. In particular, four cases of cooperative relaying are analyzed and compared. These cases include the no-cooperation case, the case with single-hop cooperation with multiple relays, the case with single-hop cooperation with the strongest relay, and finally the case of multi-hop cooperation with the strongest relay. From the results, it is seen that cooperation increases the probability of a positive secrecy rate between two nodes in a network with friendly (cooperative) nodes and eavesdropping nodes. The improved information-theoretic secrecy increases the probability that two nodes can share a secret message with perfect secrecy using a multi-hop route of trusted nodes. Cooperative jamming is also studied, and it is observed that very often it is more beneficial to use friendly nodes for cooperative jamming than cooperative relaying. Finally, a combination of cooperative relaying and jamming is considered.
Cloud Computing: Definition, Model, Architecture. The rationale. Main obstacles/Security issues. ... more Cloud Computing: Definition, Model, Architecture. The rationale. Main obstacles/Security issues. Human Factor. Solutions.
This manuscript presents a novel approach based on blind component processing to estimate the par... more This manuscript presents a novel approach based on blind component processing to estimate the parameters of the jump-diffusion model for stock pricing processes used in finance theory. While emerging markets suffer by huge frequent changes and well developed markets bubble burst effect, the resultant heavy tails violate the assumption of normality of stock data for both types of market. This research work, by assuming a linear time in-variance behavior for stock options, removes the heavy tails at blind component level by deploying blind component processing. The stock with heavy tails removed in components matches better with available stock pricing models because of their higher normality. Numerical evaluations approve the validation of the proposed method in bringing higher normality to stock pricing data.
ABSTRACT Transmission of confidential messages over wireless networks between a transmitter and a... more ABSTRACT Transmission of confidential messages over wireless networks between a transmitter and a receiver in the presence of illegitimate receivers called eavesdroppers is an active area of research. Cooperation by jamming can improve informationtheoretic secrecy in wireless networks. However, randomly chosen jammers can have a negative impact on the secrecy capacity. This raises the question about the configuration of the jammers which minimizes the negative impact on the secrecy capacity. For this purpose, we consider a network configuration with two legitimate communicating parties, one eavesdropper and randomly positioned jammers. The jammers follow a spatial Poisson process. Only the jammer closest to the eavesdropper is active. For a simplified model of this network configuration, we derive analytical results on the size of the secrecy region.
Abstract The use of multiple network configurations for cooperative jamming with the aim to incre... more Abstract The use of multiple network configurations for cooperative jamming with the aim to increase the region with information-theoretic secrecy is analysed. The case with a single eavesdropper at an unknown location is investigated. A pre-master key message is broken into multiple data blocks, which are then sent for different network configurations. Provided that the secrecy capacity for a given eavesdropper's position is positive for at least one configuration, the corresponding data block can be securely delivered to the receiver, and ...
Abstract OpenCL platform provides unified development environment for various multicore processor... more Abstract OpenCL platform provides unified development environment for various multicore processors. In this paper, we evaluate the OpenCL framework for application in pattern recognition. We have selected the most common algorithm for Artificial Neural Networks (ANN) training—the backpropagation algorithm for parallelization with OpenCL because of its high demand for processing resources. We will show a SIMD version of the algorithm suitable for OpenCL implementation. Our OpenCL implementation showed 25.8 speedup ...
We propose a novel approach for constructing synchronized chaotic arrays and demonstrate its appl... more We propose a novel approach for constructing synchronized chaotic arrays and demonstrate its application for encoding messages. When applied to the problem of communicating information signals, in this case, the transmitted signal is a hyper-chaotic. Therefore, this approach provides an efficient encoding of the information and may be useful in private communication applications.
AbstractMD5 hash function was designed as an improvement and strengthened successor of the MD4 h... more AbstractMD5 hash function was designed as an improvement and strengthened successor of the MD4 hash function by Ron Rivest [4]. It quickly gained popularity, but not long after its publication it was subjected to a number of attacks which discovered many weaknesses [1][2][3]. ...
Abstract. Software industry is still based on manufactory production, and most of the programming... more Abstract. Software industry is still based on manufactory production, and most of the programming code is still hand-crafted. Considerable enhancements in the technologies, methods and techniques in software development occurred in the past 30 years, and reuse and productivity have increased in the past 20 years due to the introduction of the object-oriented programming and serviceoriented architecture. Still, we are very far away from the ultimate goal of industrialization in software production, something which has been ...
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: FUNDAMENTAL THEORY AND APPLICATIONS, Jun 1, 1997
Abstract—The concept of time-discontinuous coupling of two identical chaotic systems called spora... more Abstract—The concept of time-discontinuous coupling of two identical chaotic systems called sporadic coupling is addressed. The conditions for the occurrence of synchronization between two sporadically coupled chaotic systems are given. Amplitude quantization of the driving signal in addition to the sporadic coupling allows digital exchange of digital information signals between the sporadically coupled chaotic systems. Index Terms—Chaos, chaos synchronization, digital coding.
Abstract: A method for generating a random number sequence whose randomness properties are determ... more Abstract: A method for generating a random number sequence whose randomness properties are determined a priori, comprises the steps of defining a parametric map; calculating, in function of parameters of the map, the entropy and the Lyapunov exponent of random number sequences obtainable using the parametric map; identifying at least a set of values of parameters for which the entropy and the Lyapunov exponent are positive numbers the map has no attracting point; assigning a pre-established value as a first ...
In this paper we present a novel system for information transmission by means of chaos synchronis... more In this paper we present a novel system for information transmission by means of chaos synchronisation. Unlike the existing systems for communication via chaotic synchronization, our system extracts the information at the receiver without error. We propose a new algorithm for secret-key cryptography, based on our system for chaos synchronization. Its quality is evaluated through numerous statistical tests that have not pointed out any weakness. To the best of our knowledge, the modern cryptoanalysis techniques do not ...
The use of multiple network configurations for
cooperative jamming with the aim to increase the ... more The use of multiple network configurations for
cooperative jamming with the aim to increase the region with
information-theoretic secrecy is analysed. The case with a single
eavesdropper at an unknown location is investigated. A premaster
key message is broken into multiple data blocks, which
are then sent for different network configurations. Provided
that the secrecy capacity for a given eavesdropper’s position is
positive for at least one configuration, the corresponding data
block can be securely delivered to the receiver, and thus the
eavesdropper can not discover the master key.
Uploads
Papers by Toni Stojanovski
cooperative jamming with the aim to increase the region with
information-theoretic secrecy is analysed. The case with a single
eavesdropper at an unknown location is investigated. A premaster
key message is broken into multiple data blocks, which
are then sent for different network configurations. Provided
that the secrecy capacity for a given eavesdropper’s position is
positive for at least one configuration, the corresponding data
block can be securely delivered to the receiver, and thus the
eavesdropper can not discover the master key.