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

作者： Kim, Jongsung Hong, Seokhie Preneel, Bart Biham, Eli Dunkelman, Orr Keller, Nathan Division of E-Business Kyungnam University Kyungnam 630-701 Korea Republic of Center for Information Security and Technologies Korea University Seoul 136-701 Korea Republic of Department of Electrical Engineering Katholieke Universiteit Leuven B-3001 Leuven-Heverlee Belgium Department of Computer Science Technion Haifa 32000 Israel Department of Computer Science University of Haifa 31905 Haifa Israel Department of Mathematics Bar Ilan University Ramat-Gan 52900 Israel

In 2004, we introduced the related-key boomerang/rectangle attacks, which allow us to enjoy the benefits of the boomerang attack and the related-key technique, simultaneously. The new attacks were used since then to attack numerous block ciphers. While the claimed applications are significant, most of them have a major drawback. Their validity cannot be verified experimentally due to their high complexity. Together with the lack of rigorous justification of the probabilistic assumptions underlying the technique, this lead Murphy to claim that attacks using the related-key boomerang/rectangle technique are not legitimate. This paper contains two contributions. The first is a rigorous analysis of the related-key boomerang/rectangle attacks, including devising provably optimal distinguishers and computing their success rate, and discussing the underlying independence assumptions. The second contribution is an extensive experimental verification of the related-key boomerang attack against the GSM block cipher, KASUMI. Our experiments reveal that the success probability of the distinguisher, when averaged over different choices of the keys, is close to the theoretical prediction. However, the exact probability depends on the key, such that for some portion of the keys, the distinguisher holds with a higher probability than expected, while for the rest of the keys, the distinguisher fails completely. © 2012 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

On the link between explicit MPC and the face lattice of the lifted feasible domain

引用

IFAC-PapersOnLine 2022年第16期55卷 308-313页

作者： Ştefan S. Mihai Florin Stoican Bogdan D. Ciubotaru Department of Automatic Control and Systems Engineering University "Politehnica" of Bucharest 313 Splaiul Independenţei Sector 6 060042 Bucharest Romania Research Center for Logic Optimization and Security (LOS) Department of Computer Science Faculty of Mathematics and Computer Science University of Bucharest.

The paper provides a geometric interpretation for the explicit solution of the quadratic cost, linear-constrained MPC (model predictive control) problem. We link the face lattice of the lifted feasible domain (defined in the input and parameter space) with the critical regions which partition the parameter space and serve as polyhedral support for the piecewise affine explicit MPC solution. We provide geometric (face visibility) and algebraic (polyhedron emptiness) tests for the pruning of the candidate sets of active constraints.

关键词： Model Predictive Control (MPC) Explicit MPC Face Lattice Constrained-Optimization Problem

来源：评论

学校读者我要写书评

暂无评论

Data Processing Technology for Network Abnormal Traffic Detection 4

Data Processing Technology for Network Abnormal Traffic Dete...

引用

4th International Conference on Machine Learning and Big Data Analytics for IoT security and Privacy, SPIoT 2023

作者： Wang, Kun Fu, Yu Duan, Xueyuan Xu, Jianqiao Liu, Taotao Department of Information Security Naval University of Engineering Wuhan430033 China School of Mathematics and Information Engineering Xinyang Vocational and Technical College Xinyang464000 China College of Computer and Information Technology Xinyang Normal University Xinyang464000 China Henan Key Laboratory of Analysis and Applications of Education Big Data Xinyang Normal University Xinyang464000 China

At present, the threats to network security are also increasing, among which abnormal traffic detection is the key link to ensure network security. Traditional detection methods based on signature or threshold are often difficult to adapt to the increasingly complex network environment and new attack methods. Therefore, this paper optimizes and improves the data processing technology, proposes a network ATD method based on particle swarm optimization(PSO) algorithm, and explores in detail the traffic data collection and pre-processing, the feature recognition of abnormal traffic, the application of PSO algorithm, real-time monitoring and response mechanism. The results of two sets of simulation experiments are as follows: compared with the traditional model, the accuracy rate of ATD of the improved algorithm is increased by 7.2% on average, and the detection time is reduced by 7.35s on average. This method not only enhances the adaptability of the model to new attacks, but also improves the degree of automation of detection. © 2024 The Authors.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Cyber Deception System based on Monte Carlo Simulation in the Mobile Edge Computing (MEC)

