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

22nd International Conference on Applied Cryptography and Network Security (ACNS)

作者： Wagner, Eric Serror, Martin Wehrle, Klaus Henze, Martin Fraunhofer FKIE Cyber Anal & Def Wachtberg Germany Rhein Westfal TH Aachen Commun & Distributed Syst Aachen Germany Rhein Westfal TH Aachen Secur & Privacy Ind Cooperat Aachen Germany

ISBN: (纸本)9783031547720;9783031547737

Aggregation of message authentication codes (MACs) is a proven and efficient method to preserve valuable bandwidth in resource-constrained environments: Instead of appending a long authentication tag to each message, the integrity protection of multiple messages is aggregated into a single tag. However, while such aggregation saves band-width, a single lost message typically means that authentication information for multiple messages cannot be verified anymore. With the significant increase of bandwidth-constrained lossy communication, as applications shift towards wireless channels, it thus becomes paramount to study the impact of packet loss on the diverse MAC aggregation schemes proposed over the past 15 years to assess when and how to aggregate message authentication. Therefore, we empirically study all relevant MAC aggregation schemes in the context of lossy channels, investigating achievable goodput improvements, the resulting verification delays, processing over-head, and resilience to denial-of-service attacks. Our analysis shows the importance of carefully choosing and configuring MAC aggregation, as selecting and correctly parameterizing the right scheme can, e.g., improve goodput by 39% to 444%, depending on the scenario. However, since no aggregation scheme performs best in all scenarios, we provide guidelines for network operators to select optimal schemes and parameterizations suiting specific network settings.

关键词： message authentication code MAC Aggregation IoT

来源：评论

学校读者我要写书评

暂无评论

Integrity coded databases- protecting data integrity for outsourced databases

引用

COMPUTERS & SECURITY 2024年 136卷

作者： Yeh, Jyh-haw Arifin, Md Mashrur Shen, Ning Karki, Ujwal Xie, Yi Nanjundarao, Archana Boise State Univ Dept Comp Sci Boise ID 83725 USA Boise State Univ Comp Sci Boise ID USA Kathmandu Univ Comp Sci & Engn Dhulikhel Nepal

In recent years, cloud storage has become a viable option for businesses to store and retrieve information. This storage service allows its clients releasing from financial burden of hiring professionals to maintain local databases. However, it comes at a cost of requiring the clients to relinquish control of their data to cloud service providers. There remains the possibility of malicious attacks to make the data no longer correct, fresh nor complete. This paper presents a novel database model called the Integrity coded Database (ICDB), where the model allows the client to insert Integrity codes (ICs), as well as fake tuples, to an outsourced database, run queries against the server, and verify that the queried data from the cloud is both correct, fresh and complete. We have benchmarked and evaluated six ICDB schemes with different combinations of three IC generation algorithms and two integrity verification modes.

关键词： Database integrity Database outsourcing Integrity code message authentication code Aggregate verification

来源：评论

学校读者我要写书评

暂无评论

Payload Processor: message authentication for in-vehicle CAN bus using data compression and tag filling

引用

COMPUTER NETWORKS 2025年 259卷

作者： Zhang, Guiqi Shen, Jun Li, Jiangtao Qin, Wutao Li, Yufeng Shanghai Univ Shanghai Peoples R China Purple Mt Labs Nanjing Jiangsu Peoples R China

The Controller Area Network (CAN) is the dominant in-vehicle communication protocol, facilitating information exchange between electronic control units (ECUs). However, its inherent lack of security mechanisms makes it susceptible to cyberattacks. While numerous message authentication code (MAC) methods have been proposed to enhance CAN bus security, existing solutions often reduce the available payload of frames or require hardware modifications to ECUs. In this paper, we propose a novel message authentication method, Payload Processor, which leverages data compression and hash-based MAC. Specifically, we introduce a dictionary-based data compression technique that exploits the sparsity of CAN message payloads. The authentication tag is then seamlessly embedded within the freed payload space. Our proposed method effectively authenticates messages without compromising the available payload or altering hardware. To validate its effectiveness, extensive experiments are conducted using real data collected from 20 distinct vehicles. The results demonstrate that our method significantly improves the compression lower limit compared to existing state-of-the-art compression methods. In terms of security enhancement, our method provides at least 12 bits of authentication data per message in the best-case scenario, without increasing the bus load. In the worst-case scenario, it offers at least 4 bits of authentication data per message. We emphasize that our method serves as an alternative authentication approach and can complement existing solutions in the field.

