检索结果-内蒙古大学图书馆

6th EAI International Conference on Science and Technologies for Smart Cities, SmartCity 2020

作者： Klima, Matej Rechtberger, Vaclav Bures, Miroslav Bellekens, Xavier Hindy, Hanan Ahmed, Bestoun S. Department of Computer Science FEE Czech Technical University in Prague Prague Czech Republic Department of Electronic and Electrical Engineering University of Strathclyde Glasgow United Kingdom Division of Cyber Security Abertay University Dundee United Kingdom Department of Mathematics and Computer Science Karlstad University Karlstad Sweden

ISBN: (纸本)9783030760625

Quality and reliability metrics play an important role in the evaluation of the state of a system during the development and testing phases, and serve as tools to optimize the testing process or to define the exit or acceptance criteria of the system. This study provides a consolidated view on the available quality and reliability metrics applicable to Internet of Things (IoT) systems, as no comprehensive study has provided such a view specific to these systems. The quality and reliability metrics categorized and discussed in this paper are divided into three categories: metrics assessing the quality of an IoT system or service, metrics for assessing the effectiveness of the testing process, and metrics that can be universally applied in both cases. In the discussion, recommendations of proper usage of discussed metrics in a testing process are then given. © 2021, ICST Institute for computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

New efficient padding methods secure against padding oracle attacks 18th

New efficient padding methods secure against padding oracle ...

引用

18th International Conference on Information security and Cryptology, ICISC 2015

作者： Kang, HyungChul Park, Myungseo Moon, Dukjae Lee, Changhoon Kim, Jongsung Kim, Kimoon Kim, Juhyuk Hong, Seokhie Korea University Seoul Korea Republic of The Affiliated Insutitude of ETRI Seoul Korea Republic of Department of Computer Science and Engineering Seoul University of Science and Technology Seoul Korea Republic of Department of Mathematics Department of Financial Information Security Kookmin University Seoul Korea Republic of Korea Security and Internet Agency Seoul Korea Republic of

ISBN: (纸本)9783319308395

This paper proposes three new padding methods designed to withstand padding oracle attacks, which aim at recovering a plaintext without knowing the secret key by exploiting oracle’s characteristic of checking the padding during decryption. Of the ten existing padding methods, only two (ABYT-PAD and ABIT-PAD) can withstand padding oracle attacks. However, these methods are not efficient since they either use a random number generator or require MAC verification in applications. The three new padding methods proposed in this paper are secure against padding oracle attacks and more efficient compared to the two aforementioned padding methods. © Springer International Publishing Switzerland 2016.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Bilateral Contract for Load Frequency and Renewable Energy Sources Using Advanced Controller

引用

computers, Materials & Continua 2022年第11期73卷 3165-3180页

作者： Krishan Arora Gyanendra Prasad Joshi Mahmoud Ragab Muhyaddin Rawa Ahmad H.Milyani Romany F.Mansour Eunmok Yang School of Electronics and Electrical Engineering Lovely Professional UniversityPhagwara144001PunjabIndia School of Department of Computer Science and Engineering Sejong UniversitySeoul05006Korea Information Technology Department Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Centre for Artificial Intelligence in Precision Medicines King Abdulaziz UniversityJeddah21589Saudi Arabia Mathematics Department Faculty of ScienceAl-Azhar UniversityNaser City11884CairoEgypt Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah21589Saudi Arabia Department of Electrical and Computer Engineering Faculty of EngineeringKing Abdulaziz UniversityJeddah21589Saudi Arabia King Abdullah City for Atomic and Renewable Energy(K.A.CARE) RiyadhSaudi Arabia Department of Mathematics Faculty of ScienceNew Valley UniversityEl-Kharga72511Egypt Department of Information Security Cryptologyand MathematicsKookmin UniversitySeoul02707Korea

