ISC Int. J. Inf. Secur.最新文献_第6页

Face Recognition Based Rank Reduction SVD Approach 基于秩降SVD的人脸识别方法

ISC Int. J. Inf. Secur. Pub Date : 2019-07-01 DOI: 10.22042/ISECURE.2019.11.0.6

Omed Hassan Ahmed, Joan Lu, Qiang Xu, M. Al-Ani

{"title":"Face Recognition Based Rank Reduction SVD Approach","authors":"Omed Hassan Ahmed, Joan Lu, Qiang Xu, M. Al-Ani","doi":"10.22042/ISECURE.2019.11.0.6","DOIUrl":"https://doi.org/10.22042/ISECURE.2019.11.0.6","url":null,"abstract":"Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many techniques to generate efficient recognition results. The implemented facerecognition approach is concentrated on obtaining significant rank matrix via applying a singular value decomposition technique. Measures of dispersion are used to indicate the distribution of data. According to the applied ranks, thereis an adequate reasonable rank that is important to reach via the implemented procedure. Interquartile range, mean absolute deviation, range, variance, and standard deviation are applied to select the appropriate rank. Rank 24, 12, and 6reached an excellent 100% recognition rate with data reduction up to 2 : 1, 4 : 1 and 8 : 1 respectively. In addition, properly selecting the adequate rank matrix is achieved based on the dispersion measures. Obtained results on standard face databases verify the efficiency and effectiveness of the implemented approach.","PeriodicalId":436674,"journal":{"name":"ISC Int. J. Inf. Secur.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129092","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}

引用次数: 2

Evaluation of Planet Factors of Smart City through Multi-layer Fuzzy Logic (MFL) 基于多层模糊逻辑(MFL)的智慧城市行星因子评价

ISC Int. J. Inf. Secur. Pub Date : 2019-07-01 DOI: 10.22042/ISECURE.2019.11.0.7

A. Fatima, Muhammad Adnan Khan, Sagheer Abbas, M. Waqas, Leena Anum, Muhammad Asif

引用次数: 36

New Fixed Point Attacks on GOST2 Block Cipher GOST2分组密码的新定点攻击

ISC Int. J. Inf. Secur. Pub Date : 2019-06-26 DOI: 10.22042/ISECURE.2019.140663.424

S. Ahmadi, M. Aref

引用次数: 0

Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity 具有实际数据复杂度的分组密码LBlock和TWINE-80的双列密码分析

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2018.138036.420

S. Ahmadi, Z. Ahmadian, J. Mohajeri, M. Aref

{"title":"Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity","authors":"S. Ahmadi, Z. Ahmadian, J. Mohajeri, M. Aref","doi":"10.22042/ISECURE.2018.138036.420","DOIUrl":"https://doi.org/10.22042/ISECURE.2018.138036.420","url":null,"abstract":"In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amount of this complexity the same and reduce the data complexity enormously by a shorter biclique. With this approach, we analysed full-round of LBlock, and also LBlock with modified key schedule (which was designed to resist biclique attack) both with data complexity 2^12, while the data complexity of the best biclique attack on the former was 2^52 and for the latter there is no attack on the full-round cipher, so far. Then we proposed a new key schedule that is more resistant against biclique cryptanalysis, though the low diffusion of the cipher makes it vulnerable to this attack regardless of the strength of the key schedule. Also using this method, we analyzed TWINE-80 with 2^12 data complexity. The lowest data complexity for the prior attack on the TWINE-80 was 2^60. In all the attacks presented in this paper, the computational complexities are slightly improved in comparison to the existing attacks.","PeriodicalId":436674,"journal":{"name":"ISC Int. J. Inf. Secur.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131426437","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}

引用次数: 1

SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing SESOS:云计算中有序结构化数据的可验证搜索外包方案

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2019.148637.430

Javad Ghareh Chamani, Mohammad Sadeq Dousti, R. Jalili, D. Papadopoulos

{"title":"SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing","authors":"Javad Ghareh Chamani, Mohammad Sadeq Dousti, R. Jalili, D. Papadopoulos","doi":"10.22042/ISECURE.2019.148637.430","DOIUrl":"https://doi.org/10.22042/ISECURE.2019.148637.430","url":null,"abstract":"While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable solution for practical purposes. The next best thing is to craft special-purpose cryptosystems which support the set of operations required to be addressed by cloud services. In this paper, we put forward one such cryptosystem, which supports efficient search over structured data types, such as timestamps or network addresses, which are comprised of several segments with well-known values. The new cryptosystem, called SESOS, provides the ability to execute LIKE queries, along with the search for exact matches, as well as comparison. In addition, the extended version, called XSESOS, allows for verifying the integrity of ciphertexts. At its heart, SESOS combines any order-preserving encryption (OPE) scheme with a novel encryption scheme called Multi-map Perfectly Secure Cryptosystem(MuPS). We prove that MuPS is perfectly secure, and hence SESOS enjoys the same security properties of the underlying OPE scheme. The overhead of executing equality and comparison operations is negligible. The performance of LIKE queries is significantly improved by up to 1370X and the performance of result decryption improved by 520X compared to existing solutions on a database with merely 100K records (the improvement is even more significant in larger databases).","PeriodicalId":436674,"journal":{"name":"ISC Int. J. Inf. Secur.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129919910","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}

引用次数: 0

Secure FPGA Design by Filling Unused Spaces 通过填充未使用的空间来安全FPGA设计

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2019.143657.427

Mansoureh Labbafniya, R. Saeidi

引用次数: 3

Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives 面向硬件的加密原语的轻量级4x4 MDS矩阵

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2018.138301.421

A. M. Rishakani, M. R. M. Shamsabad, S. M. Dehnavi, M. Amiri, H. Maimani, N. Bagheri

引用次数: 0

A Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing 基于信任的数据库外包高效正确性验证概率方法

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2018.141655.426

Simin Ghasemi, M. A. Hadavi, Mina Niknafs

引用次数: 0

A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices 理想格上基于环的SPHF和PAKE新协议

ISC Int. J. Inf. Secur. Pub Date : 2019-01-30 DOI: 10.22042/ISECURE.2018.109810.398

R. E. Atani, S. E. Atani, A. Karbasi

引用次数: 5

Enforcing RBAC Policies over Data Stored on Untrusted Server (Extended Version) 对存储在不受信任服务器上的数据执行RBAC策略(扩展版本)

ISC Int. J. Inf. Secur. Pub Date : 2018-07-15 DOI: 10.22042/ISECURE.2018.126294.414

Naeimeh Soltani, Ramin Bohlooli, R. Jalili

{"title":"Enforcing RBAC Policies over Data Stored on Untrusted Server (Extended Version)","authors":"Naeimeh Soltani, Ramin Bohlooli, R. Jalili","doi":"10.22042/ISECURE.2018.126294.414","DOIUrl":"https://doi.org/10.22042/ISECURE.2018.126294.414","url":null,"abstract":"One of the security issues in data outsourcing is the enforcement of the data owner’s access control policies. This includes some challenges. The first challenge is preserving confidentiality of data and policies. One of the existing solutions is encrypting data before outsourcing which brings new challenges; namely, the number of keys required to access authorized resources, efficient policy updating, write access control enforcement, overhead of accessing/processing data at the user/owner side. Most of the existing solutions address only some of the challenges, while imposing high overhead on both owner and users. Though, policy management in the Role-Based Access Control (RBAC) model is easier and more efficient due to the existence of role hierarchical structure and role inheritance; most of the existing solutions address only enforcement of policies in the form of access control matrix. In this paper, we propose an approach to enforce RBAC policies on encrypted data outsourced to a service provider. We utilize Chinese Remainder Theorem for key management and role/permission assignment. Efficient user revocation, efficient role hierarchical structure updating, availability of authorized resources for users of new roles, and enforcement of write access control policies as well as static separation of duties, are of advantages of the proposed solution.","PeriodicalId":436674,"journal":{"name":"ISC Int. J. Inf. Secur.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126506908","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}

引用次数: 0