2,408 research outputs found

    Confidential Data Transmission Using Subcarrier Randomization with RSA Algorithm for Synchronization on MIMO-OFDM System

    Get PDF
    In wireless communication, the transmitted information data is often intercepted by eavesdropper through fading channels. Since the signal is transmitted by the transmitter through a wireless channel, it is not only the authorized receiver but also the attacker or the eavesdropper can easily capture and store the information signal. This research examines the security methods in wireless communication, where the security method used is subcarrier randomization. In the receiver, the subcarrier position must be restored to its original position. To restore the subcarrier position to its original position there needs to be a synchronization between transmitter and receiver. We use RSA algorithm as synchronization between transmitter and receiver. Subcarrier randomization security method is implemented on Multiple Input Multiple Output - Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system. We perform QoS measurements including delay, throughput and packet loss on MIMO-OFDM systems using security and MIMO-OFDM systems without security. From the results obtained, we can prove that the proposed security method does not degrade the performance of the MIMO-OFDM system. MIMO-OFDM system with security can result in smaller packet loss than the MIMO-OFDM system without security. MIMO-OFDM system with security has the average packet loss 0.145%

    New Cryptographic Algorithms for Enhancing Security of Voice Data

    Get PDF
    A real-time application Voice over Internet Protocol (VoIP) is the technology that enables voice packets transmission over internet protocol (IP). Security is of concern whenever open networks are to be used. In general, the real-time applications suffer from packet latency and loss due to the nature of IP network. Cryptographic systems may be used to achieve VoIP security, but their impact on the Quality of Services (QoS) should be minimized. Most of the known encryption algorithms are computationally expensive resulting in a significant amount of time added to packet delay. VoIP is usually used by public users resulting in a key exchange problem and a trusted intermediate authority normally takes this responsibility. In this research, VoIP security was enhanced via a proposed cryptographic system. The proposed solution consists of a simple, but strong encryption/decryption algorithm as well as an embedded method to exchange the keys between the users. In this research, a new keys is generated in a random fashion and then used to encrypt each new voice packet to strengthen the security level. Key exchange is carried out by inserting the key with the ciphered voice packet that depends on the table of the key positions at the sender and receiver sides, and the target receiver is the only one who is able to extract the key. The encryption process in this research is divided into three main stages: key generation, encryption process, and key insertion process. The decryption process on the other hand is divided into two main stages: key extraction process, and decryption process. The proposed solution was implemented and tested and the results showed that the required time for the security processes is minimized compared to some known algorithms such as AES_Rijndael algorithm. Furthermore, the analysis has proved that the security level has a direct relationship to the key length and the voice packet size in that large packet size requires more processing time. Finally, the implementation result in this research shows the average time needed to encrypt and decrypt a voice packet size using a proposed algorithm with the long key of 1024-bits is much smaller than AES_Rijndael algorithm with a short key length of 128-bits

    Multimedia

    Get PDF
    The nowadays ubiquitous and effortless digital data capture and processing capabilities offered by the majority of devices, lead to an unprecedented penetration of multimedia content in our everyday life. To make the most of this phenomenon, the rapidly increasing volume and usage of digitised content requires constant re-evaluation and adaptation of multimedia methodologies, in order to meet the relentless change of requirements from both the user and system perspectives. Advances in Multimedia provides readers with an overview of the ever-growing field of multimedia by bringing together various research studies and surveys from different subfields that point out such important aspects. Some of the main topics that this book deals with include: multimedia management in peer-to-peer structures & wireless networks, security characteristics in multimedia, semantic gap bridging for multimedia content and novel multimedia applications

    A Visual Cryptography Scheme for User Authentication

    Get PDF
    A new scheme for user authentication is proposed using visual cryptography and invisible digital watermarking. Visual cryptography which allows visual information to be encrypted in such a way that decryption becomes the job of the person to decrypt via a sight reading. In the proposed work, user signature will be embedded within the cover media. It may be text, images, audio, video etc. Here we used cover image for embedding data by using a single bit LSB watermark insertion algorithm. After that the image will be split into two shares. Shares will be later encrypted by using a Column Shift Permutation algorithm. Receiver will decrypt the shares using Column Shift Permutation algorithm. Shares are collected and stamp together by receiver to get cover image. Then signature will be de-embedded from the cover image. Data will be transfer using communication media. Image will be passed in more secure manner without any distortion. This method is very efficient and effective .The method can be implemented with minimum processing. This application used in customer identification in bank and in online voting

    POPE: Partial Order Preserving Encoding

    Get PDF
    Recently there has been much interest in performing search queries over encrypted data to enable functionality while protecting sensitive data. One particularly efficient mechanism for executing such queries is order-preserving encryption/encoding (OPE) which results in ciphertexts that preserve the relative order of the underlying plaintexts thus allowing range and comparison queries to be performed directly on ciphertexts. In this paper, we propose an alternative approach to range queries over encrypted data that is optimized to support insert-heavy workloads as are common in "big data" applications while still maintaining search functionality and achieving stronger security. Specifically, we propose a new primitive called partial order preserving encoding (POPE) that achieves ideal OPE security with frequency hiding and also leaves a sizable fraction of the data pairwise incomparable. Using only O(1) persistent and O(nϵ)O(n^\epsilon) non-persistent client storage for 0<ϵ<10<\epsilon<1, our POPE scheme provides extremely fast batch insertion consisting of a single round, and efficient search with O(1) amortized cost for up to O(n1−ϵ)O(n^{1-\epsilon}) search queries. This improved security and performance makes our scheme better suited for today's insert-heavy databases.Comment: Appears in ACM CCS 2016 Proceeding

    Protection of Records and Data Authentication based on Secret Shares and Watermarking

    Get PDF
    The rapid growth in communication technology facilitates the health industry in many aspects from transmission of sensor’s data to real-time diagnosis using cloud-based frameworks. However, the secure transmission of data and its authenticity become a challenging task, especially, for health-related applications. The medical information must be accessible to only the relevant healthcare staff to avoid any unfortunate circumstances for the patient as well as for the healthcare providers. Therefore, a method to protect the identity of a patient and authentication of transmitted data is proposed in this study. The proposed method provides dual protection. First, it encrypts the identity using Shamir’s secret sharing scheme without the increase in dimension of the original identity. Second, the identity is watermarked using zero-watermarking to avoid any distortion into the host signal. The experimental results show that the proposed method encrypts, embeds and extracts identities reliably. Moreover, in case of malicious attack, the method distorts the embedded identity which provides a clear indication of fabrication. An automatic disorder detection system using Mel-frequency cepstral coefficients and Gaussian mixture model is also implemented which concludes that malicious attacks greatly impact on the accurate diagnosis of disorders
    • …
    corecore