The Experts below are selected from a list of 8676 Experts worldwide ranked by ideXlab platform
Keunsung Bae - One of the best experts on this subject based on the ideXlab platform.
-
Estimation of Quantization Step Size Against Amplitude Modification Attack in Scalar Quantization-Based Audio Watermarking
2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006Co-Authors: Siho Kim, Keunsung BaeAbstract:Scalar quantization-based watermarking schemes are very vulnerable to amplitude Modification Attack. To overcome this problem, we propose a novel and robust algorithm that estimates the modified quantization step size by searching QE (quantization error) function. For efficient searching of QE curve, we analyze the peak curve of QE analytically and derive the equations to determine an appropriate search interval. The search interval can be determined from the mean and variance of an audio signal regardless of its probability density function shape. The experimental results demonstrate that the proposed algorithm provides both exact estimation of the modified quantization step size and good watermark detection performance under AWGN Attack
-
Analysis of optimal search interval for estimation of modified quantization step size in quantization-based audio watermark detection
Lecture Notes in Computer Science, 2006Co-Authors: Siho Kim, Keunsung BaeAbstract:The quantization-based watermarking schemes such as QIM or SCS are known to be very vulnerable to the amplitude Modification Attack. The amplitude Modification Attack results in the change of quantization step size so the estimation of a modified quantization step size is required before watermark detection. In this paper, we analyze the quantization error function of the audio signal having any shape of probability density function, and analytically determine the search interval that minimizes the quantization error considering both detection performance and computational complexity. It is shown that the appropriate search interval can be determined from the frame-based mean and variance of the input signal without regard to its shape of probability density function. Experimental results for real audio data verify that the derived search interval provides the accurate estimation of the modified quantization step size under amplitude Modification Attack.
-
analysis of optimal search ing interval for estimation of amplitude Modifications in quantization based audio watermark detection
Information Sciences Signal Processing and their Applications, 2005Co-Authors: Siho Kim, Keunsung BaeAbstract:Quantization-based watermarking schemes such as SCS and QIM are known to be very vulnerable to the amplitude Modification Attack. Thus accurate estimation of the amplitude Modification, i.e., estimation of a modified quantization step size is required before watermark detection. In this paper, we propose a robust algorithm to estimate the modified quantization step size with an optimal search interval. The optimal search interval that considers both detection performance and computational complexity is derived analytically. Experimental results for real audio data show that the derived optimal search interval provides the accurate estimation of the modified quantization step size under amplitude Modification Attack.
Naveen Chilamkurti - One of the best experts on this subject based on the ideXlab platform.
-
a secure temporal credential based mutual authentication and key agreement scheme with pseudo identity for wireless sensor networks
Information Sciences, 2015Co-Authors: Debiao He, Neeraj Kumar, Naveen ChilamkurtiAbstract:With an advancement of wireless communication technology, wireless sensor network (WSN) has emerged as one of the most powerful technologies which can be used in various applications, such as military surveillance, environment monitoring, industrial control, and medical monitoring. WSNs are vulnerable to large collection of Attacks than traditional networks because they transmit data using a wireless channel and are deployed in unattended environments. So, in this environment, how to ensure secure communications between different communication parties becomes a challenging issue with respect to the constraints of energy consumption, and large overhead generated during various operations performed. In this direction, the mutual authentication and key agreement (MAAKA) scheme attracts much attention in recent years. In literature, MAAKA schemes were presented in last several years. However, most of these schemes cannot satisfy security requirements in WSNs. Recently, Xue et al. proposed a temporal-credential-based MAAKA scheme for WSNs and proved that it could withstand various types of Attacks. However, this paper points out that Xue et al.'s MAAKA scheme is vulnerable to the off-line password guessing Attack, the user impersonation Attack, the sensor node impersonation Attack and the Modification Attack. Moreover, this paper also points out that Xue et al.'s MAAKA scheme cannot provide user anonymity. To overcome weaknesses in Xue et al.'s MAAKA scheme, this paper proposes a new temporal-credential-based MAAKA scheme for WSNs. Security analysis shows the proposed MAAKA scheme could overcome the weaknesses in Xue et al.'s MAAKA scheme. Performance analysis shows the proposed MAAKA scheme has better performance than the existing benchmarked schemes in literature. Therefore, the proposed MAAKA scheme is more suitable for providing security for various applications in WSNs.
-
a secure temporal credential based mutual authentication and key agreement scheme for wireless sensor networks
International Symposium on Wireless Pervasive Computing, 2013Co-Authors: Debiao He, Neeraj Kumar, Naveen ChilamkurtiAbstract:With the development of wireless communication technology and sensor technology, the wireless sensor network (WSN) has been widely used in various applications, such as military surveillance, environment monitoring industry control, medical monitoring, and so on. In most of the cases, WSNs are deployed in unattended environment. So, these are more vulnerable to various Attacks than traditional networks. To protect communications in WSNs, mutual authentication and key agreement schemes for WSNs have been studied widely. Recently, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs and claimed their scheme could withstand various Attacks. However, in this paper, we will point out that their scheme is vulnerable to the off-line password guessing Attack, the user impersonation Attack, the sensor node impersonation Attack and the Modification Attack. To overcome weaknesses in Xue et al.'s scheme, we also propose a new temporal-credential-based mutual authentication and key agreement scheme for WSNs. Security analysis shows our scheme could overcome weaknesses in Xue et al.'s scheme. Performance analysis shows our scheme also has better performance. Therefore, our scheme is more suitable for providing secure communication in WSNs.
Siho Kim - One of the best experts on this subject based on the ideXlab platform.
-
Estimation of Quantization Step Size Against Amplitude Modification Attack in Scalar Quantization-Based Audio Watermarking
2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, 2006Co-Authors: Siho Kim, Keunsung BaeAbstract:Scalar quantization-based watermarking schemes are very vulnerable to amplitude Modification Attack. To overcome this problem, we propose a novel and robust algorithm that estimates the modified quantization step size by searching QE (quantization error) function. For efficient searching of QE curve, we analyze the peak curve of QE analytically and derive the equations to determine an appropriate search interval. The search interval can be determined from the mean and variance of an audio signal regardless of its probability density function shape. The experimental results demonstrate that the proposed algorithm provides both exact estimation of the modified quantization step size and good watermark detection performance under AWGN Attack
-
Analysis of optimal search interval for estimation of modified quantization step size in quantization-based audio watermark detection
Lecture Notes in Computer Science, 2006Co-Authors: Siho Kim, Keunsung BaeAbstract:The quantization-based watermarking schemes such as QIM or SCS are known to be very vulnerable to the amplitude Modification Attack. The amplitude Modification Attack results in the change of quantization step size so the estimation of a modified quantization step size is required before watermark detection. In this paper, we analyze the quantization error function of the audio signal having any shape of probability density function, and analytically determine the search interval that minimizes the quantization error considering both detection performance and computational complexity. It is shown that the appropriate search interval can be determined from the frame-based mean and variance of the input signal without regard to its shape of probability density function. Experimental results for real audio data verify that the derived search interval provides the accurate estimation of the modified quantization step size under amplitude Modification Attack.
-
analysis of optimal search ing interval for estimation of amplitude Modifications in quantization based audio watermark detection
Information Sciences Signal Processing and their Applications, 2005Co-Authors: Siho Kim, Keunsung BaeAbstract:Quantization-based watermarking schemes such as SCS and QIM are known to be very vulnerable to the amplitude Modification Attack. Thus accurate estimation of the amplitude Modification, i.e., estimation of a modified quantization step size is required before watermark detection. In this paper, we propose a robust algorithm to estimate the modified quantization step size with an optimal search interval. The optimal search interval that considers both detection performance and computational complexity is derived analytically. Experimental results for real audio data show that the derived optimal search interval provides the accurate estimation of the modified quantization step size under amplitude Modification Attack.
Wenjing Lou - One of the best experts on this subject based on the ideXlab platform.
-
1Towards Secure and Dependable Storage Services in Cloud Computing
2016Co-Authors: Cong Wang, Wenjing Lou, Ning Cao, Stude Membe, Qia WangAbstract:Abstract—Cloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, such a service is also relinquishing users’ physical possession of their outsourced data, which inevitably poses new security risks towards the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose in this paper a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost. The auditing result not only ensures strong cloud storage correctness guarantee, but also simultaneously achieves fast data error localization, i.e., the identification of misbehaving server. Considering the cloud data are dynamic in nature, the proposed design further supports secure and efficient dynamic operations on outsourced data, including block Modification, deletion, and append. Analysis shows the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data Modification Attack, and even server colluding Attacks. Index Terms—Data integrity, dependable distributed storage, error localization, data dynamics, Cloud Computing F
-
toward secure and dependable storage services in cloud computing
IEEE Transactions on Services Computing, 2012Co-Authors: Cong Wang, Q Wang, Kui Ren, Ning Cao, Wenjing LouAbstract:Cloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, such a service is also relinquishing users' physical possession of their outsourced data, which inevitably poses new security risks toward the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose in this paper a flexible distributed storage integrity auditing mechanism, utilizing the homomorphic token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost. The auditing result not only ensures strong cloud storage correctness guarantee, but also simultaneously achieves fast data error localization, i.e., the identification of misbehaving server. Considering the cloud data are dynamic in nature, the proposed design further supports secure and efficient dynamic operations on outsourced data, including block Modification, deletion, and append. Analysis shows the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data Modification Attack, and even server colluding Attacks.
-
Ensuring Data Storage Security in Cloud Computing
Iwqos: 2009 Ieee 17th International Workshop on Quality of Service, 2009Co-Authors: Cong Wang, W.-j. Lou, Kui Ren, Q Wang, Wenjing LouAbstract:Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, Cloud Computing moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this article, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in the cloud, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data Modification Attack, and even server colluding Attacks.
Debiao He - One of the best experts on this subject based on the ideXlab platform.
-
a secure temporal credential based mutual authentication and key agreement scheme with pseudo identity for wireless sensor networks
Information Sciences, 2015Co-Authors: Debiao He, Neeraj Kumar, Naveen ChilamkurtiAbstract:With an advancement of wireless communication technology, wireless sensor network (WSN) has emerged as one of the most powerful technologies which can be used in various applications, such as military surveillance, environment monitoring, industrial control, and medical monitoring. WSNs are vulnerable to large collection of Attacks than traditional networks because they transmit data using a wireless channel and are deployed in unattended environments. So, in this environment, how to ensure secure communications between different communication parties becomes a challenging issue with respect to the constraints of energy consumption, and large overhead generated during various operations performed. In this direction, the mutual authentication and key agreement (MAAKA) scheme attracts much attention in recent years. In literature, MAAKA schemes were presented in last several years. However, most of these schemes cannot satisfy security requirements in WSNs. Recently, Xue et al. proposed a temporal-credential-based MAAKA scheme for WSNs and proved that it could withstand various types of Attacks. However, this paper points out that Xue et al.'s MAAKA scheme is vulnerable to the off-line password guessing Attack, the user impersonation Attack, the sensor node impersonation Attack and the Modification Attack. Moreover, this paper also points out that Xue et al.'s MAAKA scheme cannot provide user anonymity. To overcome weaknesses in Xue et al.'s MAAKA scheme, this paper proposes a new temporal-credential-based MAAKA scheme for WSNs. Security analysis shows the proposed MAAKA scheme could overcome the weaknesses in Xue et al.'s MAAKA scheme. Performance analysis shows the proposed MAAKA scheme has better performance than the existing benchmarked schemes in literature. Therefore, the proposed MAAKA scheme is more suitable for providing security for various applications in WSNs.
-
a secure temporal credential based mutual authentication and key agreement scheme for wireless sensor networks
International Symposium on Wireless Pervasive Computing, 2013Co-Authors: Debiao He, Neeraj Kumar, Naveen ChilamkurtiAbstract:With the development of wireless communication technology and sensor technology, the wireless sensor network (WSN) has been widely used in various applications, such as military surveillance, environment monitoring industry control, medical monitoring, and so on. In most of the cases, WSNs are deployed in unattended environment. So, these are more vulnerable to various Attacks than traditional networks. To protect communications in WSNs, mutual authentication and key agreement schemes for WSNs have been studied widely. Recently, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs and claimed their scheme could withstand various Attacks. However, in this paper, we will point out that their scheme is vulnerable to the off-line password guessing Attack, the user impersonation Attack, the sensor node impersonation Attack and the Modification Attack. To overcome weaknesses in Xue et al.'s scheme, we also propose a new temporal-credential-based mutual authentication and key agreement scheme for WSNs. Security analysis shows our scheme could overcome weaknesses in Xue et al.'s scheme. Performance analysis shows our scheme also has better performance. Therefore, our scheme is more suitable for providing secure communication in WSNs.
