{"title":"Distributional differential privacy for large-scale smart metering","authors":"Márk Jelasity, K. Birman","doi":"10.1145/2600918.2600919","DOIUrl":"https://doi.org/10.1145/2600918.2600919","url":null,"abstract":"In smart power grids it is possible to match supply and demand by applying control mechanisms that are based on fine-grained load prediction. A crucial component of every control mechanism is monitoring, that is, executing queries over the network of smart meters. However, smart meters can learn so much about our lives that if we are to use such methods, it becomes imperative to protect privacy. Recent proposals recommend restricting the provider to differentially private queries, however the practicality of such approaches has not been settled. Here, we tackle an important problem with such approaches: even if queries at different points in time over statistically independent data are implemented in a differentially private way, the parameters of the distribution of the query might still reveal sensitive personal information. Protecting these parameters is hard if we allow for continuous monitoring, a natural requirement in the smart grid. We propose novel differentially private mechanisms that solve this problem for sum queries. We evaluate our methods and assumptions using a theoretical analysis as well as publicly available measurement data and show that the extra noise needed to protect distribution parameters is small.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127291515","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 universal image forensic strategy based on steganalytic model","authors":"Xiaoqing Qiu, Haodong Li, Weiqi Luo, Jiwu Huang","doi":"10.1145/2600918.2600941","DOIUrl":"https://doi.org/10.1145/2600918.2600941","url":null,"abstract":"Image forensics have made great progress during the past decade. However, almost all existing forensic methods can be regarded as the specific way, since they mainly focus on detecting one type of image processing operations. When the type of operations changes, the performances of the forensic methods usually degrade significantly. In this paper, we propose a universal forensics strategy based on steganalytic model. By analyzing the similarity between steganography and image processing operation, we find that almost all image operations have to modify many image pixels without considering some inherent properties within the original image, which is similar to what in steganography. Therefore, it is reasonable to model various image processing operations as steganography and it is promising to detect them with the help of some effective universal steganalytic features. In our experiments, we evaluate several advanced steganalytic features on six kinds of typical image processing operations. The experimental results show that all evaluated steganalyzers perform well while some steganalytic methods such as the spatial rich model (SRM) [4] and LBP [19] based methods even outperform the specific forensic methods significantly. What is more, they can further identify the type of various image processing operations, which is impossible to achieve using the existing forensic methods.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121658385","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":"Robust palmprint verification using sparse representation of binarized statistical features: a comprehensive study","authors":"Ramachandra Raghavendra, C. Busch","doi":"10.1145/2600918.2600929","DOIUrl":"https://doi.org/10.1145/2600918.2600929","url":null,"abstract":"This paper proposes a new scheme for robust palmprint verification using sparse representation of Binarized Statistical Image Features (BSIF). Since palmprint comprises of rich set of features including principal lines, ridges and wrinkles, the use of appropriate texture descriptor is expected to accurately capture these information. To this extent, we explore the BSIF texture descriptor which codes each pixel of the given palmprint image in terms of binary strings based on the filter response. The BSIF learns the filter basis from the natural images by exploring statistical independence. We then use the Sparse Representation Classifier (SRC) on these BSIF features to perform the subject verification. Extensive experiments are carried out on three different large scale publically available palmprint databases. We then present an extensive analysis by comparing the proposed scheme with five different contemporary state-of-the-art schemes that reveals the outstanding performance.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125979799","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":"Digital crime scene analysis: automatic matching of firing pin impressions on cartridge bottoms using 2d and 3d spatial features","authors":"R. Fischer, C. Vielhauer","doi":"10.1145/2600918.2600930","DOIUrl":"https://doi.org/10.1145/2600918.2600930","url":null,"abstract":"The examination of forensic toolmarks impressed on shot cartridges and bullets is a well known and broadly accepted forensic discipline. The underlying concept is based on two main hypotheses: every firearm owns unique toolmark characteristics which lead to consistent and reproducible impressions on cartridges and bullets. Furthermore, it is possible to differentiate between markings of two different firearms. The application of optical 2D and 3D sensing technologies for acquisition, as well as pattern recognition techniques for automated toolmark examination are currently emerging fields of research in the domain of digital crime scene analysis. In this paper we propose and evaluate a pattern recognition approach for automated firearm identification based on central-fire firing pin impressions. The entire pattern recognition chain is addressed, starting with a confocal microscope for optical data acquisition. The preprocessing covers image enhancement, as well as necessary registration and segmentation tasks for cartridge bottoms. Feature extraction involves 18 firing pin related features from 2D and 3D spatial domain. The classification accuracy is evaluated by using 10-fold stratified cross-validation. Our evaluation approach is two-fold, during the first part we examine how well it is possible to differentiate between two firearms of the same mark and model. During the second part the evaluation is extended to analyze the accuracy of discrimination using six different weapons, whereby each two guns are of the same model. The test set contains 72 cartridge samples including three different ammunition manufactures and six individual 9mm guns. Every possible combination of weapon model, instance and ammunition type is represented by four samples within the test set. Regarding the first evaluation goal a classification accuracy between 87.5% and 100% is achieved. For the second evaluation goal the achieved classification accuracy equates to 86.11%.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131061973","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":"FastPass: automated border control as challenging combination of various security technologies","authors":"M. Clabian","doi":"10.1145/2600918.2600944","DOIUrl":"https://doi.org/10.1145/2600918.2600944","url":null,"abstract":"In this paper, we present the FastPass project - a new research approach to automated border control (ABC) systems. In the last two decennia various concepts of ABCs have been developed mainly driven by pure technological and industrial viewpoints. Those systems are nowadays tested and even employed in regular operation by many states and reveal several drawbacks. Various security technologies are used for such complex ABC solutions including biometrics, surveillance, certificate exchange, data protection, secure user interaction and information security. Hence, the FastPass project proposes a multiple stakeholders driven approach emphasizing user's needs and providing a deeper look into the security technologies to estimate the risk, challenges and opportunities of an automated approach. The FastPass project reconsiders these factors and proposes a reference architecture for all European border crossing points.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114395688","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}
J. Bringer, H. Chabanne, M. Favre, Alain Patey, T. Schneider, Michael Zohner
{"title":"GSHADE: faster privacy-preserving distance computation and biometric identification","authors":"J. Bringer, H. Chabanne, M. Favre, Alain Patey, T. Schneider, Michael Zohner","doi":"10.1145/2600918.2600922","DOIUrl":"https://doi.org/10.1145/2600918.2600922","url":null,"abstract":"At WAHC'13, Bringer et al. introduced a protocol called SHADE for secure and efficient Hamming distance computation using oblivious transfer only. In this paper, we introduce a generalization of the SHADE protocol, called GSHADE, that enables privacy-preserving computation of several distance metrics, including (normalized) Hamming distance, Euclidean distance, Mahalanobis distance, and scalar product. GSHADE can be used to efficiently compute one-to-many biometric identification for several traits (iris, face, fingerprint) and benefits from recent optimizations of oblivious transfer extensions. GSHADE allows identification against a database of 1000 Eigenfaces in 1.28 seconds and against a database of 10000 IrisCodes in 17.2 seconds which is more than 10 times faster than previous works.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125024815","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":"Influence of data granularity on nonintrusive appliance load monitoring","authors":"Günther Eibl, D. Engel","doi":"10.1145/2600918.2600920","DOIUrl":"https://doi.org/10.1145/2600918.2600920","url":null,"abstract":"Decreasing time resolution is the simplest possible privacy enhancing technique for energy consumption data. However, its impact on privacy analyses of load signals has never been studied systematically. Non-intrusive appliance load monitoring algorithms (NIALM) have originally been designed for energy disaggregation for subsequent energy feedback. However, the information on appliance use may also be misused for the extraction of personal information. In this work, the effect of decreasing the time resolution in the usual first step, namely edge detection, is studied. It is shown that event values can be estimated rather reliably, but the detection rate of events significantly decreases with increasing measurement time interval.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121859147","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":"Notes on non-interactive secure comparison in \"image feature extraction in the encrypted domain with privacy-preserving SIFT\"","authors":"M. Schneider, T. Schneider","doi":"10.1145/2600918.2600927","DOIUrl":"https://doi.org/10.1145/2600918.2600927","url":null,"abstract":"Protocols for secure comparison are a fundamental building block of many privacy-preserving protocols such as privacy-preserving face recognition or privacy-preserving fingerprint authentication. So far, all existing secure comparison protocols that have been used in practical implementations require interaction.\u0000 In recent work, Hsu et al. (IEEE Transactions on Image Processing 2012) propose protocols for privacy-preserving computation of the scale-invariant feature transform (SIFT) in the encrypted domain. Their fundamental building block is a new protocol for performing secure comparisons under additively homomorphic encryption that requires no interaction.\u0000 In this paper we present potential for optimization and shortcomings of their secure comparison protocol. More specifically, we show that it 1) allows optimizations by shifting computation from the server to the user, 2) removes the gain that the user has in outsourcing computations to the server, and most importantly is 3) either computationally intractable for the server or insecure. As alternatives we propose to use either interactive comparison protocols or non-interactive somewhat or fully homomorphic encryption.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763463","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}
Markus Kammerstetter, L. Langer, Florian Skopik, W. Kastner
{"title":"Architecture-driven smart grid security management","authors":"Markus Kammerstetter, L. Langer, Florian Skopik, W. Kastner","doi":"10.1145/2600918.2600937","DOIUrl":"https://doi.org/10.1145/2600918.2600937","url":null,"abstract":"The introduction of smart grids goes along with an extensive use of ICT technologies in order to support the integration of renewable energy sources. However, the use of ICT technologies bears risks in terms of cyber security attacks which could negatively affect the electrical power grid. These risks need to be assessed, mitigated and managed in a proper way to ensure the security of both current and future energy networks. Existing approaches have been either restricted to very specific components of the smart grid (e.g., smart meters), or provide a high-level view only. We therefore propose an architecture-driven security management approach for smart grids which goes beyond a mere abstract view without focusing too much on technical details. Our approach covers architecture modeling, risk identification and assessment as well as risk mitigation and compliance checking. We have proven the practical usability of this process together with leading manufacturers and utilities.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116272421","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":"Predictable rain?: steganalysis of public-key steganography using wet paper codes","authors":"Matthias Carnein, Pascal Schöttle, Rainer Böhme","doi":"10.1145/2600918.2600942","DOIUrl":"https://doi.org/10.1145/2600918.2600942","url":null,"abstract":"Symmetric steganographic communication requires a secret stego-key pre-shared between the communicating parties. Public-key steganography (PKS) overcomes this inconvenience. In this case, the steganographic security is based solely on the underlying asymmetric encryption function. This implies that the embedding positions are either public or hidden by clever coding, for instance using Wet Paper Codes (WPC), but with public code parameters. We show that using WPC with efficient encoding algorithms may leak information which can facilitate an attack. The public parameters allow an attacker to predict among the possible embedding positions the ones most likely used for embedding. This approach is independent of the embedding operation. We demonstrate it for the case of least significant bit (LSB) replacement and present two new variants of Weighted Stego-Image (WS) steganalysis specifically tailored to detect PKS using efficient WPC. Experiments show that our WS variants can detect PKS with higher accuracy than known methods, especially for low embedding rates. The attack is applicable even if a hybrid stegosystem is constructed and public-key cryptography is only used to encapsulate a secret stego-key.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132177800","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}