IET Inf. Secur.最新文献_第9页

Multidimensional zero-correlation linear cryptanalysis of the block cipher KASUMI 分组密码KASUMI的多维零相关线性密码分析

IET Inf. Secur. Pub Date : 2014-04-24 DOI: 10.1049/IET-IFS.2014.0543

Wentan Yi, Shaozhen Chen

引用次数: 19

uCloud: a user-centric key management scheme for cloud data protection uCloud:以用户为中心的云数据保护密钥管理方案

IET Inf. Secur. Pub Date : 2013-06-20 DOI: 10.1049/iet-ifs.2012.0198

Yung-Wei Kao, Kuan-Ying Huang, Hui-Zhen Gu, S. Yuan

{"title":"uCloud: a user-centric key management scheme for cloud data protection","authors":"Yung-Wei Kao, Kuan-Ying Huang, Hui-Zhen Gu, S. Yuan","doi":"10.1049/iet-ifs.2012.0198","DOIUrl":"https://doi.org/10.1049/iet-ifs.2012.0198","url":null,"abstract":"One of the most challenging problems of cloud service solicitation is to persuade users to trust the security of cloud service and upload their sensitive data. Although cloud service providers can claim that their services are well-protected by elaborate encryption mechanisms, traditional cloud systems still cannot persuade the users that even if the cloud servers are compromised, the data are still securely protected. This study proposes uCloud, a user-centric key management scheme for cloud data protection, to solve this problem. uCloud utilises RSA and indirectly encrypts users' data by users' public keys, but stores the users' private keys on neither servers nor users' PCs; instead, the private keys are stored on users' mobile devices and presented via two-dimensional (2D) barcode images when they are utilised to decrypt users' sensitive data. In this manner, users' data are safely protected even if the cloud servers are compromised. Also, uCloud provides users with the experience of managing visible private keys by storing the keys into mobile phones and displaying them via 2D barcodes. Moreover, three scenarios: personal storage, home surveillance and enterprise storage scenarios are proposed to present the practicability of uCloud. In addition, a hierarchical structure is designed for basic key backup and data sharing in the proposed scheme.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"43 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89810786","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}

引用次数: 29

Oblivious decision program evaluation 遗忘决策程序评价

IET Inf. Secur. Pub Date : 2013-06-20 DOI: 10.1049/iet-ifs.2012.0032

Salman Niksefat, B. Sadeghiyan, Payman Mohassel

