IET Information Security最新文献_第6页

A Secure Anonymous Identity-Based Virtual-Space Agreement Method for Crowds-Based Anonymous Communicate Scheme 基于匿名身份的安全匿名虚拟空间协议方法，适用于基于人群的匿名通信计划

IF 1.4 4区计算机科学

IET Information Security Pub Date : 2023-12-18 DOI: 10.1049/2023/8234537

Kai Lin, Kaiyu Wang, Jin Shang, Qindong Sun

{"title":"A Secure Anonymous Identity-Based Virtual-Space Agreement Method for Crowds-Based Anonymous Communicate Scheme","authors":"Kai Lin, Kaiyu Wang, Jin Shang, Qindong Sun","doi":"10.1049/2023/8234537","DOIUrl":"https://doi.org/10.1049/2023/8234537","url":null,"abstract":"Anonymous data exchange is in great demand in many situations, especially in remote control systems, in which a stable, secure, and secret data channel must be established between the controlling and controlled parties to distribute control commands and return data. In the previous work, we built a two-level Virtual-Space anonymous communication scheme based on the Crowds System for performing secret data exchange in remote control systems. However, as an essential part of security and anonymity, participating nodes’ identity declaration and session key agreement phases were not well designed. In this paper, we redesign the identity agreement and declaration process and design an identity-based Virtual-Space agreement method using the extended Chebyshev Chaotic Maps. In this approach, we transform the identity declaration process into a multilevel Virtual-Space agreement problem, where a series of security-progressive Virtual-Space addresses are negotiated between the controller and the controlled nodes. The protocol can handle the case where there are multiple controllers in the system, and the negotiated Virtual-Space depends on the identity of the controller and the controlled node, so different controllers do not affect each other. The designed protocol is verified on Freenet, and we conclude this paper with a detailed security analysis of the method to prove that the method satisfies forward security.","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"64 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138995363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Similarity Property and Slide Attack of Block Cipher FESH 区块密码 FESH 的相似性和滑动攻击

IF 1.4 4区计算机科学

IET Information Security Pub Date : 2023-12-14 DOI: 10.1049/2023/7171600

Yafei Zheng, Wenling Wu

引用次数: 0

Improving the Performance of CPA Attacks for Ciphers Using Parallel Implementation of S-Boxes 利用并行 S 盒提高密码的 CPA 攻击性能

IF 1.4 4区计算机科学

IET Information Security Pub Date : 2023-12-12 DOI: 10.1049/2023/6653956

Fu Yao, Yongzhuang Wei, Hua Chen, E. Pasalic

{"title":"Improving the Performance of CPA Attacks for Ciphers Using Parallel Implementation of S-Boxes","authors":"Fu Yao, Yongzhuang Wei, Hua Chen, E. Pasalic","doi":"10.1049/2023/6653956","DOIUrl":"https://doi.org/10.1049/2023/6653956","url":null,"abstract":"Since their introduction in early 2000, CPA (correlation power analysis), as a cryptographic tool, has been widely used in the cryptanalysis of cryptographic algorithms (being applicable to both symmetric key ciphers as well as to public key encryption schemes). An application of the classical CPA method, along with its variants, to cryptographic algorithms that use parallel implementation of its substitution boxes (S-boxes) commonly requires more power traces to extract the secret key compared to the case when serial implementation of S-boxes is employed. To reduce the amount of power traces in this scenario, we propose a modification of the standard CPA approaches and demonstrate practically that our method performs better than the existing ones in this respect. To verify the efficiency of our improved CPA method, we apply it to the public databases of DPA Contest V2. In particular, the experimental results show that only 495 power traces are required to recover the secret key of AES. We also compare the performance of our attack to the relevant methods whose parameters are available at DPA Contest V2. The results show that compared to the best nonprofiling side-channel attack (SCA) attack, our method reduces the number of power traces required to recover the secret key by 6,566. Also, our new method performs almost similarly as the best profiling SCA attack of Benoit Gerard (in terms of the required number of power traces), thus reducing the gap in the performance of profiling and nonprofiling SCA attacks.","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"8 6","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139007622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SAT-Based Security Evaluation for WARP against Linear Cryptanalysis 针对线性密码分析的基于 SAT 的 WARP 安全性评估

IF 1.4 4区计算机科学

IET Information Security Pub Date : 2023-12-06 DOI: 10.1049/2023/5323380

Jiali Shi, Guoqiang Liu, Chao Li

{"title":"SAT-Based Security Evaluation for WARP against Linear Cryptanalysis","authors":"Jiali Shi, Guoqiang Liu, Chao Li","doi":"10.1049/2023/5323380","DOIUrl":"https://doi.org/10.1049/2023/5323380","url":null,"abstract":"WARP, an efficient lightweight block cipher presented by Banik et al., offers a viable alternative to AES with its 128-bit block and a 128-bit key. It adopts a 32-nibble type-II generalized Feistel network (GFN) structure, incorporating a nibble permutation optimized for both security and efficiency. Notably, WARP has achieved the lowest hardware implementation among 128-bit block ciphers. Its bit-serial encryption-only circuit is only 763 gate equivalents (GEs). Consequently, WARP has received significant attention since its inception. The designers evaluated the number of active Sboxes for linear trails in WARP to establish its security. To further investigate WARP’s resistance against linear attacks, we employed an automated model to analyze the optimal linear trails/hulls of WARP. To achieve this, the problem will be transformed into a Boolean satisfiability problem (SAT). The constraints in conjunctive normal form (CNF) are used to describe the mask propagation of WARP and invoke the SAT solver to find valid solutions. The results allowed us to obtain the optimal correlation of the initial 21-round linear trails for WARP. Furthermore, by enumerating the linear trails within a linear hull, the distribution of linear trails is revealed, and the probability of the linear hull is improved to be more accurate. This work extends the linear distinguisher from 18 to 21 rounds. Additionally, the first independent analysis of WARP’s linear properties is presented, offering a more precise evaluation of its resistance against linear cryptanalysis.","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"23 3","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138596857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Differential, Linear, and Meet-in-the-Middle Attacks on the Lightweight Block Cipher RBFK 对轻量级区块密码 RBFK 的差分、线性和中间人攻击

IF 1.4 4区计算机科学

IET Information Security Pub Date : 2023-11-23 DOI: 10.1049/2023/6691726

Sugio Nobuyuki

{"title":"Differential, Linear, and Meet-in-the-Middle Attacks on the Lightweight Block Cipher RBFK","authors":"Sugio Nobuyuki","doi":"10.1049/2023/6691726","DOIUrl":"https://doi.org/10.1049/2023/6691726","url":null,"abstract":"Randomized butterfly architecture of fast Fourier transform for key cipher (RBFK) is the lightweight block cipher for Internet of things devices in an edge computing environment. Although the authors claimed that RBFK is secure against differential cryptanalysis, linear cryptanalysis, impossible differential attack, and zero correlation linear cryptanalysis, the details were not explained in the literature. Therefore, we have evaluated the security of RBFK by application of differential cryptanalysis, linear cryptanalysis, and meet-in-the-middle (MITM) attack and have found that RBFK is not secure against these attacks. This paper introduces not only a distinguish attack but also key recovery attacks on full-round RBFK. In the distinguish attack scenario, data for differential cryptanalysis are two, and the time complexity is one for an exclusive-OR operation. In the key recovery attack scenario, the data for linear cryptanalysis are one pair of known plaintext–ciphertext. The time complexity is one operation for a linear sum. Data for an MITM attack are two. The time complexity is 2 48 encryptions; the memory complexity is 2 45 bytes. Because the vulnerabilities are identified in the round function and the key scheduling part, we propose some improvements for RBFK against these attacks.","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"130 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139244466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Generic Construction of Fully Anonymous Broadcast Authenticated Encryption with Keyword Search with Adaptive Corruptions 具有自适应损坏的关键字搜索的完全匿名广播认证加密的一般构造

4区计算机科学

IET Information Security Pub Date : 2023-11-07 DOI: 10.1049/2023/9922828

Keita Emura

引用次数: 1

Inner-Product Matchmaking Encryption: Bilateral Access Control and Beyond Equality 产品内部匹配加密:双边访问控制和超越平等

4区计算机科学

IET Information Security Pub Date : 2023-11-02 DOI: 10.1049/2023/8829580

Qiaohan Chu, Anmin Fu, Haifeng Qian, Jie Chen

引用次数: 0

A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme 一个可公开验证的水平全同态签名加密方案

4区计算机科学

IET Information Security Pub Date : 2023-10-31 DOI: 10.1049/2023/1377042

Zhaoxuan Bian, Fuqun Wang, Renjun Zhang, Bin Lian, Lidong Han, Kefei Chen

引用次数: 0

Kyber, Saber, and SK-MLWR Lattice-Based Key Encapsulation Mechanisms Model Checking with Maude Kyber, Saber和SK-MLWR基于格子的密钥封装机制模型检查与Maude

4区计算机科学

IET Information Security Pub Date : 2023-10-30 DOI: 10.1049/2023/9399887

Duong Dinh Tran, Kazuhiro Ogata, Santiago Escobar, Sedat Akleylek, Ayoub Otmani

{"title":"Kyber, Saber, and SK-MLWR Lattice-Based Key Encapsulation Mechanisms Model Checking with Maude","authors":"Duong Dinh Tran, Kazuhiro Ogata, Santiago Escobar, Sedat Akleylek, Ayoub Otmani","doi":"10.1049/2023/9399887","DOIUrl":"https://doi.org/10.1049/2023/9399887","url":null,"abstract":"Facing the potential threat raised by quantum computing, a great deal of research from many groups and industrial giants has gone into building public-key post-quantum cryptographic primitives that are resistant to the quantum attackers. Among them, there is a large number of post-quantum key encapsulation mechanisms (KEMs), whose purpose is to provide a secure key exchange, which is a very crucial component in public-key cryptography. This paper presents a formal security analysis of three lattice-based KEMs including Kyber, Saber, and SK-MLWR. We use Maude, a specification language supporting equational and rewriting logic and a high-performance tool equipped with many advanced features, such as a reachability analyzer that can be used as a model checker for invariant properties, to model the three KEMs as state machines. Because they all belong to the class of lattice-based KEMs, they share many common parts in their designs, such as polynomials, vectors, and message exchange patterns. We first model these common parts and combine them into a specification, called base specification. After that, for each of the three KEMs, by extending the base specification, we just need to model some additional parts and the mechanism execution. Once completing the three specifications, we conduct invariant model checkings with the Maude search command, pointing out a similar man-in-the-middle attack. The occurrence of this attack is due to the fact that authentication is not part of the KEMs, and therefore an active attacker can modify all communication between two honest parties.","PeriodicalId":50380,"journal":{"name":"IET Information Security","volume":"64 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136019437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Bit-Sliced Implementation of SM4 and New Performance Records SM4的位切片实现和新的性能记录

4区计算机科学

IET Information Security Pub Date : 2023-10-27 DOI: 10.1049/2023/1821499

Xin Miao, Lu Li, Chun Guo, Meiqin Wang, Weijia Wang

引用次数: 0