{"title":"A Privacy-Preserving Method for Photo Sharing in Instant Message Systems","authors":"Fenghua Li, Jingyang Yu, Lingcui Zhang, Zhelei Sun, Mengfan Lv","doi":"10.1145/3058060.3058081","DOIUrl":"https://doi.org/10.1145/3058060.3058081","url":null,"abstract":"In instant messaging systems, photos have become an expressive form of real-time content sharing among users. Unfortunately, faces of stakeholders, who are depicted in the shared photos, may be exposed to unexpected viewers. This may lead to privacy leakages. In this paper, an approach is proposed to prevent such leakages, which is based on access control and face recognition. Each time a photo is sent, all stakeholders are recognized, and their faces are hidden from viewers. At the same time, stakeholders will be notified about the photo, and can decide to reveal their own faces to some proper viewers later. On the other hand, similar photos are exploited to automate this revealing process when possible, so as to reduce the impact of access control on user experiences. Besides, a proof-of-concept system is constructed and its performance is evaluated. The results indicate that this approach can be applied in instant messaging systems without too much overhead.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125884842","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":"Zero-Knowledge Identification Scheme Based on Symmetry Ergodic Matrices Exponentiation Problem","authors":"Huawei Huang, Yunyun Qu, Lunzhi Deng","doi":"10.1145/3058060.3058084","DOIUrl":"https://doi.org/10.1145/3058060.3058084","url":null,"abstract":"Symmetry ergodic matrices exponentiation (SEME) problem is to find x, given CxMDx, where C and D are the companion matrices of primitive polynomials and M is an invertible matrix over finite field. This paper proposes a new zero-knowledge identification scheme based on SEME problem. It is perfect zero-knowledge for honest verifiers. The scheme could provide a candidate cryptographic primitive in post quantum cryptography. Due to its simplicity and naturalness, low-memory, low-computation costs, the proposed scheme is suitable for using in computationally limited devices for identification such as smart cards.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"6 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126041577","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":"Feasibility Analysis of Lattice-based Proxy Re-Encryption","authors":"Xuyang Wang, A. Hu, Hao Fang","doi":"10.1145/3058060.3058080","DOIUrl":"https://doi.org/10.1145/3058060.3058080","url":null,"abstract":"Proxy Re-encryption (PRE) is a useful cryptographic structure who enables a semi-trusted proxy to convert a ciphertext for Alice into a ciphertext for Bob without seeing the corresponding plaintext. Although there are many PRE schemes in recent years, few of them are set up based on lattice. Not only this, these lattice-based PRE schemes are all more complicated than the traditional PRE schemes. In this paper, through the study of the common lattice problems such as the Small integer solution (SIS) and the Learning with Errors (LWE), we analyze the feasibility of efficient lattice-based PRE scheme combined with the previous results. Finally, we propose an efficient lattice-based PRE scheme L-PRE without losing the hardness of lattice problems.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115096149","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 Matrix Decomposition based Webshell Detection Method","authors":"Xin Sun, Xindai Lu, Hua Dai","doi":"10.1145/3058060.3058083","DOIUrl":"https://doi.org/10.1145/3058060.3058083","url":null,"abstract":"WebShell is a web based network backdoor. With the help of WebShells, the hacker can take any control of the web services illegally. The current method of detecting WebShells is just matching the eigenvalues or detecting the produced flow or services, which is hard to find new kinds of WebShells. To solve these problems, this paper analyzes the different features of a page and proposes a novel matrix decomposition based WebShell detection algorithm. The algorithm is a supervised machine learning algorithm. By analyzing and learning features of known existing and non-existing WebShell pages, the algorithm can make predictions on the unknown pages. The experimental results show that, compared with traditional detection methods, this algorithm spends less time, has higher accuracy and recall rate, and can detect new kinds of WebShells with a certain probability, overcoming the shortcomings of the traditional feature matching based method, improving the accuracy and recalling rate of WebShell detection.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114171279","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":"Variance Analysis of Pixel-Value Differencing Steganography","authors":"H. Zhang, Tao Zhang, Huajin Chen","doi":"10.1145/3058060.3058077","DOIUrl":"https://doi.org/10.1145/3058060.3058077","url":null,"abstract":"As the adaptive steganography selects edge and texture area for loading, the theoretical analysis is limited by modeling difficulty. This paper introduces a novel method to study pixel-value difference (PVD) embedding scheme. First, the difference histogram values of cover image are used as parameters, and a variance formula for PVD stego noise is obtained. The accuracy of this formula has been verified through analysis with standard pictures. Second, the stego noise is divided into six kinds of pixel regions, and the regional noise variances are utilized to compare the security between PVD and least significant bit matching (LSBM) steganography. A mathematical conclusion is presented that, with the embedding capacity less than 2.75 bits per pixel, PVD is always not safer than LSBM under the same embedding rate, regardless of region selection. Finally, 10000 image samples are used to observe the validity of mathematical conclusion. For most images and regions, the data are also shown to be consistent with the prior judgment. Meanwhile, the cases of exception are analyzed seriously, and are found to be caused by randomness of pixel selection and abandoned blocks in PVD scheme. In summary, the unity of theory and practice completely indicates the effectiveness of our new method.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"449 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566045","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 Practical Compartmentation Approach for the Android App Coexistence","authors":"Hongmu Han, Ruixuan Li","doi":"10.1145/3058060.3058073","DOIUrl":"https://doi.org/10.1145/3058060.3058073","url":null,"abstract":"Android operation system (OS) provides a number of covert and overt communication channels between applications. This significant promotes inter-app collaboration and reduces development time and cost by facilitating component reuse. Unfortunately, inter-app communication has been shown to be vulnerable to privilege escalation attacks, such as confused deputy attacks, collusion attacks. It is an economic and effective method to mitigate privilege escalation attacks by isolation. However, it is unclear which apps should be put together in the same compartment. In addition, users rely on some inter-app collaborations to provide services.\u0000 This paper seeks a practice isolation approach which keeps app usage patterns and mitigates security threats from inter-app communication for apps coexistence. To this end, we introduce association rules to mine practical app usage patterns which users like to put some apps together on the same device and rely on the collaboration between these apps to provide services. In addition, we propose inter-app communication analysis to filter out uninteresting rules. Furthermore, we propose a security compartmentation approach that segregates apps into isolated groups and keeps practical app usage patterns in compartments. The method leverages a risk assessment method which assesses the perils of apps coexistence and conveys compartmentation problem to knapsack problem. Our experiments used 3 classical heuristic algorithms to solve the knapsack problem and discuss how good compartmentation solutions can be obtained.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130625945","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 Semi-Formal Multi-Policy Secure Model for Semantic Spatial Trajectories","authors":"Xingang Wang, Kuo Guo, Zhigang Gai","doi":"10.1145/3058060.3058063","DOIUrl":"https://doi.org/10.1145/3058060.3058063","url":null,"abstract":"With the proliferation of locating devices, more and more raw spatial trajectories are formed, and many works enrich these raw trajectories with semantics, and mine patterns from both raw and semantic trajectories, but access control of spatial trajectories is not considered yet. We present a multi-policy secure model for semantic spatial trajectories. In our model, Mandatory Access Control, Role Based Access Control and Discretionary Access control are all enforced, separately and combined, and we represent the model semi-formally in Web Ontology Language.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345753","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":"Features of the Photon Pulse Detection Algorithm in the Quantum Key Distribution System","authors":"A. Pljonkin","doi":"10.1145/3058060.3058078","DOIUrl":"https://doi.org/10.1145/3058060.3058078","url":null,"abstract":"A two-pass fiber-optic quantum key distribution system with phase-encoded photon states in synchronization mode has been investigated. The possibility of applying the analytical expressions for the calculation of the correct detection probability of the signal time window at synchronization has been proved. A modernized algorithm of photon pulse detection, taking into account the dead time of the single-photon avalanche photodiode was proposed. The method of engineering an optical pulse detection process during the synchronization in a quantum key distribution system has been offered.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115324760","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}
Jianwei Ding, Zhouguo Chen, Yue Zhao, Hong Su, Yubin Guo, Enbo Sun
{"title":"MGeT: Malware Gene-Based Malware Dynamic Analyses","authors":"Jianwei Ding, Zhouguo Chen, Yue Zhao, Hong Su, Yubin Guo, Enbo Sun","doi":"10.1145/3058060.3058065","DOIUrl":"https://doi.org/10.1145/3058060.3058065","url":null,"abstract":"Malware, as a malicious software, or applications or execution codes, has become the centerpiece of most security threats in such a unceasing open Internet environment. The essential technology of malware analysis is to extract the characteristics of malware, intended to supply signatures to detection systems and provide evidence for recovery and cleanup. The focal point in the malware analysis is how to detect malicious behaviors versus how to hide a malware analyzer from malware during runtime. In this paper, we propose an approach called Malware Gene Topology Model (MGeT) inspired by Biotechnological Genomics that can quickly detect potential malware from a large amount of software or execution codes including metamorphic or new variants of malware. Instead of extracting the signatures from the malware in the execution file level or operating system level, we identify the key malicious behaviors of malware by the underlying instructions, named malware Gene. We evaluate our method based on real-world datasets and the results demonstrate the advantages of our method over the previous studies, validating the contribution of our method.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129653801","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":"Logical Language of Certificate-Based Access Control in Security Models","authors":"M. Kucherov, N. Bogulskaya","doi":"10.1145/3058060.3058067","DOIUrl":"https://doi.org/10.1145/3058060.3058067","url":null,"abstract":"Over the last decades, we have seen several policy models, including role-based access control and more recently, certificate-base control. These models are based on the important notion \"flow relation\". In this work, we present a logical language of certificate-based access control. Our model presents the formal method of reasoning for discretionary access and defines logic to express a discretionary policy. We introduce, instead, material implication widely used in mathematics, and we show in a case study its ease in every sense. We find it allows the policy specifications to be interpreted more conveniently by practitioners and implemented in a simple way. Our evaluation shows that policies defined with material implication can be used for creation of the specification of a trust relationships policy and for checking safety of any computer system.","PeriodicalId":152599,"journal":{"name":"International Conference on Cryptography, Security and Privacy","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114206495","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}