Thomas Gougeon, Morgan Barbier, Patrick Lacharme, Gildas Avoine, C. Rosenberger
{"title":"Retrieving dates in smart card dumps is as hard as finding a needle in a haystack","authors":"Thomas Gougeon, Morgan Barbier, Patrick Lacharme, Gildas Avoine, C. Rosenberger","doi":"10.1109/WIFS.2017.8267663","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267663","url":null,"abstract":"This paper introduces a method to automatically retrieve dates from smart card memory dumps when the card specifications are unknown. It exploits specificities of smart cards, using a multi-dump analysis augmented with contextual information. The experiments performed on more than 180 real smart cards show that our method is highly successful in removing false positives.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123751077","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}
L. Amsaleg, J. Bailey, Dominique Barbe, S. Erfani, M. Houle, Vinh Nguyen, Miloš Radovanović
{"title":"The vulnerability of learning to adversarial perturbation increases with intrinsic dimensionality","authors":"L. Amsaleg, J. Bailey, Dominique Barbe, S. Erfani, M. Houle, Vinh Nguyen, Miloš Radovanović","doi":"10.1109/WIFS.2017.8267651","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267651","url":null,"abstract":"Recent research has shown that machine learning systems, including state-of-the-art deep neural networks, are vulnerable to adversarial attacks. By adding to the input object an imperceptible amount of adversarial noise, it is highly likely that the classifier can be tricked into assigning the modified object to any desired class. It has also been observed that these adversarial samples generalize well across models. A complete understanding of the nature of adversarial samples has not yet emerged. Towards this goal, we present a novel theoretical result formally linking the adversarial vulnerability of learning to the intrinsic dimensionality of the data. In particular, our investigation establishes that as the local intrinsic dimensionality (LID) increases, 1-NN classifiers become increasingly prone to being subverted. We show that in expectation, a k-nearest neighbor of a test point can be transformed into its 1-nearest neighbor by adding an amount of noise that diminishes as the LID increases. We also provide an experimental validation of the impact of LID on adversarial perturbation for both synthetic and real data, and discuss the implications of our result for general classifiers.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128511161","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 identification under jamming attacks","authors":"H. Boche, C. Deppe","doi":"10.1109/WIFS.2017.8267648","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267648","url":null,"abstract":"In next generation connectivity systems, relying on robust and low-latency information exchange, there exists communication tasks in which the Ahlswede/Dueck identification scheme is much more efficient than Shannon's transmission scheme. We concentrate on the arbitrarily varying wiretap channel (AVWC) modeling jamming attacks. We provide a coding scheme for secure identification and determine the secrecy capacity of the AVWC. Furthermore, we analyze important properties of this capacity function, e.g. continuity and super-additivity.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"43 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":"125333238","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}
Sebastiano Verde, S. Milani, Paolo Bestagini, S. Tubaro
{"title":"Audio phylogenetic analysis using geometric transforms","authors":"Sebastiano Verde, S. Milani, Paolo Bestagini, S. Tubaro","doi":"10.1109/WIFS.2017.8267650","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267650","url":null,"abstract":"Whenever a multimedia content is shared on the Internet, a mutation process is being operated by multiple users that download, alter and repost a modified version of the original data leading to the diffusion of multiple near-duplicate copies. This effect is also experienced by audio data (e.g., in audio sharing platforms) and requires the design of accurate phylogenetic analysis strategies that permit uncovering the processing history of each copy and identify the original one. This paper proposes a new phylogenetic reconstruction strategy that converts the analyzed audio tracks into spectrogram images and compare them using alignment strategies borrowed from computer vision. With respect to strategies currently-available in literature, the proposed solution proves to be more accurate, does not require any a-priori knowledge about the operated transformations, and requires a significantly-lower amount of computational time.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"8 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":"129612709","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}
Omid Avatefipour, Azeem Hafeez, M. Tayyab, Hafiz Malik
{"title":"Linking received packet to the transmitter through physical-fingerprinting of controller area network","authors":"Omid Avatefipour, Azeem Hafeez, M. Tayyab, Hafiz Malik","doi":"10.1109/WIFS.2017.8267643","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267643","url":null,"abstract":"The Controller Area Network (CAN) bus serves as a legacy protocol for in-vehicle data communication. Simplicity, robustness, and suitability for real-time systems are the salient features of the CAN bus protocol. However, it lacks the basic security features such as massage authentication, which makes it vulnerable to the spoofing attacks. In a CAN network, linking CAN packet to the sender node is a challenging task. This paper aims to address this issue by developing a framework to link each CAN packet to its source. Physical signal attributes of the received packet consisting of channel and node (or device) which contains specific unique artifacts are considered to achieve this goal. Material and design imperfections in the physical channel and digital device, which are the main contributing factors behind the device-channel specific unique artifacts, are leveraged to link the received electrical signal to the transmitter. Generally, the inimitable patterns of signals from each ECUs exist over the course of time that can manifest the stability of the proposed method. Uniqueness of the channel-device specific attributes are also investigated for time-and frequency-domain. Feature vector is made up of both time and frequency domain physical attributes and then employed to train a neural network-based classifier. Performance of the proposed fingerprinting method is evaluated by using a dataset collected from 16 different channels and four identical ECUs transmitting same message. Experimental results indicate that the proposed method achieves correct detection rates of 95.2% and 98.3% for channel and ECU classification, respectively.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"41 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":"128747009","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}
Borui Li, Han Sun, Yang Gao, V. Phoha, Zhanpeng Jin
{"title":"Enhanced free-text keystroke continuous authentication based on dynamics of wrist motion","authors":"Borui Li, Han Sun, Yang Gao, V. Phoha, Zhanpeng Jin","doi":"10.1109/WIFS.2017.8267642","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267642","url":null,"abstract":"Free-text keystroke is a form of behavioral biometrics which has great potential for addressing the security limitations of conventional one-time authentication by continuously monitoring the user's typing behaviors. This paper presents a new, enhanced continuous authentication approach by incorporating the dynamics of both keystrokes and wrist motions. Based upon two sets of features (free-text keystroke latency features and statistical wrist motion patterns extracted from the wrist-worn smartwatches), two one-vs-all Random Forest Ensemble Classifiers (RFECs) are constructed and trained respectively. A Dynamic Trust Model (DTM) is then developed to fuse the two classifiers' decisions and realize non-time-blocked real-time authentication. In the free-text typing experiments involving 25 human subjects, an imposter/intruder can be detected within no more than one sentence (average 56 keystrokes) with an FRR of 1.82% and an FAR of 1.94%. Compared with the scheme relying on only keystroke latency which has an FRR of 4.66%, an FAR of 17.92% and the required number of keystroke of 162, the proposed authentication system shows significant improvements in terms of accuracy, efficiency, and usability.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"29 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":"124114705","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":"AHEad: Privacy-preserving online behavioural advertising using homomorphic encryption","authors":"L. Helsloot, Gamze Tillem, Z. Erkin","doi":"10.1109/WIFS.2017.8267662","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267662","url":null,"abstract":"Online advertising is a rapidly growing industry, forming the primary source of income for many publishers that offer free web content. The practice of serving advertisements based on individuals' interests greatly improves the expected effectiveness of advertisements, and is believed to be beneficial to publishers and users alike. However, the widespread data collection required for such behavioural advertising sparks concerns over user privacy. In this paper, we present AHEad, a privacy-preserving protocol for Online Behavioural Advertising that ensures user privacy by processing data in encrypted form. AHEad combines homomorphic encryption with a machine learning method commonly encountered in existing advertising systems. Advertisements are served based on detailed user profiles, while achieving performance linear in the size of user profiles. To the best of our knowledge, AHEad is the first protocol that preserves user privacy in behavioural advertising while allowing the use of detailed user profiles and machine learning methods.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"12 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":"129819426","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":"Energy obfuscation for compressive encryption and processing","authors":"Matteo Testa, T. Bianchi, E. Magli","doi":"10.1109/WIFS.2017.8267649","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267649","url":null,"abstract":"Compressed Sensing enables both computationally secure encryption and signal processing in the compressed domain. Even though these characteristics have always been considered in separate fashion, in this paper we propose a novel method that takes into account these features jointly. As a result we obtain provable secrecy guarantees and enable fast signal processing. In more detail, we show that it is possible to perform anomaly detection relying on the measurements information leakage. At the same time, we can prevent attackers trying to obtain confidential data by obfuscating the information leakage. We show the effectiveness of such method through theoretical bounds and numerical experiments.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"7 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":"121298865","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":"Object insertion and removal in images with mirror reflection","authors":"Zhaohui H. Sun, A. Hoogs","doi":"10.1109/WIFS.2017.8267645","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267645","url":null,"abstract":"In this paper, we study reflection integrity assessment for images with strong mirror reflection. Image reflections are physical-level forensic cues involving complicated interactions between surface materials, geometry and lighting, and therefore extremely difficult to fake. Malicious photo manipulations, such as object insertion and removal, can be detected by predicting reflection locations and geometry using scene content and comparing reflections with directly observed objects. We propose a reflection-invariant Bag-of-Features approach to detect and match interest points in the scene and reflection regions, without any prior knowledge. The proposal is open to any robust features and seeks for the right feature yielding the maximal number of matched points. In addition, robust change detection based on disjoint information is proposed to detect object insertion and removal, which is less sensitive to incidental appearance changes. The proposed method is validated on 868 images from the world dataset to demonstrate its efficacy.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"9 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":"114759566","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}
Z. Chen, B. Tondi, Xiaolong Li, R. Ni, Yao Zhao, M. Barni
{"title":"A gradient-based pixel-domain attack against SVM detection of global image manipulations","authors":"Z. Chen, B. Tondi, Xiaolong Li, R. Ni, Yao Zhao, M. Barni","doi":"10.1109/WIFS.2017.8267668","DOIUrl":"https://doi.org/10.1109/WIFS.2017.8267668","url":null,"abstract":"We present a gradient-based attack against SVM-based forensic techniques relying on high-dimensional SPAM features. As opposed to prior work, the attack works directly in the pixel domain even if the relationship between pixel values and SPAM features can not be inverted. The proposed method relies on the estimation of the gradient of the SVM output with respect to pixel values, however it departs from gradient descent methodology due to the necessity of preserving the integer nature of pixels and to reduce the effect of the attack on image quality. A fast algorithm to estimate the gradient is also introduced to reduce the complexity of the attack. We tested the proposed attack against SVM detection of histogram stretching, adaptive histogram equalization and median filtering. In all cases the attack succeeded in inducing a decision error with a very limited distortion, the PSNR between the original and the attacked images ranging from 50 to 70 dBs. The attack is also effective in the case of attacks with Limited Knowledge (LK) when the SVM used by the attacker is trained on a different dataset with respect to that used by the analyst.","PeriodicalId":305837,"journal":{"name":"2017 IEEE Workshop on Information Forensics and Security (WIFS)","volume":"98 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":"122641070","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}