Reestablishment in power system brings in significant transformation in the power sector by extinguishing the possession of sound consolidated ***,the collaboration of various manufacturing agencies,autonomous power manufacturers,and buyers have created complex installation *** regular active load and inefficiency of best measures among varied associates is a huge *** sudden load deviation will give rise to immediate amendment in frequency and tie-line power *** is essential to deal with every zone’s frequency and tie-line power within permitted confines followed by fluctuations within the ***,it can be proficient by implementing Load Frequency Control under the Bilateral case,stabilizing the power and frequency distinction within the interrelated power *** the net deviation in multiple areas is possible by minimizing the unbalance of Bilateral Contracts with the help of proportional integral and advanced controllers like Harris Hawks *** proposed the advanced controller Harris Hawk optimizer-based model and validated it on a test *** experiment results show that the delay time is 0.0029 s and the settling time of 20.86 s *** model can also be leveraged to examine the decision boundaries of the Bilateral case.

关键词： Bilateral contract load frequency control optimization harris hawks optimizer

来源：评论

学校读者我要写书评

暂无评论

Improved impossible differential attacks on large-block Rijndael

Improved impossible differential attacks on large-block Rijn...

引用

15th International Conference on Information security and Cryptology, ICISC 2012

作者： Wang, Qingju Gu, Dawu Rijmen, Vincent Liu, Ya Chen, Jiazhe Bogdanov, Andrey Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China KU Leuven ESAT/COSIC iMinds Belgium Key Laboratory of Cryptologic Technology and Information Security School of Mathematics Shandong University Jinan 250100 China Technical University of Denmark Department of Mathematics Denmark

ISBN: (纸本)9783642376818

In this paper, we present more powerful 6-round impossible differentials for large-block Rijndael-224 and Rijndael-256 than the ones used by Zhang et al. in ISC 2008. Using those, we can improve the previous impossible differential cryptanalysis of both 9-round Rijndael-224 and Rijndael-256. The improvement can lead to 10-round attack on Rijndael-256 as well. With 2198.1 chosen plaintexts, an attack is demonstrated on 9-round Rijndael-224 with 2 195.2 encryptions and 2140.4 bytes memory. Increasing the data complexity to 2216 plaintexts, the time complexity can be reduced to 2130 encryptions and the memory requirements to 2 93.6 bytes. For 9-round Rijndael-256, we provide an attack requiring 2229.3 chosen plaintexts, 2194 encryptions, and 2 139.6 bytes memory. Alternatively, with 2245.3 plaintexts, an attack with a reduced time of 2127.1 encryptions and a memory complexity of 290.9 bytes can be mounted. With 2244.2 chosen plaintexts, we can attack 10-round Rijndael-256 with 2253.9 encryptions and 2186.8 bytes of memory. © 2013 Springer-Verlag.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Efficient and secure conference-key distribution

引用

International Workshop on security Protocols, 1996

作者： Burmester, Mike Desmedt, Yvo G. Information Security Group Department of Mathematics University of London Royal Holloway Egham SurreyTW20 OEX United Kingdom Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee WI53201-0784 United States

ISBN: (纸本)3540624945

Key distribution is a major cryptographic component for secure communication. For privacy data must be encrypted with keys which are distributed securely. In this paper we focus on conference key distribution. Our approach is to use a two-party key distribution system as an underlying cryptographic primitive and extend it to a conference system. We consider three different models: an unconditionally secure model, a provably secure model, and a model whose security is based on the difficulty of breaking the Diffie-Hellman problem. For each of these we present a conference key distribution system which is as secure as the primitive. These extend and generalize our conference scheme presented at Eurocrypt '94. In particular, (i) we are not restricted to any specific network or primitive and, (ii) our system based on the Diffie-Hellman key exchange is more efficient. © Springer-Verlag Berlin Heidelberg 1997.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Discovering High Utility Episodes in Sequences

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第3期4卷 473-486页

