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

Privacy of a randomised skip lists-based protocol 基于随机跳表协议的隐私性

IET Inf. Secur. Pub Date : 2015-02-09 DOI: 10.1049/iet-ifs.2014.0287

Zhuohua Liu, Chuankun Wu

引用次数: 0

Proof of retrievability with public verifiability resilient against related-key attacks 具有公共可验证性的可检索性证明，可抵御相关密钥攻击

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0322

Hui Cui, Y. Mu, M. Au

{"title":"Proof of retrievability with public verifiability resilient against related-key attacks","authors":"Hui Cui, Y. Mu, M. Au","doi":"10.1049/iet-ifs.2013.0322","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0322","url":null,"abstract":"Modern technologies such as cloud computing, grid computing and software as a service all require data to be stored by the third parties. A specific problem encountered in this context is to convince a verifier that a user's data are kept intact at the storage servers. An important approach to achieve this goal is called proof of retrievability, by which a storage server can assure a verifier via a concise proof that a user's file is available. However, for most publicly verifiable systems, existing proof of retrievability solutions do not take physical attacks into consideration, where an adversary can observe the outcome of the computation with methods like fault injection techniques. In fact, the authors find that giving the adversary the ability to obtain the information about the relations between the private keys, those systems are not secure anymore. Motivated by the need of preventing this kind of attacks, they present the security model for related-key attacks in publicly verifiable proofs of retrievability, where the adversary can subsequently observe the outcome of the publicly verifiable proof of retrievability under the modified key. After pointing out a linear related-key attack on an existing proof of retrievability system with public verifiability, they present a secure and efficient proof of retrievability with public verifiability, against related-key attacks.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"1 1","pages":"43-49"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84575803","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}

引用次数: 16

Parallel key management scheme for mobile ad hoc network based on traffic mining 基于流量挖掘的移动自组网并行密钥管理方案

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0076

R. Lakshmi, A. V. A. Kumar

{"title":"Parallel key management scheme for mobile ad hoc network based on traffic mining","authors":"R. Lakshmi, A. V. A. Kumar","doi":"10.1049/iet-ifs.2013.0076","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0076","url":null,"abstract":"One of the main challenges in the mobile ad hoc network is to ensure secure communication, because of its dynamic topology and lack of centralised control. In this study, the authors propose a parallel key management scheme which combines the cluster-based key management and the partially distributed key management approach. The network is partitioned into clusters, where the cluster head (CH) plays the role of certification authority. The initial public key of each member is assigned by CH based on its identity (ID). The keys are updated periodically based on the node's ID and its trust value. The secret key of the node is generated by n key serving nodes, elected based on the trust value. The communication between the nodes is carried out by using the session key generated mainly based on the frequent traffic pattern exists between the nodes. The frequent traffic pattern is identified by mining the past network traffic data by using the backtracking search algorithm. The proposed scheme provides a mechanism for key generation, distribution and revocation. This scheme satisfies all security requirements and ensures forward and backward secrecies. The performance of the proposed scheme is evaluated by simulation.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"34 1","pages":"14-23"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76663928","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}

引用次数: 5

Efficient chosen-ciphertext secure public-key encryption scheme with high leakage-resilience 具有高防泄漏能力的高效选择密文安全公钥加密方案

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0173

Baodong Qin, Shengli Liu, Kefei Chen

{"title":"Efficient chosen-ciphertext secure public-key encryption scheme with high leakage-resilience","authors":"Baodong Qin, Shengli Liu, Kefei Chen","doi":"10.1049/iet-ifs.2013.0173","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0173","url":null,"abstract":"A leakage-resilient public-key encryption (PKE) scheme provides security even if an adversary obtains some information on the secret key. In recent years, much attention has been focused on designing provably secure PKE in the presence of key-leakage and almost all the constructions rely on an important building block namely hash proof system (HPS). However, in the setting of adaptive chosen-ciphertext attacks (CCA2), there are not many HPS-based leakage-resilient PKE schemes available. Moreover, most of them have an unsatisfactory leakage rate. In this study, the authors propose a new method of constructing leakage-resilient CCA2-secure PKE scheme from any tag-based strongly universal 2 HPS. The striking advantage of the authors scheme is the leakage rate, which is the best one among all known HPS-based indistinguishability key leakage CCA2-secure constructions. In particular, they present an instantiation under the n -linear assumption. In the cases of n = 1 (resp. n = 2), they actually obtain a decisional Diffie-Hellman (DDH)-based [resp. decisional linear (DLIN)-based] PKE scheme, where the leakage rate can be made to 1/4 (resp. 1/6). The authors DDH-based scheme achieves the best leakage rate among all known DDH-based (Cramer-Shoup-type) schemes. Their DLIN-based scheme is the first one that can achieve leakage of L /6 bits without pairing, where L is the length of the secret key.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"34 1","pages":"32-42"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78357546","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}

引用次数: 27

PESCA: a peer-to-peer social network architecture with privacy-enabled social communication and data availability PESCA:一个点对点的社交网络架构，具有支持隐私的社交通信和数据可用性

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0256

F. Raji, M. D. Jazi, A. Miri

{"title":"PESCA: a peer-to-peer social network architecture with privacy-enabled social communication and data availability","authors":"F. Raji, M. D. Jazi, A. Miri","doi":"10.1049/iet-ifs.2013.0256","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0256","url":null,"abstract":"The major challenge in current online social networks (OSNs) is privacy violation by OSN providers or unauthorised users. OSN providers collect unprecedented amounts of personal information for targeted advertising. Moreover, users are not able to share their social data with their friends with complete access control. Peer-to-peer (P2P) infrastructure is an interesting solution for a big-brother-free alternative to current OSN designs. However, the fundamental nature of P2P systems has dynamic peer turn-over which results in data unavailability. Additionally, users’ data must be available in the OSN when authorised data audiences want to access them. For these reasons, we propose a P2P-OSN architecture which is composed of a privacy enabled setup for users’ social communications and an adaptive replica placement strategy for ensuring availability for users’ shared data. The proposed framework correlates the availability of shared content in the P2P-OSN to the access control assigned to them. Our evaluations show the proposed P2P-OSN has considerable improvements in providing data privacy and availability compared with the existing approaches.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"130 1","pages":"73-80"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89222742","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}

引用次数: 9

Ensemble detection model for profile injection attacks in collaborative recommender systems based on BP neural network 基于BP神经网络的协同推荐系统配置文件注入攻击的集成检测模型

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0145

Fuzhi Zhang, Quanqiang Zhou

引用次数: 22

Efficient abuse-free fair contract-signing protocol based on an ordinary crisp commitment scheme 有效的无滥用的公平合同签署协议，基于一个普通的脆承诺方案

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2012.0277

Alawi A. Al-saggaf, L. Ghouti

引用次数: 6

Approaching secure industrial control systems 接近安全工业控制系统

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0159

R. Leszczyna

引用次数: 14

Transferable conditional e-cash with optimal anonymity in the standard model 标准模型中具有最优匿名性的可转让条件电子现金

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0138

Jiangxiao Zhang, Hua Guo, Zhoujun Li, Chang Xu

{"title":"Transferable conditional e-cash with optimal anonymity in the standard model","authors":"Jiangxiao Zhang, Hua Guo, Zhoujun Li, Chang Xu","doi":"10.1049/iet-ifs.2013.0138","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0138","url":null,"abstract":"Transferable conditional electronic-cash (e-cash) allows the recipient of a coin in a transaction to transfer it in a later payment transaction to the third person based on the outcome not known in advance. Anonymity is a very important property for a transferable conditional e-cash. However, none of the existed transferable conditional e-cash achieve the optimal anonymity because of its special structure, that is, introducing transferability in the conditional e-cash. In this study, they novelly present a transferable conditional e-cash scheme using a totally different structure, that is, adding condition into the transferable e-cash. Thanks to employing Groth–Sahai proofs systems and commuting signatures, the new transferable conditional e-cash satisfies optimal anonymity. Accordingly, they present an extended security model by introducing a publisher who is responsible for publishing two outcomes of a condition. Then, they prove the new scheme's security in the standard model. Compared with the existing transferable conditional e-cash, the efficiency of the new scheme is also improved since the size of the computation and communication is constant.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"63 1","pages":"59-72"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81716576","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

Sophisticated security verification on routing repaired balanced cell-based dual-rail logic against side channel analysis 基于侧通道分析的路由修复平衡单元双轨逻辑的复杂安全性验证

IET Inf. Secur. Pub Date : 2015-01-01 DOI: 10.1049/iet-ifs.2013.0058

W. He, S. Bhasin, A. Otero, T. Graba, E. D. L. Torre, J. Danger

{"title":"Sophisticated security verification on routing repaired balanced cell-based dual-rail logic against side channel analysis","authors":"W. He, S. Bhasin, A. Otero, T. Graba, E. D. L. Torre, J. Danger","doi":"10.1049/iet-ifs.2013.0058","DOIUrl":"https://doi.org/10.1049/iet-ifs.2013.0058","url":null,"abstract":"Conventional dual-rail precharge logic suffers from difficult implementations of dual-rail structure for obtaining strict compensation between the counterpart rails. As a light-weight and high-speed dual-rail style, balanced cell-based dual-rail logic (BCDL) uses synchronised compound gates with global precharge signal to provide high resistance against differential power or electromagnetic analyses. BCDL can be realised from generic field programmable gate array (FPGA) design flows with constraints. However, routings still exist as concerns because of the deficient flexibility on routing control, which unfavourably results in bias between complementary nets in security-sensitive parts. In this article, based on a routing repair technique, novel verifications towards routing effect are presented. An 8 bit simplified advanced encryption processing (AES)-co-processor is executed that is constructed on block random access memory (RAM)-based BCDL in Xilinx Virtex-5 FPGAs. Since imbalanced routing are major defects in BCDL, the authors can rule out other influences and fairly quantify the security variants. A series of asymptotic correlation electromagnetic (EM) analyses are launched towards a group of circuits with consecutive routing schemes to be able to verify routing impact on side channel analyses. After repairing the non-identical routings, Mutual information analyses are executed to further validate the concrete security increase obtained from identical routing pairs in BCDL.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"37 1","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87087078","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