关键词： Vehicle security Controller Area Network Data compression message authentication code Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Leveraging quantum uncertainty: Quantum randomness through the lens of classical communication networks

引用

COMPUTER NETWORKS 2024年 254卷

作者： Das, Siddharth Krause, Stefan Giering, Kay-Uwe Pousa, Ricardo J. B. Bassoli, Riccardo Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Saxony Germany Tech Univ Dresden Ctr Tactile Internet CeTi Dresden Saxony Germany Tech Univ Dresden Quantum Commun Networks Res Grp Dresden Saxony Germany Fraunhofer IIS Inst Steil Entwicklung Adaptiver Syst EAS Dresden Saxony Germany

The generation of random numbers and the study of its properties have been an elusive field for a fair portion of the century. The application of random numbers is employed in many use cases such as cryptography, neural networks, numerical simulation, and gambling. The performance of each of these use cases is profoundly impacted by the employed random numbers;henceforth, the quality of randomness is of critical importance when it comes to their usage. A poorly generated random number can make a security system vulnerable, or any numerical or statistical evaluation misleading. Although various modes of classical random number generators exist and still function to provide strong cryptographic properties, emergence of quantum mechanical randomness has shed light on a novel path of generating certified randomness which supersedes the classical counterpart in terms of security. Harnessing quantum mechanical phenomena enables generation of true random numbers which can be certified and further implemented to elevate the net quality of the specific use cases. In this work, we generate and analyze random numbers from three different sources - 50: 50 beam splitter (BS), quantum key distribution (QKD) setup with classical post-processing scheme, and a commercially available quantum random number generator (QRNG) (ID Quantique (IDQ)). The quality of the generated random numbers from the various sources is checked in statistical tests and compared. Further on, we have developed a system which implements the QRNG-based random numbers to facilitate message authentication code (MAC) and one time password (OTP) protocols, demonstrating a communication network application. In this manner we discuss about a network which integrates quantum mechanics to the current classical networking approaches to enhance certain aspects of the networking protocol - in this case, the

关键词： Quantum randomness Randomness testing Quantum random number generators message authentication code One time pass Quantum communication network

来源：评论

学校读者我要写书评

暂无评论

An Effective Metaheuristic Based Dynamic Fine Grained Data Security Framework for Big Data

引用

WIRELESS PERSONAL COMMUNICATIONS 2024年第4期137卷 2441-2468页

作者： Gupta, Lalit Mohan Samad, Abdus Garg, Hitendra Shah, Kaushal Aligarh Coll Engn & Technol Dept Comp Sci & Engn Aligarh Uttar Pradesh India Aligarh Muslim Univ Dept Comp Engn ZHCET Aligarh Uttar Pradesh India GLA Univ Dept Comp Sci Mathura Uttar Pradesh India Pandit Deendayal Energy Univ Dept Comp Sci & Engn Gandhinagar India

Medical records are transmitted between medical institutions using cloud-based Electronic health record (EHR) systems, which are intended to improve various medical services. Due to the potential of data breaches and the resultant loss of patient data, medical organizations find it challenging to employ cloud-based electronic medical record systems. EHR systems frequently necessitate high transmission costs, energy use, and time loss for physicians and patients. Furthermore, EHR security is a critical concern that jeopardizes patient privacy. Compared to a single system, cloud-based EHR solutions may bring extra security concerns as the system architecture gets more intricate. Access control strategies and the development of efficient security mechanisms for cloud-based EHR data are critical. For privacy reasons, the Dynamic constrained message authentication (DCMA) technique is used in the proposed system to encrypt the outsourced medical data by using symmetric key cryptography, which uses the Seagull optimization algorithm (SOA) to choose the best random keys for encryption and then resultant data is hashed using the SHA-256 technique. The results of the proposed model are evaluated using performance metrics, and the model attained a security of about 98.58%, which is proven to be superior because it adopts advanced random secret key generation, which adds more security to the system.