{"title":"Oblivious decision program evaluation","authors":"Salman Niksefat, B. Sadeghiyan, Payman Mohassel","doi":"10.1049/iet-ifs.2012.0032","DOIUrl":"https://doi.org/10.1049/iet-ifs.2012.0032","url":null,"abstract":"In this study, the authors design efficient protocols for a number of `oblivious decision program (DP) evaluation' problems. Consider a general form of the problem where a client who holds a private input interacts with a server who holds a private DP (e.g. a decision tree or a branching program) with the goal of evaluating his input on the DP without learning any additional information. Many known private database query problems such as symmetric private information retrieval and private keyword search can be formulated as special cases of this problem. Most of the existing works on the same problem focus on optimising communication. However, in some environments (supported by a few experimental studies), it is the computation and not the communication that may be the performance bottleneck. In this study, we design `computationally efficient' protocols for the above general problem, and a few of its special cases. In addition to being one-round and requiring a small amount of work by the client (in the RAM model), the proposed protocols only require a small number of exponentiations (independent of the server's input) by both parties. The proposed constructions are, in essence, efficient and black-box reductions of the above problem to 1-out-of-2 oblivious transfer. It is proved that the proposed protocols secure (private) against `malicious' adversaries in the standard ideal/real-world simulation-based paradigm.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78077689","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

On the approximation of S-boxes via Maiorana-McFarland functions 用Maiorana-McFarland函数逼近s -box

IET Inf. Secur. Pub Date : 2013-06-01 DOI: 10.1049/iet-ifs.2012.0169

Yongzhuang Wei, E. Pasalic

{"title":"On the approximation of S-boxes via Maiorana-McFarland functions","authors":"Yongzhuang Wei, E. Pasalic","doi":"10.1049/iet-ifs.2012.0169","DOIUrl":"https://doi.org/10.1049/iet-ifs.2012.0169","url":null,"abstract":"Substitution boxes (S-boxes) are the key components of conventional cryptographic systems. To quantify the confusion property of S-boxes, different non-linearity criteria are proposed such as usual non-linearity (NF ), unrestricted non-linearity (UN F ), generalised non-linearity (GN F ), higher order non-linearity (HN F ) and so on. Although these different criteria come from the idea of linear (or non-linear) approximation of S-boxes, the algebraic structures of Boolean functions that are used to approximate to S-boxes have not been considered yet. In this study, the concept of the extended non-linearity of S-boxes (denoted by EN F ) is introduced by measuring the distance of a given function to a subset of Maiorana–McFarland functions. This approximation appears to be appealing because of a particular structure of this class of functions, namely their representation as a concatenation of affine functions. The complexity of computing the rth order extended non-linearity for S-boxes over GF(2) n is less than O(( n r )2 n−r ), (r > 1). Moreover, a theoretical upper bound for the rth order extended non-linearity is proved, which is much lower than previous generalised non-linearity which might give a rise to more efficient attacks that combine a generalised correlation approach with guess and determine techniques. Furthermore, the relationship between the r-order extended non-linearity and the generalised non-linearity is derived.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89960106","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

Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t GF(2m)上具有奇数型t的高斯正态基乘法器的似回文表示

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2012.0200

C. Chiou, Tai-Pao Chuang, Shun-Shii Lin, Chiou-Yng Lee, Jim-Min Lin, Yun-Chi Yeh

引用次数: 6

Dynamic and secure key management model for hierarchical heterogeneous sensor networks 分层异构传感器网络的动态安全密钥管理模型

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2012.0144

Mahdi R. Alaghband, M. Aref

{"title":"Dynamic and secure key management model for hierarchical heterogeneous sensor networks","authors":"Mahdi R. Alaghband, M. Aref","doi":"10.1049/iet-ifs.2012.0144","DOIUrl":"https://doi.org/10.1049/iet-ifs.2012.0144","url":null,"abstract":"Many applications that utilise wireless sensor networks (WSNs) require essentially secure communication. However, WSNs suffer from some inherent weaknesses because of restricted communication and hardware capabilities. Key management is the crucial important building block for all security goals in WSNs. Most existing researches tried to assign keys assuming homogeneous network architecture. Recently, a few key management models for heterogeneous WSNs have been proposed. In this study, the authors propose a dynamic key management framework based on elliptical curve cryptography and signcryption method for heterogeneous WSNs. The proposed scheme has network scalability and sensor node (SN) mobility especially in liquid environments. Moreover, both periodic authentication and a new registration mechanism are proposed through prevention of SN compromise. The authors analyse some of the more seminal hierarchical heterogeneous WSN key management schemes and compare them with the proposed scheme. On comparing the proposed scheme with the more seminal hierarchical heterogeneous WSN key management schemes, the proposed framework individually proves to be better in terms of communication, computation and key storage.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"37 1","pages":"271-280"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87966429","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}

引用次数: 66

Critical survey of existing publicly verifiable secret sharing schemes 对现有可公开验证的秘密共享方案的关键调查

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2011.0201

Kun Peng

引用次数: 13

Low-complexity Gaussian normal basis multiplier over GF(2m) GF(2m)上的低复杂度高斯正态基乘法器

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2012.0110

C. Chiou, H. Chang, Wen-Yew Liang, Chiou-Yng Lee, Jim-Min Lin, Yun-Chi Yeh

引用次数: 16

Analytical framework for measuring network security using exploit dependency graph 基于漏洞依赖图的网络安全度量分析框架

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2011.0103

P. Bhattacharya, S. K. Ghosh

{"title":"Analytical framework for measuring network security using exploit dependency graph","authors":"P. Bhattacharya, S. K. Ghosh","doi":"10.1049/iet-ifs.2011.0103","DOIUrl":"https://doi.org/10.1049/iet-ifs.2011.0103","url":null,"abstract":"Attack graph is a popular tool for modelling multi-staged, correlated attacks on computer networks. Attack graphs have been widely used for measuring network security risks. Majority of the works on attack graph use host-based or state-based approaches. These attack graph models are either too restrictive or too resource consuming. Also, a significant portion of these works have used ‘probability of successfully exploiting a network’ as the metric. This approach requires that the ‘probability of successfully exploiting individual vulnerabilities’ be known a priori. Finding such probabilities is inherently difficult. This present study uses exploit dependency graph, which is a space efficient and expressive attack graph model. It also associates an additive cost with executing individual exploits, and defines a security metric in terms of the ‘minimum cost required to successfully exploit the network’. The problem of calculating the said metric is proved to be NP-complete. A modified depth first branch and bound algorithm has been described for calculating it. This study also formulates, a linear-time computable, security metric in terms of the ‘expected cost required to successfully exploit the network’ assuming a random attacker model and an uncorrelated attack graph.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"102 1","pages":"264-270"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79572828","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}

引用次数: 12

Low-complexity design of bit-parallel dual-basis multiplier over GF(2m) GF(2m)上位并行双基乘法器的低复杂度设计

IET Inf. Secur. Pub Date : 2012-12-01 DOI: 10.1049/iet-ifs.2012.0210

Jenq-Haur Wang, H. Chang, C. Chiou, Wen-Yew Liang

引用次数: 8