作者： Gan, Wensheng Lin, Jerry Chun-Wei Chao, Han-Chieh Yu, Philip S. Jinan University College of Cyber Security Guangzhou510632 China Pazhou Lab Guangzhou510330 China Western Norway University of Applied Sciences Department of Computing Mathematics and Physics Bergen5063 Norway National Dong Hwa University Department of Electrical Engineering Hualien974 Taiwan University of Illinois at Chicago Department of Computer Science ChicagoIL60607 United States

Sequence data are more commonly seen than other types of data (e.g., transaction data) in real-world applications. For the mining task from sequence data, several problems have been formulated, such as sequential pattern mining, episode mining, and sequential rule mining. As one of the fundamental problems, episode mining has often been studied. The common wisdom is that discovering frequent episodes is not useful enough. In this article, we propose an efficient utility mining approach, namely, UMEpi: utility mining of high-utility episodes from complex event sequences. We propose the concept of remaining utility of episodes and achieve a tighter upper bound, namely, episode-weighted utilization (EWU), which will provide better pruning. Thus, the optimized EWU-based pruning strategies can achieve better improvements in mining efficiency. The search space of UMEpi w.r.t. a prefix-based lexicographic sequence tree is spanned and determined recursively for mining high-utility episodes, by prefix-spanning in a depth-first way. Finally, extensive experiments on four real-life datasets demonstrate that UMEpi can discover the complete high-utility episodes from complex event sequences. Furthermore, the improved variants of UMEpi significantly outperform the baseline in terms of execution time, memory consumption, and scalability. © 2020 IEEE.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Image Forgery Detection using Convolutional Neural Networks and Blockchain Technology 24

Image Forgery Detection using Convolutional Neural Networks ...

引用

2024 Cognitive Models and Artificial Intelligence Conference, AICCONF 2024

作者： Khalaf, Luay Ibrahim Jumaili, Mustafa Lateef Fadhil Almashhadany, Mohammed Thakir Mahmood Aljanabi, Mohammed S. Hasan, Taif S. Algburi, Sameer Department of Computer Science College of Computer Science and Mathematics Tikrit University Iraq Computer Engineering Techniques Dept Al-Maarif University College Al Anbar Iraq Artificial Intelligence Engineering Department College of Engineering Al-Ayen University Thi-Qar Iraq Computer Science Department Bayan University Erbil Kurdistan Iraq Department of Computer Engineering Techniques Al Hikma University College Baghdad Iraq Department of Cyber Security and Cloud Computing Al-Ma'moon University College Al-Washash Baghdad Iraq Al-Kitab University Kirkuk36015 Iraq

ISBN: (纸本)9798400716928

In the era of digital media, the growth of picture forgeries poses a huge threat to content validity and reliability. Previous techniques for picture forgery detection have found constraints in accuracy and scalability, forcing the creation of more robust systems. This article suggests a unique technique that merges convolutional neural networks (CNNs) and blockchain technology to address this critical issue. Leveraging a carefully curated dataset combining authentic and forged photos generated through various manipulation techniques, we trained our algorithm to detect and categorize forged content with high accuracy. Our test outcomes revealed impressive performance, with the highest achievable accuracy, precision, recall, and F1-score values standing at 0.95, 0.92, 0.94, and 0.93, respectively. This method represents a considerable leap in image forgery detection and shows promise for fighting digital tampering in varied real-world applications. © 2024 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Privacy engineering in the Wild: Understanding the Practitioners' Mindset, Organizational Aspects, and Current Practices

引用

IEEE Transactions on Software engineering 2023年第9期49卷 4324-4348页

作者： Iwaya, Leonardo Horn Babar, Muhammad Ali Rashid, Awais JoondalupWA6027 Australia Research Group Department of Mathematics and Computer Science Karlstad65188 Sweden The University of Adelaide Centre for Research on Engineering Software Technologies AdelaideSA5005 Australia University of Bristol Bristol Cyber Security Group REPHRAIN: National Research Centre on Privacy Harm Reduction and Adversarial Influence Online Department of Computer Science BristolBS8 1QU United Kingdom

