The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The popularity of mobile devices with positioning capability and Internet accessibility in recent years has caused a revolution in the Location Based Services (LBS) market. Unfortunately, without preserving the user's location privacy, LBS providers can collect and log the accurate locations of the service users. Many mechanisms have been developed to preserve the LBS user's location privacy. While...
In this paper, we discuss some conditions for LPI signals, and propose a system with multiple users requiring these LPI properties using the optimal families of polyphase sequences recently discovered by Park et. al. We discuss and prove the bound on the key space for candidates, and conclude that our system is more secure than those employing encrypted sequences using AES-128 against brute-force...
We have previously defined the discretized Markov transformations and the full-length sequences based on such transformations. In view of basic properties of the normalized cross- and auto-correlation functions for the de Bruijn sequences that can be regarded as the full-length sequences based on the discretized dyadic transformation, we obtain correlational properties of the full-length sequences...
In our previous work, pseudo random binary sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation,...
In this paper, we propose a (k, L, n)-threshold ramp secret sharing scheme (SSS) against substitution attacks. This scheme can be applied to a secret SL uniformly distributed over GF(pm)L, where p is a prime satisfying p ≥ L + 2. We extend Koga and Koyano's analysis based on mutual information of shares for (k, n)-threshold SSSs to (k,L,n) ramp SSSs. The proposed scheme can achieve the minimum sizes...
Various aspects of improving the efficiency of graphical tests used to explore the results of stochastic transformations are discussed in the article. A method to improve performance of stochastic data processing using hybrid computing technologies and comparative analysis of the original tests and the tests with the proposed improvements are presented. Potential areas for improvement of the graphical...
Pseudo random sequences play an important role in cryptography and network security system. This paper proposes a new approach for generation of pseudo random sequence over odd characteristic field. The sequence is generated by applying a primitive polynomial over odd characteristic field, trace function and möbius function. Then, some important properties of the newly generated sequence such as period,...
Practical generation of secret bits using wireless channel measurements between two terminals is presented in this paper. The model used for this implementation assumes imperfect reciprocity between the channel measurements made by the two terminals in the presence of a passive eavesdropper. The channel measurements (e.g., received signal strength values) are used to estimate the secret key rate in...
The channel estimation is one of the essential components to make the long distance transmission of continuous variable quantum key distribution (CV-QKD). In this paper we provide the Cramer-Rao lower bound (CRLB) of the channel estimator, which is the minimum variance that an estimator can achieve. We compare CRLB with the channel transmission parameter estimator proposed in [15] for long distance...
In this paper, we present EMaaS, for Event Management as a Service, a multi-tenant cloud service to outsource the management of monitoring events in the cloud. Furthermore, we provide a secure multi-party computation (SMC) protocol for complex monitoring event processing. The protocol is integrated to EMaaS and uses some properties of encryption schemes. Finally, we evaluate the protocol security,...
The growth of the Internet has paved the way for easy access to information, and has contributed to the rapid development of multimedia based applications. This has made security issues very crucial and challenging. Various types of media carry information like image, audio and video and protecting these from unauthorized access is an important area of active research. This paper proposes a methodology...
Security issues are important concerns of image hashing. A type of image hashing needs to randomly divide a given image into several parts, usually rectangles. However, the security problem arises due to the rectangular shapes. So, we propose a new method which enhances the randomness by dividing the image into zigzag blocks with random walk. Security analyses are provided, and experiments show our...
Correlation Electromagnetic analysis (CEMA) has been effective in revealing the cryptographic key on cryptosystems. Random delay insertion (RDI) causes misalignments to prevent the action of these attacks in the time domain to avoid information leakage. In this paper, we first use the newly proposed time-frequency transformation Hirschman Optimal Transform (HOT) to transform the signal from the time...
Electromagnetic attacks are non-invasive attacks and pose serious threats to the security of cryptographic devices. However, its environment is complex and the noise on electromagnetic traces is often large. Thus, traditional differential electromagnetic analysis (DEMA) and correlation electromagnetic analysis (CEMA) require a lot of electromagnetic traces to recover the key used in the cryptographic...
Design of strong symmetric cipher systems requires that the underlying cryptographic Boolean function meet specific security requirements. Some of the required security criteria can be measured with the help of the Autocorrelation function as a tool, while other criteria can be measured using the Walsh transform as a tool. The connection between the Walsh transform and the Autocorrelation function...
Several authors have proposed the use of CAs and ELCAs for CDMA key generation, yet a detailed analysis of the cycles produced and of their usability in CDMA has not been performed. We report on the cross-correlation of same-length cycles generated by uniform and heterogeneous ELCAs and suggest ways of combining cycles for higher levels of independence of the keys.
This paper introduces a good technique for the utilization of cancelable features for speaker identification. This technique depends on the use of encrypted features extracted from speech signals for identification. The encrypted features are obtained through convolution with random kernels. The proposed speaker identification system using cancelable features has been evaluated under the effect of...
Let p be an odd prime number as the characteristic of finite field, this paper introduces a pseudo random binary sequence generated by a primitive polynomial of degree 2 over Fp, trace function, and Legendre symbol. Then, its period and autocorrelation are introduced with a small example.
In this article we exploit memristor-based chaotic circuits for pseudo-random generators. In particular, the simplest memristor-based chaotic circuit is considered. The circuit consists of only three series elements: inductor, capacitor and memristor. The statistical properties of the generated pseudo-random sequences have been verified by means of the NIST test. The results show that the developed...
There are many heuristic search algorithms for finding optimal Boolean functions with good cryptographic characteristics. In this paper we deploy simulated annealing (motivated by the cooling processes of molten metals) for finding an optimizing Boolean function which is cryptographically relevant and then find all the characteristics. Here, the nonlinearity of optimizing Balanced boolean function...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.