Information Hiding and Multimedia Security Workshop最新文献

筛选
英文 中文
A simple tracing algorithm for binary fingerprinting code under averaging attack 平均攻击下二进制指纹码的简单跟踪算法
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482521
M. Kuribayashi
{"title":"A simple tracing algorithm for binary fingerprinting code under averaging attack","authors":"M. Kuribayashi","doi":"10.1145/2482513.2482521","DOIUrl":"https://doi.org/10.1145/2482513.2482521","url":null,"abstract":"When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133529716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On optimal detection for matrix multiplicative data hiding 矩阵乘法数据隐藏的最优检测
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482534
B. Moussakhani, M. A. Sedaghat, J. T. Flåm, T. Ramstad
{"title":"On optimal detection for matrix multiplicative data hiding","authors":"B. Moussakhani, M. A. Sedaghat, J. T. Flåm, T. Ramstad","doi":"10.1145/2482513.2482534","DOIUrl":"https://doi.org/10.1145/2482513.2482534","url":null,"abstract":"This paper analyzes a multiplicative data hiding scheme, where the watermark bits are embedded within frames of a Gaussian host signal by two different, but arbitrary, embedding matrices. A closed form expression for the bit error rate (BER) of the optimal detector is derived when the frame sizes tend to infinity. Furthermore, a structure is proposed for the optimal detector which divides the detection process into two main blocks: host signal estimation and decision making. The proposed structure preserves optimality, and allows for a great deal of flexibility: The estimator can be selected according to the a priori knowledge about host signal. For example, if the host signal is an Auto-Regressive (AR) process, we argue that a Kalman filter may serve as the estimator. Compared to a direct implementation of the Neyman-Pearson detector, this approach results in significantly reduced complexity while keeping optimal performance.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132797340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exposing digital audio forgeries in time domain by using singularity analysis with wavelets 利用小波奇异性分析在时域上揭露数字音频伪造
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482516
Jiaorong Chen, Shijun Xiang, Weiping Liu, Hongbin Huang
{"title":"Exposing digital audio forgeries in time domain by using singularity analysis with wavelets","authors":"Jiaorong Chen, Shijun Xiang, Weiping Liu, Hongbin Huang","doi":"10.1145/2482513.2482516","DOIUrl":"https://doi.org/10.1145/2482513.2482516","url":null,"abstract":"Exposing digital audio forgeries in time domain is a significant research issue in the audio forensics community. In this paper, we develop an audio forensics method to detect and locate audio forgeries in time domain (including deletion, insertion, substitution and splicing) by analyzing singularity points of audio signals after performing discrete wavelet packet decomposition. Firstly, we observe and point out that a forgery operation in time domain will often generate a singularity point because the correlation property of those samples close to the tampering position has been degraded. Furthermore, we investigate and find that the singularity point resulted from a tampering operation often stays alone while those inherent singularity points in the original signal usually staying in the form of group. Finally, we propose an approach to expose audio forgeries in time domain by introducing Mallat et al.'s wavelet singularity analysis method and making a difference between a forged point and the inherent singularity points. Extensive experimental results have shown that the proposed scheme can better identify whether a given speech file has been tampered (e.g., part of the content deleted or replaced) previously and further locate the forged positions in time domain.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130992892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
SIFT keypoint removal and injection for countering matching-based image forensics 用于对抗基于匹配的图像取证的SIFT关键点去除和注入
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482524
Irene Amerini, M. Barni, R. Caldelli, Andrea Costanzo
{"title":"SIFT keypoint removal and injection for countering matching-based image forensics","authors":"Irene Amerini, M. Barni, R. Caldelli, Andrea Costanzo","doi":"10.1145/2482513.2482524","DOIUrl":"https://doi.org/10.1145/2482513.2482524","url":null,"abstract":"Scale Invariant Feature Transform (SIFT) has been widely employed in several image application domains, including Image Forensics (e.g. detection of copy-move forgery or near duplicates). Until now, the research community has focused on studying the robustness of SIFT against legitimate image processing, but rarely concerned itself with the problem of SIFT security against malicious procedures. Recently, a number of methods allowing to remove SIFT keypoints from an original image have been devised. Although quite effective, such methods produce an attacked image with very few (or no) keypoints, thus leaving cues that can be easily exploited by a forensic analyst to reveal the occurred manipulation. In this paper, we explore the topic of reintroducing fake SIFT keypoints into a previously cleaned image in order to address the main weakness of the existing removal attacks. In particular, we evaluate the fitness of locally adaptive contrast enhancement methods to the task of injecting new keypoints. The results we obtained are encouraging: (i) it is possible to effectively introduce new keypoints whose descriptors do not match with those of the original image, thus concealing the removal forgery; (ii) the perceptual quality of the image following the removal and injection attacks is comparable to the one of the original image.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128066272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Digital image steganography using universal distortion 使用通用失真的数字图像隐写
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482514
Vojtech Holub, J. Fridrich
{"title":"Digital image steganography using universal distortion","authors":"Vojtech Holub, J. Fridrich","doi":"10.1145/2482513.2482514","DOIUrl":"https://doi.org/10.1145/2482513.2482514","url":null,"abstract":"Currently, the most secure practical steganographic schemes for empirical cover sources embed their payload while minimizing a distortion function designed to capture statistical detectability. Since there exists a general framework for this embedding paradigm with established payload-distortion bounds as well as near-optimal practical coding schemes, building an embedding scheme has been essentially reduced to the distortion design. This is not an easy task as relating distortion to statistical detectability is a hard and open problem. In this article, we propose an innovative idea to measure the embedding distortion in one fixed domain independently of the domain where the embedding changes (and coding) are carried out. The proposed universal distortion is additive and evaluates the cost of changing an image element (e.g., pixel or DCT coefficient) from directional residuals obtained using a Daubechies wavelet filter bank. The intuition is to limit the embedding changes only to those parts of the cover that are difficult to model in multiple directions while avoiding smooth regions and clean edges. The utility of the universal distortion is demonstrated by constructing steganographic schemes in the spatial, JPEG, and side-informed JPEG domains, and comparing their security to current state-of-the-art methods using classifiers trained with rich media models.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124556670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 292
Optimizing acoustic features for source cell-phone recognition using speech signals 优化声学特征的源手机识别使用语音信号
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482520
C. Hanilçi, F. Ertas
{"title":"Optimizing acoustic features for source cell-phone recognition using speech signals","authors":"C. Hanilçi, F. Ertas","doi":"10.1145/2482513.2482520","DOIUrl":"https://doi.org/10.1145/2482513.2482520","url":null,"abstract":"This paper presents comparison and optimization of acoustic features for source cell-phone recognition using recorded speech signals. Different acoustic feature extraction methods such as Mel-frequency, linear frequency and Bark frequency cepstral coefficients (MFCC, LFCC and BFCC) and linear prediction cepstral coefficients (LPCC) are considered. In addition to different feature sets, the effect of dynamic features, delta and double-delta coefficients (Δ and Δ2), and feature normalizations, cepstral mean normalization (CMN), cepstral variance normalization (CVN) and cepstral mean and variance normalization (CMVN) are also examined on the performance of source cell-phone recognition. The same support vector machine (SVM) classifier with fixed parameters and the same cell-phone dataset are used in the experiments in order to make a fair comparison of different features and feature normalization techniques.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134500803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Secure and efficient approximate nearest neighbors search 安全高效的近似近邻搜索
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482539
B. Mathon, T. Furon, L. Amsaleg, J. Bringer
{"title":"Secure and efficient approximate nearest neighbors search","authors":"B. Mathon, T. Furon, L. Amsaleg, J. Bringer","doi":"10.1145/2482513.2482539","DOIUrl":"https://doi.org/10.1145/2482513.2482539","url":null,"abstract":"This paper presents a moderately secure but very efficient approximate nearest neighbors search. After detailing the threats pertaining to the `honest but curious' model, our approach starts from a state-of-the-art algorithm in the domain of approximate nearest neighbors search. We gradually develop mechanisms partially blocking the attacks threatening the original algorithm.\u0000 The loss of performances compared to the original algorithm is mainly an overhead of a constant computation time and communication payload which are independent of the size of the database.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"31 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132938571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Context embedding for raster-scan rhombus based reversible watermarking 基于栅格扫描菱形的可逆水印上下文嵌入
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482535
D. Coltuc, Ioan-Catalin Dragoi
{"title":"Context embedding for raster-scan rhombus based reversible watermarking","authors":"D. Coltuc, Ioan-Catalin Dragoi","doi":"10.1145/2482513.2482535","DOIUrl":"https://doi.org/10.1145/2482513.2482535","url":null,"abstract":"The embedding not only into the current pixel, but also into the prediction context was recently proposed as an improvement of difference expansion reversible watermarking algorithms. So far it was shown that the effect of splitting the data between the current pixel and the prediction context decreases the embedding distortion, but increases the prediction error. This paper revisits the case of context embedding for the case of pixel prediction on the rhombus composed of the two vertical and the two horizontal neighbors. For this case it appears that the context embedding can be used not only to reduce the embedding distortion, but also to improve the prediction. The gain provided by the improvement of the prediction outperforms the one provided by the reduction of the embedding distortion. Experimental results are provided.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114620916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
Bayesian inference to evaluate information leakage in complex scenarios 基于贝叶斯推理的复杂场景信息泄漏评估
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2485731
C. Troncoso
{"title":"Bayesian inference to evaluate information leakage in complex scenarios","authors":"C. Troncoso","doi":"10.1145/2482513.2485731","DOIUrl":"https://doi.org/10.1145/2482513.2485731","url":null,"abstract":"Common security evaluation methods require the estimation of the likelihood of a hidden state given an observation of the system. For instance: identifying the type of tampering on an image given the tampered file, identifying communication partner given an anonymous channel trace, identifying the location from where a service has been accessed given an obfuscated version of this location. In this talk we explore the suitability of Bayesian Inference techniques, specifically Markov Chain Monte Carlo methods, to evaluate information leakage in complex scenarios.\u0000 Using anonymity systems, in particular mix networks, as case study we show that casting problems in the context of Bayesian inference provides an appropriate framework to evaluate security properties (e.g., traceability of messages) in complex constraints.\u0000 We present a generative probabilistic model of mix network architectures that incorporates a number of attack techniques in the trace analysis literature. We use the model to build a Markov Chain Monte Carlo inference engine based on the Metropolis-Hastings algorithm that calculates the probabilities of who is talking to whom given an observation of network traces. Finally, we briefly overview other Bayesian techniques, such as Gibbs sampling and particle filtering, that are useful to tackle other security problems, like user profiling, or to consider dynamic behaviour.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy and security challenges in the smart grid user domain 智能电网用户领域的隐私和安全挑战
Information Hiding and Multimedia Security Workshop Pub Date : 2013-06-17 DOI: 10.1145/2482513.2482966
D. Engel
{"title":"Privacy and security challenges in the smart grid user domain","authors":"D. Engel","doi":"10.1145/2482513.2482966","DOIUrl":"https://doi.org/10.1145/2482513.2482966","url":null,"abstract":"The term \"smart grids\" is used to describe the next-generation intelligent energy systems. Smart grids employ state-of-the-art information and communication technology to control generation, distribution and consumption of energy. With smart grids, the power network organization moves from a hierarchical to a decentralized structure and communication flow moves from largely uni-directional to bi-directional. The degree of information needed on network status is vastly more accurate compared to traditional power networks, and needs to be available in fine granularity in near real-time. The availability of such fine-grained data raises severe privacy concerns in the end-user domain. For example, the application of non-intrusive load monitoring techniques to high-resolution load profiles allows inferring details on user behavior such as presence, sleep-and-wake cycles and the brands of used appliances. Another challenge in the widespread adoption of smart grid technologies lies in the domain of security. Recent reports of smart meters that can easily be hacked and used to remotely control energy availability in the connected household have not helped to increase user trust.\u0000 In this talk, the main challenges in the area of smart grid privacy and security from an end-user perspective will be reviewed. At the example of smart metering, selected solutions will be discussed in detail, with a focal point on leveraging insights and methods from multimedia security to provide security and privacy in the smart grid user domain. These include signal processing in the encrypted domain / secure signal processing, homomorphic encryption, conditional access based on multi-resolution analysis, as well as watermarking techniques.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信