{"title":"Image security tools for JPEG standards","authors":"P. Schelkens","doi":"10.1145/2600918.2600943","DOIUrl":"https://doi.org/10.1145/2600918.2600943","url":null,"abstract":"Image privacy and security are receiving increasingly more attention these days though their impact is still underestimated. Every day billions of digital pictures are generated and distributed via social media, news sites and photo sharing applications. These images tend to carry quite some information that can be regarded to be private for the photographer and/or the pictured individuals. Furthermore, this information is not solely constrained to the visible information carried by the picture. For instance, the sensor noise that is embedded in the picture provides information related to the camera used to take the photo. Besides the picture essence also metadata is signaled in the image file containers, providing geospatial information, camera settings, photographer related information, etc. Hence, it is evident to understand that to protect the privacy of the persons that can be associated with the picture, the necessary security precautions need to be taken. Since many pictures are represented in JPEG image formats, it is evident that the JPEG committee is also investigating how it can integrate better support for privacy and security requirements in its suite of standards. In this presentation, an overview will be given of standardized solutions, where we will particularly focus on JPEG 2000 JPSEC framework, but will also discuss how the committee plans to further improve the support for these requirements in the context of the legacy JPEG standard.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"54 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":"134238288","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":"Slice groups for post-compression region of interest encryption in SVC","authors":"A. Unterweger, A. Uhl","doi":"10.1145/2600918.2600940","DOIUrl":"https://doi.org/10.1145/2600918.2600940","url":null,"abstract":"In this paper, we assess the adequacy of slice groups for the reduction of drift which occurs in bit-stream-based region of interest encryption in SVC. For practical surveillance camera applications, we introduce the concept of all-grey base layers which simplify the encryption of regions of interest while obeying all standard-imposed base layer restrictions. Furthermore, we show that the use of slice groups is possible with relatively low overhead for most practical configurations with two or three spatial layers. In addition, we analyze the effect of spatial resolution on overhead, showing that an increase in resolution decreases the relative overhead.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"102 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":"133973882","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":"Biometrics based observer free transferable E-cash","authors":"Kamlesh Tiwari, Phalguni Gupta","doi":"10.1145/2600918.2600934","DOIUrl":"https://doi.org/10.1145/2600918.2600934","url":null,"abstract":"This paper proposes a transaction strategy to implement transferable E-cash. It does not involve any third party observer at the time of transaction and possesses strong anonymity property. It uses biometric features of the legitimate holder of e-cash to progress the transaction. It works on the transfer of coin ownership and is built around the restrictive blinding and biometric digital signature scheme. Its mathematical model utilizes the hardness of discrete log problem and representation problem in groups. It guarantees anonymity and unlinkability for a genuine user and non repudiation to a fraudulent one.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"10 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":"131745117","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":"Steganographic key leakage through payload metadata","authors":"T. Pevný, Andrew D. Ker","doi":"10.1145/2600918.2600921","DOIUrl":"https://doi.org/10.1145/2600918.2600921","url":null,"abstract":"The only steganalysis attack which can provide absolute certainty about the presence of payload is one which finds the embedding key. In this paper we consider refined versions of the key exhaustion attack exploiting metadata such as message length or decoding matrix size, which must be stored along with the payload. We show simple errors of implementation lead to leakage of key information and powerful inference attacks; furthermore, complete absence of information leakage seems difficult to avoid. This topic has been somewhat neglected in the literature for the last ten years, but must be considered in real-world implementations.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"4 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":"131885412","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":"Capacities and capacity-achieving decoders for various fingerprinting games","authors":"Thijs Laarhoven","doi":"10.1145/2600918.2600925","DOIUrl":"https://doi.org/10.1145/2600918.2600925","url":null,"abstract":"Combining an information-theoretic approach to fingerprinting with a more constructive, statistical approach, we derive new results on the fingerprinting capacities for various informed settings, as well as new log-likelihood decoders with provable code lengths that asymptotically match these capacities. The simple decoder built against the interleaving attack is further shown to achieve the simple capacity for unknown attacks, and is argued to be an improved version of the recently proposed decoder of Oosterwijk et al. With this new universal decoder, cut-offs on the bias distribution function can finally be dismissed. Besides the application of these results to fingerprinting, a direct consequence of our results to group testing is that (i) a simple decoder asymptotically requires a factor 1.44 more tests to find defectives than a joint decoder, and (ii) the simple decoder presented in this paper provably achieves this bound.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116748253","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}
Oren Halvani, M. Steinebach, Patrick Wolf, Ralf Zimmermann
{"title":"Natural language watermarking for german texts","authors":"Oren Halvani, M. Steinebach, Patrick Wolf, Ralf Zimmermann","doi":"10.1145/2482513.2482522","DOIUrl":"https://doi.org/10.1145/2482513.2482522","url":null,"abstract":"In this paper we present four informed natural language watermark embedding methods, which operate on the lexical and syntactic layer of German texts. Our scheme provides several benefits in comparison to state-of-the-art approaches, as for instance that it is not relying on complex NLP operations like full sentence parsing, word sense disambiguation, named entity recognition or semantic role parsing. Even rich lexical resources (e.g. WordNet or the Collins thesaurus), which play an essential role in many previous approches, are unnecessary for our system. Instead, our methods require only a Part-Of-Speech Tagger, simple wordlists that act as black- and whitelists and a trained classifier, which automatically predicts the ability of potential lexical or syntactic patterns to carry portions of the watermark message. Besides this, a part of the proposed methods can be easily adapted into other Indo-European languages, since the grammar rules the methods rely on are not restricted only to the German language. Because the methods perform only lexical and minor syntactic transformations, the watermarked text is not affected by grammatical distortion and simultaneously the meaning of the text is preserved in 82.14% of the cases.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"17 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":"115311191","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":"XOR-based meaningful visual secret sharing by generalized random grids","authors":"Xiaotian Wu, Duanhao Ou, Lu Dai, Wei Sun","doi":"10.1145/2482513.2482515","DOIUrl":"https://doi.org/10.1145/2482513.2482515","url":null,"abstract":"In recent years, random grid (RG) received much attention for constructing visual secret sharing (VSS) scheme without pixel expansion. But recovered secret image with low visual quality reveals due to the stacking operation. To improve the recovered image quality, XOR-based VSS is adopted. However, shares constructed from XOR-based VSS are random-looking. The noise-like appearance further increases the chance of suspicion on secret image communication and imposes difficulty for managing the shares. In this work, a novel (2,2) generalized RG-based VSS is introduced. By adopting the (2,2) VSS, we propose a XOR-based meaningful VSS where shares with meaningful contents are constructed. Moreover, superior visual quality is provided by this method as well.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"23 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":"125099470","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":"Embedding change rate estimation based on ensemble learning","authors":"Zhenyu Li, Zongyun Hu, Xiangyang Luo, Bing Lu","doi":"10.1145/2482513.2482528","DOIUrl":"https://doi.org/10.1145/2482513.2482528","url":null,"abstract":"In order to achieve higher estimation accuracy of the embedding change rate of a stego object, an ensemble learning-based estimation method is presented. First of all, a framework of embedding change rate estimation based on estimator ensemble is proposed. Then an algorithm of building the estimator ensemble, the core of the framework, is concretely described. Finally, a pruning method for estimator ensemble is proposed in consideration of both the diversity among the base estimators and accuracy of each of them. The experimental results for three modern steganographic algorithms (nsF5, PQ and PQt) indicate that the proposed method acquired better performance than the existed typical method. Furthermore, the pruned estimator ensemble with less base estimators maintained, even slightly improved the estimation accuracy, compared to the one without purning.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"31 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":"126756560","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 standardised fingerprint matching robustness assessment: the StirMark toolkit -- cross-database comparisons with minutiae-based matching","authors":"Jutta Hämmerle-Uhl, M. Pober, A. Uhl","doi":"10.1145/2482513.2482531","DOIUrl":"https://doi.org/10.1145/2482513.2482531","url":null,"abstract":"We propose to establish a standardised tool in fingerprint recognition robustness assessment, which is able to simulate a wide class of acquisition conditions, applicable to any given dataset and also of potential interest in forensic analysis. As an example, StirMark image manipulations (as being developed in the context of watermarking robustness assessment) are applied to fingerprint data to generate test data for robustness evaluations, thereby interpreting certain image manipulations as being highly related to realistic fingerprint acquisition conditions. Experimental results involving three different minutiae-based fingerprint matching schemes applied to FVC2004 data underline the need for standardised testing and a corresponding simulation toolset.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"35 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":"129051212","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":"Leakage detection and tracing for databases","authors":"Waldemar Berchtold, Marcel Schäfer, M. Steinebach","doi":"10.1145/2482513.2482537","DOIUrl":"https://doi.org/10.1145/2482513.2482537","url":null,"abstract":"This work presents a new approach for hash database individualization by blending pre-calculated dummy hashes for each user to their databases. This individualization is necessary to detect a leak after the distribution of for example Whitelists or Blacklists. The proposed code is based on collusion secure fingerprinting codes and provides resistance against intuitive attacks for databases as well as attacks for which users collaborate. Both, code generation and tracing requires minimal effort and the distributor is able to control the robustness desired. Advantages compared to salting are improved effort and leakage detection without access to the hash database. A combination of salting and the proposed approach is possible.","PeriodicalId":243756,"journal":{"name":"Information Hiding and Multimedia Security Workshop","volume":"12 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":"132872229","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}