Cyber Deception System based on Monte Carlo Simulation in th...

引用

International Conference on computer, Information and Telecommunication Systems (CITS)

作者： Joelle Kabdjou Elie Fute Tagne Danda B. Rawat Jaime Acosta Charles Kamhoua Department of Mathematics and Computer Science University of Dschang Dschang Cameroon Department of Computer Engineering University of Buea Buea Dschang Cameroon Department of Electrical Engineering and Computer Science Howard University Washington USA DEVCOM Army Research Laboratory Network Security Branch Adelphi US

The frequency of malicious activities by cyber attackers is on the rise, posing a significant challenge to counter cyber attacks in the Mobile Edge Computing (MEC) environment. The vulnerability of wireless networks, which serve as the primary communication media for MEC servers and IoT applications, is due to their open nature of communication. This work proposes a MEC architecture that utilizes Network Function Virtualization (NFV) and Service Function Chain (SFC) to combat cyber adversaries. Additionally, we evaluate the performance of a cyber deception system, which leverages a software-defined networking (SDN) controller and decision- maker to continuously monitor incoming MEC traffic and direct cyber adversaries to a deception MEC server. The deception MEC server collects information about cyber adversaries' intent, capabilities, and potential damage to the system, thus securing legitimate users from cyber attacks. The proposed approach was evaluated using Monte Carlo simulations, and numerous results were obtained which demonstrate the effectiveness of cyber deception in MEC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Inconsistencies among spectral robustness metrics 1

引用

14th EAI International Conference on Heterogeneous Networking for Quality, Reliability, security and Robustness, Qshine 2018

作者： Wang, Xiangrong Feng, Ling Kooij, Robert E. Marzo, Jose L. Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands Computing Science Department Institute of High Performance Computing A*STAR Singapore Singapore iTrust Centre for Research in Cyber Security Singapore University of Technology and Design Singapore Singapore Institute of Informatics and Applications University of Girona Girona Spain

ISBN: (数字)9783030144135

ISBN: (纸本)9783030144128

Network robustness plays a critical role in the proper functioning of modern society. It is common practice to use spectral metrics, to quantify the robustness of networks. In this paper we compare eight different spectral metrics that quantify network robustness. Four of the metrics are derived from the adjacency matrix, the others follow from the Laplacian spectrum. We found that the metrics can give inconsistent indications, when comparing the robustness of different synthetic networks. Then, we calculate and compare the spectral metrics for a number of real-world networks, where inconsistencies still occur, but to a lesser extent. Finally, we indicate how the concept of the R∗-value, a weighted sum of robustness metrics, can be used to resolve the found inconsistencies. © ICST Institute for computer Sciences, Social Informatics and Telecommunications engineering 2019.

关键词： Circuit theory

来源：评论

学校读者我要写书评

暂无评论

A chaotic artificial bee colony algorithm based on lévy search

A chaotic artificial bee colony algorithm based on lévy sea...

引用

作者： Lin, Shijie Dong, Chen Wang, Zhiqiang Guo, Wenzhong Chen, Zhenyi Ye, Yin College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Key Laboratory of Information Security of Network Systems Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China Department of Electrical Engineering University of South Florida TampaFL33620 United States

A Lévy search strategy based chaotic artificial bee colony algorithm (LABC) is proposed in this paper. The chaotic sequence, global optimal mechanism and Lévy flight mechanism were introduced respectively into the initialization, the employed bee search and the onlooker bee search. The experiments show that the proposed algorithm performed better in convergence speed, global search ability and optimization accuracy than other improved ABC. Copyright © 2018 The Institute of Electronics, Information and Communication Engineers.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Electronic national lotteries

引用

8th International Conference on Financial Cryptography, FC 2004

作者： Konstantinou, Elisavet Liagkou, Vasiliki Spirakis, Paul Stamatiou, Yannis C. Yung, Moti Research and Academic Computer Technology Institute P.O. Box 1122 Patras26110 Greece Department of Computer Engineering and Informatics University of Patras Patras26500 Greece Department of Mathematics University of the Aegean Karlovassi Samos83200 Greece on Communications and Information Systems Security University of the Aegean and Athens University of Economics and Business Greece Computer Science Columbia University New YorkNY United States

ISBN: (纸本)3540224203

