{"title":"Security aspects of privacy-preserving biometric authentication based on ideal lattices and ring-LWE","authors":"Aysajan Abidin, Aikaterini Mitrokotsa","doi":"10.1109/WIFS.2014.7084304","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084304","url":null,"abstract":"In this paper, we study the security of two recently proposed privacy-preserving biometric authentication protocols that employ packed somewhat homomorphic encryption schemes based on ideal lattices and ring-LWE, respectively. These two schemes have the same structure and have distributed architecture consisting of three entities: a client server, a computation server, and an authentication server. We present a simple attack algorithm that enables a malicious computation server to learn the biometric templates in at most 2N-τ queries, where N is the bit-length of a biometric template and τ the authentication threshold. The main enabler of the attack is that a malicious computation server can send an encryption of the inner product of the target biometric template with a bitstring of his own choice, instead of the securely computed Hamming distance between the fresh and stored biometric templates. We also discuss possible countermeasures to mitigate the attack using private information retrieval and signatures of correct computation.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121465293","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}
{"title":"Rich model for Steganalysis of color images","authors":"M. Goljan, J. Fridrich, R. Cogranne","doi":"10.1109/WIFS.2014.7084325","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084325","url":null,"abstract":"In this paper, we propose an extension of the spatial rich model for steganalysis of color images. The additional features are formed by three-dimensional co-occurrences of residuals computed from all three color channels and their role is to capture dependencies across color channels. These CRMQ1 (color rich model) features are extremely powerful for detection of steganography in images that exhibit traces of color interpolation. Content-adaptive algorithms seem to be hurt much more because of their tendency to modify the same pixels in each channel. The efficiency of the proposed feature set is demonstrated on three different color versions of BOSSbase 1.01 and two steganographic algorithms - the non-adaptive LSB matching and WOW.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127896971","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}
F. González-Serrano, A. Amor-Martín, Jorge Casamayon-Anton
{"title":"State estimation using an extended Kalman filter with privacy-protected observed inputs","authors":"F. González-Serrano, A. Amor-Martín, Jorge Casamayon-Anton","doi":"10.1109/WIFS.2014.7084303","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084303","url":null,"abstract":"In this paper, we focus on the parameter estimation of dynamic state-space models using privacy-protected data. We consider an scenario with two parties: on one side, the data owner, which provides privacy-protected observations to, on the other side, an algorithm owner, that processes them to learn the system's state vector. We combine additive homomorphic encryption and Secure Multiparty Computation protocols to develop secure functions (multiplication, division, matrix inversion) that keep all the intermediate values encrypted in order to effectively preserve the data privacy. As an application, we consider a tracking problem, in which a Extended Kalman Filter estimates the position, velocity and acceleration of a moving target in a collaborative environment where encrypted distance measurements are used.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131222423","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}
{"title":"Detecting misreporting attacks to the proportional fair scheduler","authors":"J. F. Schmidt, Roberto López-Valcarce","doi":"10.1109/WIFS.2014.7084310","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084310","url":null,"abstract":"The Proportional Fair Scheduler (PFS) has become a popular channel-aware resource allocation method in wireless networks, as it effectively exploits multiuser diversity while providing fairness to users. PFS decisions on which mobile station (MS) to schedule next are based on Channel Quality Indicator (CQI) values. Since CQI values are reported by the MSs to the scheduler, network performance can be severely degraded if some malicious MSs report forged information. Previous approaches to this security issue are based either on modifying PFS, which may be undesirable in some contexts, or authenticating CQI reports by periodic transmission of challenges, which increases overhead. Instead, we propose to detect misreporting attackers, based on the time correlation features of the wireless channel. Our approach does not require scheduler modification, and it does not increase overhead. Simulation results under realistic settings are provided to show the effectiveness of the proposed test.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134505240","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}
{"title":"Puzzling face verification algorithms for privacy protection","authors":"Binod Bhattarai, A. Mignon, F. Jurie, T. Furon","doi":"10.1109/WIFS.2014.7084305","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084305","url":null,"abstract":"This paper presents a new approach for de-identifying face images, i.e. for preventing automatic matching with public face collections. The overall motivation is to offer tools for privacy protection on social networks. We address this question by drawing a parallel between face de-identification and oracle attacks in digital watermarking. In our case, the identity of the face is seen as the watermark to be removed. Inspired by oracle attacks, we forge de-identified faces by superimposing a collection of carefully designed noise patterns onto the original face. The modification of the image is controlled to minimize the probability of good recognition while minimizing the distortion. In addition, these de-identified images are - by construction - made robust to counter attacks such as blurring. We present an experimental validation in which we de-identify LFW faces and show that resulting images are still recognized by human beings while deceiving a state-of-the-art face recognition algorithm.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592708","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}
{"title":"Fair resource allocation under an unknown jamming attack: a Bayesian game","authors":"A. Garnaev, W. Trappe","doi":"10.1109/WIFS.2014.7084332","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084332","url":null,"abstract":"The goal of this paper is to investigate the problem how a base station (BS), facing an unknown jamming attack, should decide to allocate scarce communication resources so as to maintain fair and reliable communication for its users. In order to obtain insight into this problem, we examine a Bayesian game using α- fairness utility, which allows the problem to be treated in a universal framework involving maximizing the total user SNR and minimizing the total user delay in transmission. The solution is a maxmin strategy (i.e. it is the optimal resource allocation under expected worst conditions), and is obtained explicitly, and thereby allows for interesting properties associated with the problem to be established.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114571857","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}
{"title":"Secure compressed sensing over finite fields","authors":"Valerio Bioglio, T. Bianchi, E. Magli","doi":"10.1109/WIFS.2014.7084326","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084326","url":null,"abstract":"In this paper, we analyze the security of compressed sensing (CS) defined over finite fields. First, we prove that acquiring signals using dense sensing matrices may provide almost perfect secrecy. Then, we prove that using sparse sensing matrices, which admit efficient recovery algorithms mutuated by coding theory, reveals information only on the sparsity of the sensed signal, and that such information is conveyed only by the sparsity of the measurements. Finally, we introduce an operational definition of security, based on the error probability in estimating the signal sparsity, and show that there is a tradeoff between the sparsity of the sensing matrix and the security of the CS system.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123412220","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}
Lorenzo Gaborini, Paolo Bestagini, S. Milani, M. Tagliasacchi, S. Tubaro
{"title":"Multi-Clue Image Tampering Localization","authors":"Lorenzo Gaborini, Paolo Bestagini, S. Milani, M. Tagliasacchi, S. Tubaro","doi":"10.1109/WIFS.2014.7084315","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084315","url":null,"abstract":"Image tampering is nowadays at everyone's reach. This has determined an urgent need of tools capable of revealing such alterations. Unfortunately, while forgeries can be operated in many different ways, forensic tools usually focus on one specific kind of forgeries. Therefore, an effective strategy for tampering detection and localization requires to merge the output of many different forensic tools. In this paper, we propose an algorithm for image tampering localization, based on the fusion of three separate detectors: i) one based on PRNU, working when we have at least a few of pictures shot with the same camera; ii) one based on PatchMatch; iii) one exploiting image phylogeny analysis, in case we have a set of near-duplicate images to analyze. The method is validated against the dataset released by the IEEE Information Forensics and Security Technical Committee for the First Image Forensics Challenge. Results show that the proposed algorithm can beat the challenge with the highest score achieved at paper submission time.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133669634","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}
{"title":"Optimal detection of outguess using an accurate model of DCT coefficients","authors":"T. H. Thai","doi":"10.1109/WIFS.2014.7084324","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084324","url":null,"abstract":"This paper presents an optimal statistical test for the detection of OutGuess steganographic algorithm using an accurate statistical model of Discrete Cosine Transform (DCT) coefficients. First, this paper presents the proposed novel statistical model of quantized DCT coefficients. Then, this model is applied to design an optimal statistical test for the detection of OutGuess data hiding scheme. To this end, the detection of hidden data is cast within the framework of hypothesis testing theory. The optimal Likelihood Ratio Test (LRT) is first presented. Then, for a practical application, a Generalized LRT is proposed using Maximum Likelihood Estimations of unknown parameters. Large scale numerical results show that the proposed approach allows the reliable and efficient detection of OutGuess.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127418470","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}
{"title":"Forensic characterization of pirated movies: digital cinema cam vs. optical disc rip","authors":"B. Chupeau, Séverine Baudry, G. Doërr","doi":"10.1109/WIFS.2014.7084320","DOIUrl":"https://doi.org/10.1109/WIFS.2014.7084320","url":null,"abstract":"A large portion of pirate movies illegally shared over the Internet is either a camcorded copy of a projection in a digital cinema or is directly ripped from optical discs such as DVDs and Blu-ray discs. In this paper, we introduce a classifier that automatically discriminates between these two types of piracy in an effort to provide tools that help streamlining the whole forensic analysis process. This oracle relies on tell-tale visual artifacts that reveal the occurrence of camcording. We survey three alternate discriminative features relating to temporal flicker, color gamut, and edge orientation and detail how to combine them to obtain accurate classification. Experiments conducted on a large corpus of real pirated movies clearly demonstrate the feasibility of such classification.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123585367","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}