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

Sparse subset sum problem from Gentry-Halevi's fully homomorphic encryption Gentry-Halevi全同态加密中的稀疏子集和问题

IET Inf. Secur. Pub Date : 2017-01-16 DOI: 10.1049/iet-ifs.2015.0263

M. Lee

引用次数: 3

Secret key establishment technique using channel state information driven phase randomisation in multiple-input multiple-output orthogonal frequency division multiplexing 多输入多输出正交频分复用中信道状态信息驱动的相位随机化密钥建立技术

IET Inf. Secur. Pub Date : 2017-01-16 DOI: 10.1049/iet-ifs.2014.0530

H. Taha, E. Alsusa

{"title":"Secret key establishment technique using channel state information driven phase randomisation in multiple-input multiple-output orthogonal frequency division multiplexing","authors":"H. Taha, E. Alsusa","doi":"10.1049/iet-ifs.2014.0530","DOIUrl":"https://doi.org/10.1049/iet-ifs.2014.0530","url":null,"abstract":"In wireless communication systems, the conventional secret key exchange is based on the public key cryptography, which requires complex computations to retain the secrecy level of these key bits. The proposed physical layer-based algorithms have shown promising performance to extract secret keys from the privately shared randomness relying on the reciprocal channel state between both communicated nodes. In this study, the authors propose a physical layer key exchange method which transmits the key bits by encoding them within some phase randomisation (PR) sequences that are privately indexed to a specific channel criterion. The PR sequences only randomise the data phases and thus no efficiency reduction will be incurred. In fact, by choosing a pool of randomisation sequences with certain statistical properties, they could also be used to condition the signal to meet physical layer transmission requirements such as bandwidth, envelope and so on. They quantify the potential of the proposed method by demonstrating it within the context of a multiple-input multiple-output orthogonal frequency division multiplexing system. The results reveal that, relative to existing techniques, the proposed method offers superior key error rate performance at lower computational complexity with better secrecy level.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"54 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74025970","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}

引用次数: 6

Improved conditional differential attacks on Grain v1 改进了Grain v1的条件差分攻击

IET Inf. Secur. Pub Date : 2017-01-16 DOI: 10.1049/iet-ifs.2015.0427

Zhen Ma, Tian Tian, Wen-feng Qi

{"title":"Improved conditional differential attacks on Grain v1","authors":"Zhen Ma, Tian Tian, Wen-feng Qi","doi":"10.1049/iet-ifs.2015.0427","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0427","url":null,"abstract":"Conditional differential cryptanalysis on NFSR-based cryptosystems was first proposed by Knellwolf et al. in Asiacrypt 2010 and has been successfully used to attack reduced variants of Grain v1. In this paper, we greatly improve conditional differential attacks on Grain v1 in the following four aspects. First, a new differential engine is derived to correctly track the differential trails of Grain v1. Second, we propose a new difference-searching strategy which serves to find suitable differences for the conditional differential attack on a given reduced variant of Grain v1. Third, a highly IV-saving condition-imposing strategy is presented. Last, we propose a further bias-increasing strategy. In particular, the improvements on the difference-searching strategy and the condition-imposing strategy are crucial to mount conditional differential attacks on the variants of Grain v1 with more than 106 rounds. It is shown that the improved conditional differential attacks could retrieve 31 distinct secret key expressions for 107-round Grain v1 and could retrieve 15 distinct secret key expressions for 110-round Grain v1. Both the attacks succeed with constant probabilities. Thus far, our results are the best known for the reduced variants of Grain v1 as far as the number of rounds attacked is concerned.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"122 1-2 1","pages":"46-53"},"PeriodicalIF":0.0,"publicationDate":"2017-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75614230","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}

引用次数: 14

Public-key infrastructure validation and revocation mechanism suitable for delay/disruption tolerant networks 适用于延迟/中断容忍网络的公钥基础设施验证和撤销机制

IET Inf. Secur. Pub Date : 2017-01-01 DOI: 10.1049/iet-ifs.2015.0438

Muhammad Nasir Mumtaz Bhutta, H. Cruickshank, Zhili Sun

引用次数: 10

Signature-policy attribute-based key-insulated signature 基于签名策略属性的密钥隔离签名

IET Inf. Secur. Pub Date : 2017-01-01 DOI: 10.1049/iet-ifs.2015.0355

Y. S. Rao

引用次数: 2

Versatile virtual honeynet management framework 多功能虚拟蜜网管理框架

IET Inf. Secur. Pub Date : 2017-01-01 DOI: 10.1049/iet-ifs.2015.0256

Wenjun Fan, David Fernández, Zhihui Du

引用次数: 22

Cryptanalysis of McEliece cryptosystem variants based on quasi-cyclic low-density parity check codes 基于准循环低密度奇偶校验码的McEliece密码系统变体密码分析

IET Inf. Secur. Pub Date : 2016-07-01 DOI: 10.1049/iet-ifs.2015.0064

Masoumeh Koochak Shooshtari, M. Ahmadian-Attari, T. Johansson, M. Aref

{"title":"Cryptanalysis of McEliece cryptosystem variants based on quasi-cyclic low-density parity check codes","authors":"Masoumeh Koochak Shooshtari, M. Ahmadian-Attari, T. Johansson, M. Aref","doi":"10.1049/iet-ifs.2015.0064","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0064","url":null,"abstract":"One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification makes such cryptosystems encounter some new attacks. There are a few modified McEliece cryptosystem variants which are known to be secure. One of them is the cryptosystem introduced by Baldi et al. which uses quasi-cyclic low-density parity check (QC-LDPC) codes. This cryptosystem is still unbroken as no efficient attack has been reported against it since 2008. In this study, an attack has been applied to this cryptosystem which is feasible when the code length is a multiple of a power of 2. Also an important weakness of this kind of cryptosystem has been pointed out, namely utilising a too low-weight intentional error vector. The authors have established a new security level for this cryptosystem which is applicable to other McEliece-like cryptosystems using QC-LDPC codes. This security level for instance is 29.18 times lower than previous ones in the case of n = 4 x 4096 when only one ciphertext is available. The gain of the attack in this study can be increased if more than one ciphertext is available.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"37 1","pages":"194-202"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78708835","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}

引用次数: 18

Effective certificate revocation scheme based on weighted voting game approach 基于加权投票博弈方法的有效证书撤销方案

IET Inf. Secur. Pub Date : 2016-07-01 DOI: 10.1049/iet-ifs.2015.0047

Sungwook Kim

引用次数: 18

Privacy failure in the public-key distance-bounding protocols 公钥距离绑定协议中的隐私失败

IET Inf. Secur. Pub Date : 2016-07-01 DOI: 10.1049/iet-ifs.2014.0616

S. Vaudenay

引用次数: 3

Leakage-resilient message authentication code scheme based on hidden identity weak hash proof system 基于隐藏身份弱哈希证明系统的防泄漏消息认证码方案

IET Inf. Secur. Pub Date : 2016-07-01 DOI: 10.1049/iet-ifs.2014.0579

Bin Wang

引用次数: 4