We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost effective alternative to mechanical ones when there is a business need to support many types of "games of chance" and to allow increased drawing frequency. Electronic lotteries are, in fact, extremely high risk financial application: If one discovers a way to predict or otherwise claim the winning numbers (even once) the result is huge financial damages. Moreover, the e-lottery process is complex, which increases the possibility of fraud or costly accidental failures. In addition, a national lottery must adhere to auditability and (regulatory) fairness requirements regarding its drawings. Our mechanism, which we believe is the first one of its kind to be described in the literature, builds upon a number of cryptographic primitives that ensure the unpredictability of the winning numbers, the prevention of their premature leakages and prevention of fraud. We also provide measures for auditability, fairness, and trustworthiness of the process. Besides cryptography, we incorporate security mechanisms that eliminate various risks along the entire process. Our system which was commissioned by a national organization, was implemented in the field and has been operational and active for a while, now. © IFCA/Springer-Verlag Berlin Heidelberg 2004.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

CRANE: A Genuine Framework based on Verifiable Searchable Encryption security and Resource Constraints Balancing on Client Side

CRANE: A Genuine Framework based on Verifiable Searchable En...

引用

International Conference on Smart Communications and Networking (SmartNets)

作者： Marius Iulian Mihailescu Stefania Loredana Nita Valentina Marascu Faculty of Engineering and Computer Science Scientific Research Center in Mathematics and Computer Science SPIRU HARET University Bucharest Romania Department of Computer and Cybernetic Security Military Technical Academy “Ferdinand I” Bucharest Romania

ISBN: (数字)9798350385328

ISBN: (纸本)9798350385335

This paper introduces an authentic framework that relies on verifiable searchable encryption security and a mechanism for managing resource limitations on the client-side. The framework is specifically designed to tackle the difficulty of achieving a high level of data security while minimizing the storage requirements on the client-side. The framework combines a symmetric key encryption technique with a Searchable Encryption Index (SEI) to allow for efficient searches while maintaining data secrecy. One important aspect is the utilization of cryptographic verification tokens, which enable clients to verify the integrity and validity of search results while keeping a consistently small storage space requirement. This is accomplished by exclusively storing crucial keys and tokens on the client's end. Our framework incorporates advanced security measures such as key rotation, auditing systems, and end-to-end encryption. This ensures a strong and efficient solution for safe data searches, making it especially suitable for contexts with limited client-side resources. The practical usefulness of searchable encryption is validated through rigorous testing and third-party audits, ensuring a balance between security, efficiency, and scalability.

关键词： Smart cities Scalability Keyword search Education Encryption security Indexes

来源：评论

学校读者我要写书评

暂无评论

The Power of Bamboo: On the Post-Compromise security for Searchable Symmetric Encryption 30

The Power of Bamboo: On the Post-Compromise Security for Sea...

引用

30th Annual Network and Distributed System security Symposium, NDSS 2023

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

ISBN: (纸本)1891562835

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2023 30th Annual Network and Distributed System security Symposium, NDSS 2023. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Explaining Learned Reward Functions with Counterfactual Trajectories

arXiv

引用

arXiv 2024年

作者： Wehner, Jan Oliehoek, Frans Siebert, Luciano Cavalcante CISPA Helmholtz Center for Information Security Germany Department of Intelligent Systems Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands

Learning rewards from human behavior or feedback is a promising approach to aligning AI systems with human values but fails to consistently extract correct reward functions. Interpretability tools could enable users to understand and evaluate possible flaws in learned reward functions. We propose Counterfactual Trajectory Explanations (CTEs) to interpret reward functions in Reinforcement Learning by contrasting an original and a counterfactual trajectory and the rewards they each receive. We derive six quality criteria for CTEs and propose a novel Monte-Carlo-based algorithm for generating CTEs that optimizes these quality criteria. To evaluate how informative the generated explanations are to a proxy-human model, we train it to predict rewards from CTEs. CTEs are demonstrably informative for the proxy-human model, increasing the similarity between its predictions and the reward function on unseen trajectories. Further, it learns to accurately judge differences in rewards between trajectories and generalizes to out-of-distribution examples. Although CTEs do not lead to a perfect prediction of the reward, our method, and more generally the adaptation of XAI methods, are presented as a fruitful approach for interpreting learned reward functions and thus enabling users to evaluate them. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：