关键词： Electronic health record Security Dynamic constraints message authentication message authentication code SHA-256 Seagull optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing

引用

DESIGNS codeS AND CRYPTOGRAPHY 2024年第12期92卷 4423-4451页

作者： Minematsu, Kazuhiko Sato, Shingo Shikata, Junji Yokohama Natl Univ Inst Adv Sci Yokohama Japan Yokohama Natl Univ Grad Sch Environm & Informat Sci Yokohama Japan

In this paper, we propose a formal security model and a construction methodology of interactive aggregate message authentication codes with detecting functionality (IAMDs). The IAMD is an interactive aggregate MAC protocol which can identify invalid messages with a small amount of tag-size. Several aggregate MAC schemes that can detect invalid messages have been proposed so far by using non-adaptive group testing in the prior work. In this paper, we utilize adaptive group testing to construct IAMD scheme, and we show that the resulting IAMD scheme can identify invalid messages with a small amount of tag-size compared to the previous schemes. To this end, we give the formalization of adaptive group testing and IAMD, and propose a generic construction starting from any aggregate MAC and any adaptive group testing method. In addition, we compare instantiations of our generic constructions, in terms of total tag-size and several properties. Furthermore, we show advantages of IAMD by implementing constructions of (non-)adaptive aggregate message authentication with detecting functionality and comparing these ones in terms of the data-size and running time of verification algorithms.

关键词： Aggregate message authentication Adaptive group testing message authentication code 68

来源：评论

学校读者我要写书评

暂无评论

Universal Adaptive Construction of Verifiable Secret Sharing and Its Application to Verifiable Secure Distributed Data Storage

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2024年第1期32卷 253-267页

作者： Hayashi, Masahito Koshiba, Takeshi Southern Univ Sci & Technol Shenzhen Inst Quantum Sci & Engn Shenzhen 518055 Peoples R China Chinese Univ Hong Kong Sch Data Sci Shenzhen 518172 Longgang Peoples R China Int Quantum Acad SIQA Shenzhen 518048 Peoples R China Nagoya Univ Grad Sch Math Chikusa ku Nagoya 4648602 Japan Waseda Univ Fac Educ & Integrated Arts & Sci Shinju ku Tokyo 1698050 Japan

Secret sharing is a useful method for secure distributed data storage. Such a distributed data storage can avoid the information leakage under an attack to a limited number of distributed servers. While such distributed servers send their shares to an end user according to the request, there is a risk that malicious distributed servers send incorrect shares. To detect or identify such malicious servers, we need verifiable secure distributed data storage, which can be constructed from verifiable secret sharing. However, many of previous protocols for verifiable secret sharing are constructed in a specific form. This paper proposes an adaptive construction of verifiable secret sharing, which uses an existing secret sharing protocol as a subprotocol. Also, our method can be applied to any existing secret sharing protocol. This type construction realizes an economical construction.

关键词： Cryptography Protocols Memory Servers Software Buffer storage message authentication Secret sharing message authentication code verifiable secret sharing secure distributed data storage

来源：评论

学校读者我要写书评

暂无评论

Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2024年第4期17卷 1698-1711页

作者： Li, Xiaotong Wang, Hao Li, Zhi Wu, Lei Wei, Xiaochao Su, Ye Lu, Rongxing Shandong Normal Univ Sch Informat Sci & Engn Jinan 250061 Peoples R China Univ New Brunswick Fac Comp Sci Fredericton NB Canada

