Ngoc-Dung T. Tieu, H. Nguyen, Hoang-Quoc Nguyen-Son, J. Yamagishi, I. Echizen
{"title":"An approach for gait anonymization using deep learning","authors":"Ngoc-Dung T. Tieu, H. Nguyen, Hoang-Quoc Nguyen-Son, J. Yamagishi, I. Echizen","doi":"10.1109/WIFS.2017.8267657","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267657","url":null,"abstract":"The human gait has become another biometrie trait used in security systems because it is unique to each person and can be recognized at a distance. However, a bad actor could use a gait recognition system to identify a person on the basis of his or her gait. We have developed a gait anonymization method that prevents unauthorized gait recognition. It modifies the gait so that the person cannot be identified while maintaining the naturalness of the gait. The modification is done by adding another gait, called \"noise gait\". A convolutional neural network makes this modification by taking two gaits as input, the original gait and the noise gait, and outputting an anonymized gait. The proposed method was evaluated using the success rate and mean opinion score (MOS). The success rate is the rate of failed gait recognition, and the MOS is a measure of the naturalness of the anonymized gait. In our experiments, the success rate achieved 98.86% at most while the highest naturalness score is 3.73 in the MOS scale. These findings should open new research directions regarding privacy protection related to gait recognition.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117294873","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":"Photo forensics from JPEG dimples","authors":"S. Agarwal, H. Farid","doi":"10.1109/WIFS.2017.8267641","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267641","url":null,"abstract":"Previous forensic techniques have exploited various characteristics of JPEG compression to reveal traces of manipulation in digital images. We describe a JPEG artifact that can arise depending on the choice of the mathematical operator used to convert DCT coefficients from floating-point to integer values. We show that the more commonly used floor or ceiling operators (but not the round operator) introduce a periodic artifact in the form of a single darker or brighter pixel — which we term a dimple — in 8 × 8 pixel blocks. We describe the nature of this artifact, its prevalence in commercial cameras, and how this artifact can be quantified and used to detect a wide range of digital manipulations from content-aware fill to re-sampling, airbrushing, and compositing.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129306416","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":"A two factor transformation for speaker verification through ℓ1 comparison","authors":"Abelino Jiménez, B. Raj","doi":"10.1109/WIFS.2017.8267661","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267661","url":null,"abstract":"In a speaker verification task, speech is used as a unique biometrie identifier of an individual. A speaker presents his credentials along with a voice sample. The system matches the voice sample to its own model for the speaker to accept or reject him. This has many pitfalls. First, speech by itself, is not a sufficiently \"strong\" biometric, and false acceptance is a problem. Second, the user must provide the system with voice samples. This puts the speaker's privacy at risk. The system may infer personal information about the user, such as gender, age, ethnicity, health, etc. Finally, if a malicious entity pilfers the speaker's models from the system, the loss is permanent. The speaker cannot change their voice to re-enroll. In this paper, we present a two-factor transformation that addresses all the above issues. It combines a personal password with speech features in order to increase the performance of a verification system. At the same time it is guaranteed not to not reveal any information about the speech or the password to the system. Finally, it is cancelable; if a model is compromised, the user can re-enroll without risk. In particular, we study a transformation that preserves the ℓ1 distance between features as long as this is smaller than some threshold and the user uses the correct password. Experimental results confirm the theory of the proposal in term of improvement in the system's accuracy, finding conditions to get zero error. Security consequences and feasibility of its implementation are discussed.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125838049","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}
G. Lenzini, Samir Ouchani, P. B. Rønne, P. Ryan, Y. Geng, Jan P. F. Lagerwall, JungHyun Noh
{"title":"Security in the shell: An optical physical unclonable function made of shells of cholesteric liquid crystals","authors":"G. Lenzini, Samir Ouchani, P. B. Rønne, P. Ryan, Y. Geng, Jan P. F. Lagerwall, JungHyun Noh","doi":"10.1109/WIFS.2017.8267644","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267644","url":null,"abstract":"We describe the application in security of shells of Cholesteric Liquid Crystals (ChLCs). Such shells have a diameter in the microns range and can be gathered in hundreds in a surface area as small as a nail's head. Because of their structural properties, a bundle of them reflects light, creating colorful patterns that we argue to be unique and computationally hard to predict. We argue also that the bundle itself is unclonable. These are typical properties of Physically Unclonable Functions, a family to which shells of ChLCs belong too. Herein we discuss their physical and security properties and their potential use in object authentication.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130071617","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}
Behrooz Razeghi, S. Voloshynovskiy, Dimche Kostadinov, O. Taran
{"title":"Privacy preserving identification using sparse approximation with ambiguization","authors":"Behrooz Razeghi, S. Voloshynovskiy, Dimche Kostadinov, O. Taran","doi":"10.1109/WIFS.2017.8267664","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267664","url":null,"abstract":"In this paper, we consider a privacy preserving encoding framework for identification applications covering biometrics, physical object security and the Internet of Things (IoT). The proposed framework is based on a sparsifying transform, which consists of a trained linear map, an element-wise nonlinearity, and privacy amplification. The sparsifying transform and privacy amplification are not symmetric for the data owner and data user. We demonstrate that the proposed approach is closely related to sparse ternary codes (STC), a recent information-theoretic concept proposed for fast approximate nearest neighbor (ANN) search in high dimensional feature spaces that being machine learning in nature also offers significant benefits in comparison to sparse approximation and binary embedding approaches. We demonstrate that the privacy of the database outsourced to a server as well as the privacy of the data user are preserved at a low computational cost, storage and communication burdens.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127951185","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":"On the feasibility of classification-based product package authentication","authors":"R. Schraml, L. Debiasi, Christof Kauba, A. Uhl","doi":"10.1109/WIFS.2017.8267659","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267659","url":null,"abstract":"Depending on the product category the authenticity of a consumer good concerns economic, social and/or environmental issues. Counterfeited drugs are a threat to patient safety and cause significant economic losses. Different from physical-marking based approaches this work investigates authentication of drugs based on intrinsic texture features of the packaging material. Therefore, it is assumed that the packaging material of a certain drug shows constant but discriminative textural features which enable authentication, i.e. to prove if the packaging material is genuine or not. This objective requires considering a binary classification problem with an open set of negative classes, i.e. unknown and unseen counterfeits. In order to investigate the feasibility a novel drug packaging texture databases was acquired. The experimental evaluation of two basic requirements in texture classification serves as an evidence on the basic feasibility.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127349258","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}
Emre Durmus, M. Mohanty, Samet Taspinar, Erkam Uzun, N. Memon
{"title":"Image carving with missing headers and missing fragments","authors":"Emre Durmus, M. Mohanty, Samet Taspinar, Erkam Uzun, N. Memon","doi":"10.1109/WIFS.2017.8267665","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267665","url":null,"abstract":"Although some remarkable advancements have been made in image carving, even in the presence of fragmentation, existing methods are not effective when parts (fragments) of an image are missing. This paper addresses this problem and proposes a PRNU (Photo Response Non-Uniformity)-based image carving method. The proposed technique assumes that the underlying camera fingerprint (camera sensor noise) is available prior to the carving process. Given a large number of image fragments, the camera fingerprint is used to find the position of fragments in a to-be-carved image. Using all known-position-fragments, the number of to-be-carved images is then found. The known-position-fragments and the unknown-position-fragments are placed on these images using two different greedy algorithms. Experiment with 23040 fragments shows that the proposed scheme has a true positive rate of 94.2%.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129366270","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":"Minutia-pair spectral representations for fingerprint template protection","authors":"Taras Stanko, B. Škorić","doi":"10.1109/WIFS.2017.8267656","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267656","url":null,"abstract":"We introduce a new fixed-length representation of fingerprint minutiae, for use in template protection. It is similar to the ‘spectral minutiae’ representation of Xu et al. but is based on coordinate differences between pairs of minutiae. Our technique has the advantage that it does not discard the phase information of the spectral functions. We show that the fingerprint matching performance (Equal Error Rate) is comparable to that of the original spectral minutiae representation, while the speed is improved.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122478442","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}
M. Conti, Daniele Lain, R. Lazzeretti, Giulio Lovisotto, Walter Quattrociocchi
{"title":"It's always April fools' day!: On the difficulty of social network misinformation classification via propagation features","authors":"M. Conti, Daniele Lain, R. Lazzeretti, Giulio Lovisotto, Walter Quattrociocchi","doi":"10.1109/WIFS.2017.8267653","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267653","url":null,"abstract":"Given the huge impact that Online Social Networks (OSN) had in the way people get informed and form their opinion, they became an attractive playground for malicious entities that want to spread misinformation, and leverage their effect. In fact, misinformation easily spreads on OSN, and this is a huge threat for modern society, possibly influencing also the outcome of elections, or even putting people's life at risk (e.g., spreading \"anti-vaccines\" misinformation). Therefore, it is of paramount importance for our society to have some sort of \"validation\" on information spreading through OSN. The need for a wide-scale validation would greatly benefit from automatic tools. In this paper, we show that it is difficult to carry out an automatic classification of misinformation considering only structural properties of content propagation cascades. We focus on structural properties, because they would be inherently difficult to be manipulated, with the the aim of circumventing classification systems. To support our claim, we carry out an extensive evaluation on Facebook posts belonging to conspiracy theories (representative of misinformation), and scientific news (representative of fact-checked content). Our findings show that conspiracy content reverberates in a way which is hard to distinguish from scientific content: for the classification mechanism we investigated, classification F-score never exceeds 0.7.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133537724","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":"Towards measuring uniqueness of human voice","authors":"S. Tandogan, H. Sencar, B. Tavlı","doi":"10.1109/WIFS.2017.8267666","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267666","url":null,"abstract":"The use of voice as a biometrie modality for user authentication and identification has grown very rapidly. It is therefore very important that we understand limitations of such systems which will ultimately depend on the discriminative power of the voice biometric. In this paper, we have contributed towards measuring distinctiveness of voice biometric by both formulating a new measure and creating a new dataset to perform more reliable measurements. For this purpose, we evaluate the prominent approaches in the field and propose a new approach that better incorporates within-user variability and is analytically more tractable. Our newly created dataset includes voice samples extracted from close to two thousand TED Talks videos. Overall our measurements on this dataset revealed a biometric information content of about 60 bits in human voice. Further, tests performed by adding some generic voice effects on the samples show that the distinctiveness reduces by almost 20 bits, implying that when true variability is reflected in user samples resulting entropy may further reduce.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130722377","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}