Privacy engineering, as an emerging field of research and practice, comprises the technical capabilities and management processes needed to implement, deploy, and operate privacy features and controls in working systems. For that, software practitioners and other stakeholders in software companies need to work cooperatively toward building privacy-preserving businesses and engineering solutions. Significant research has been done to understand the software practitioners' perceptions of information privacy, but more emphasis should be given to the uptake of concrete privacy engineering components. This research delves into the software practitioners' perspectives and mindset, organizational aspects, and current practices on privacy and its engineering processes. A total of 30 practitioners from nine countries and backgrounds were interviewed, sharing their experiences and voicing their opinions on a broad range of privacy topics. The thematic analysis methodology was adopted to code the interview data qualitatively and construct a rich and nuanced thematic framework. As a result, we identified three critical interconnected themes that compose our thematic framework for privacy engineering 'in the wild': (1) personal privacy mindset and stance, categorised into practitioners' privacy knowledge, attitudes and behaviours;(2) organizational privacy aspects, such as decision-power and positive and negative examples of privacy climate;and, (3) privacy engineering practices, such as procedures and controls concretely used in the industry. Among the main findings, this study provides many insights about the state-of-the-practice of privacy engineering, pointing to a positive influence of privacy laws (e.g., EU General Data Protection Regulation) on practitioners' behaviours and organizations' cultures. Aspects such as organizational privacy culture and climate were also confirmed to have a powerful influence on the practitioners' privacy behaviours. A conducive environment f

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Improved meet-in-the-middle attacks on reduced-round Piccolo

引用

Science China(Information Sciences) 2018年第3期61卷 95-107页

作者： Ya LIU Liang CHENG Zhiqiang LIU Wei LI Qingju WANG Dawu GU Department of Computer Science and Engineering University of Shanghai for Science and Technology State Key Laboratory of Cryptology Department of Computer Science and Engineering Shanghai Jiao Tong University School of Computer Science and Technology Donghua University Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Department of Applied Mathematics and Computer Science Technical University of Denmark

Piccolo is a lightweight block cipher that adopts a generalized Feistel network structure with4 branches, each of which is 16 bit long. The key length is 80 or 128 bit, denoted by Piccolo-80 and Piccolo-128, respectively. In this paper, we mounted meet-in-the-middle attacks on 14-round Piccolo-80 without preand post-whitening keys and 18-round Piccolo-128 with post-whitening keys by exploiting the properties of the key schedule and Maximum Distance Separable（MDS） matrix. For Piccolo-80, we first constructed a 5-round distinguisher. Then 4 rounds and 5 rounds were appended at the beginning and at the end,respectively. Based on this structure, we mounted an attack on 14-round Piccolo-80 from the 5 th round to the 18 th round. The data, time, and memory complexities were 252chosen plaintexts, 267.44encryptions, and 264.91blocks, respectively. For Piccolo-128, we built a 7-round distinguisher to attack 18-round Piccolo-128 from the 4 th round to the 21st round. The data, time, and memory complexities were 252chosen plaintexts,2126.63encryptions, and 2125.29blocks, respectively. If not considering results on biclique cryptanalysis,these are currently the best public results on this reduced version of the Piccolo block cipher.

关键词： block cipher lightweight Piccolo meet-in-the-middle attack distinguisher

来源：评论

学校读者我要写书评

暂无评论

Strong security enabled certificateless aggregate signatures applicable to mobile computation

Strong security enabled certificateless aggregate signatures...

引用

3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011

作者： Hu, Xiong Wu, Qianhong Chen, Zhong Key Laboratory of Network and Software Security Assurance of the Ministry of Education School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Ministry of Education China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Av. Països Catalans 26 E-43007 Tarragona Spain

ISBN: (纸本)9780769545790

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identitybased cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme. Compared with up-todate certificateless aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model;(2) the security is proven in the strongest security model so far;(3) the signers do not need to be synchronized;and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized. © 2011 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：