Although secure multi-party computation breaks down data barriers, its utility is reduced when participants have limited computation and communication resources. To make secure multi-party computation more practical, there exists an approach to distribute users' private inputs to multiple servers in a secret sharing manner, and the servers accomplish secure computation tasks through interaction. We propose a new secure computation framework that enables the detection of malicious cloud servers by introducing homomorphic MACs. We utilize pairing-based homomorphic commitments to record MACs on a bulletin board, providing public verifiability while reducing the computation burden on the cloud servers. Additionally, our framework not only supports the underlying general computation, but also prepares for various types of nontrivial high-level operations, such as comparison and bit decomposition. We design a smart payment platform enabling fair payment with the help of smart contracts to protect the rights of both data owners and cloud service providers. Compared to previous works, our framework breaks the limitations of servers being restricted to semi-honest or even honest and provides public verifiability. Performance evaluations demonstrate satisfactory computation and communication efficiency during the online phase of our system.

关键词： Secure outsourcing computation secure multi-party computation publicly verifiable secret sharing message authentication code smart payment Secure outsourcing computation secure multi-party computation publicly verifiable secret sharing message authentication code smart payment

来源：评论

学校读者我要写书评

暂无评论

Toward Full n-bit Security and Nonce Misuse Resistance of Block Cipher-Based MACs 30th

Toward Full n-bit Security and Nonce Misuse Resistance of Bl...

引用

30th International Conference on the Theory and Application of Cryptology and Information Security

作者： Choi, Wonseok Lee, Jooyoung Lee, Yeongmin Purdue Univ W Lafayette IN 47907 USA Georgia Inst Technol Atlanta GA 30332 USA Korea Adv Inst Sci & Technol Daejeon South Korea DESILO Inc Seoul South Korea

ISBN: (纸本)9789819609468;9789819609475

In this paper, we study the security of MAC constructions among those classified by Chen et al. in ASIACRYPT '21. Precisely, F-B2(EDM) (or EWCDM as named by Cogliati and Seurin in CRYPTO '16), F-B3(EDM), F-B2(SoP) , F-B3(SoP) (all as named by Chen et al.) are proved to be fully secure up to 2(n) MAC queries in the nonce-respecting setting, improving the previous bound of 3n/4 -bit security. In particular, F-B2(So) and F-B3(SoP) enjoy graceful degradation as the number of queries with repeated nonces grows (when the underlying universal hash function satisfies a certain property called multi-xor-collision resistance). To do this, we develop a new tool, namely, extended Mirror theory for two independent permutations with a wide range *** including inequalities. We also present matching attacks on F-B4(EDM) and F-B5(EDM) using O(2(3n/4)) MAC queries and O(1) verification query without using repeated nonces.

关键词： message authentication code beyond birthday bound security Mirror theory

来源：评论

学校读者我要写书评

暂无评论

Security Analysis of CMAC in the Multi-user Model 27th

Security Analysis of CMAC in the Multi-user Model

引用

27th International Conference on Information Security

作者： Zhang, Xiangyang Shen, Yaobin Wang, Lei Shanghai Jiao Tong Univ Shanghai 200240 Peoples R China Xiamen Univ Xiamen 361005 Peoples R China

ISBN: (纸本)9783031757563;9783031757570

CMAC, also known as OMAC1, is an efficient message authentication code (MAC) and has been standardized by NIST and other organizations. It has been widely applied in IPSec, IKE and many wireless networks. Multi-user security captures a practical scenario where an adversary targets a particular service related to multiple users. Lots of MAC constructions have been rigorously analyzed in the multi-user model. However, the concrete analysis for CMAC in the multi-user model is still a blank in the literature. To fill the gap, we provide a concrete multi-user security bound for CMAC in this paper. Our bound is better than that from generic reduction and we observe that the online security of CMAC in the multi-user model does not degrade from the single-user model.

关键词： CMAC OMAC1 Multi-User Security MAC message authentication code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：