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

A new multi-linear universal hash family

DESIGNS codeS AND CRYPTOGRAPHY 2013年第3期69卷 351-367页

作者： Sarkar, Palash Indian Stat Inst Appl Stat Unit Kolkata 700108 India

A new universal hash family is described which generalises a previously known multi-linear hash family. messages are sequences over a finite field while keys are sequences over an extension field . A linear map from to itself is used to compute the output digest. Of special interest is the case q = 2. For this case, we show that there is an efficient way to implement using a tower field representation of . From a practical point of view, the focus of our constructions is small hardware and other resource constrained applications. For such platforms, our constructions compare favourably to previous work.

关键词： Universal hash function Tower field message authentication code Resource constrained devices

来源：评论

学校读者我要写书评

暂无评论

A cheater identifiable multi-secret sharing scheme based on the Chinese remainder theorem

引用

SECURITY AND COMMUNICATION NETWORKS 2015年第18期8卷 3592-3601页

作者： Chen, Zhenhua Li, Shundong Zhu, Youwen Yan, Jianhua Xu, Xinli Xian Univ Sci & Technol Sch Comp Sci & Technol Xian 710054 Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian 710062 Peoples R China Kyushu Univ Inst Math Ind Fukuoka 8190395 Japan Beiyou Univ State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Huaiyin Inst Technol Fac Math & Phys Huaian 223003 Peoples R China

There are many researches on the polynomial-based verifiable (k, n) multi-secret sharing scheme (VMSSS), but none of them focuses on the Chinese remainder theorem (CRT)-based VMSSS so far. For the first time, we provide a cheater identifiable multi-secret sharing scheme based on CRT as an alternative method for VMSSS, which is unconditionally secure when the number of cheaters t <= (k - 1)/3. We adopt an encoding method, which makes multiple secrets to be transferred as a single one. In addition, we utilize a single keyed message authenticated code (MAC) to detect and identify cheaters in the reconstruction phase. Then, combine these two methods with a CRT-based Asmuth-Bloom's SSS to achieve our design goals. In our scheme, all participants share a single key of MAC rather than each participant possesses an independent key to check the validity of shares, and the size of share is independent in any of n, k, and t. Analyses show that our scheme is more efficient and secure than existing ones. Finally, as an example of the practical impact of our work, we present how our techniques can be applied to secure sum computation. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： multi-secret sharing verifiability message authentication code Chinese remainder theorem Godel encoding

来源：评论

学校读者我要写书评

暂无评论

On the Size of Source Space in a Secure MAC

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第9期10卷 2007-2015页

作者： Jiang, Shaoquan Mianyang Normal Univ Inst Informat Secur Mianyang 621000 Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China

A message authentication code (MAC) is (t, epsilon) secure if an attacker cannot forge a valid message with probability better than epsilon after adaptively obtaining t valid messages. For a fixed key space K, it is important for an MAC to support a source space S as large as possible, because this implies a bandwidth saving in practice. Hence, we study the possible size of S in an MAC through vertical bar S vertical bar or equivalently (to our convenience) the ratio (log vertical bar S vertical bar/vertical bar K vertical bar) for a fixed K. Our novelty in the methodology is to regard the MAC function of a given source state as a partition mapping for K. Under this view, we obtain an upper bound on vertical bar S vertical bar for a (t, epsilon)-secure MAC. Then, by analyzing a randomized partition of K, we prove the existence of an approximately optimal (t, epsilon)-secure MAC (in the sense of a large vertical bar S vertical bar). Our ratio (log vertical bar S vertical bar/vertical bar K vertical bar) is much larger than the previous results, where the previous results usually considered only case t = 1 by proposing a good universal hashing. This method is hard to extend to the case of a general t as a universal hashing relates only two inputs, while the general case needs to relate t inputs. Finally, we construct a selectively (1, epsilon)-secure MAC, where an attacker fixes two source states in advance with one for his forgery and the other for his inquiry for a valid message. Our ratio (log vertical bar S vertical bar/vertical bar K vertical bar) in this construction is close to the upper bound of its kind and is significantly larger than our existential result above for case t = 1.

关键词： message authentication code information theoretical security set partition upper bound

来源：评论

学校读者我要写书评

暂无评论

TESLA-Based authentication for BeiDou Civil Navigation message

引用

China Communications 2020年第11期17卷 194-218页

作者： Zhijun Wu Yun Zhang Liang Liu Meng Yue The College of Electronic Information&Automation Civil Aviation University of ChinaTianjin 300300China

Due to the civil BeiDou navigation system is open,unauthenticated,and non-encrypted,civilian BeiDou navigation signals may have great security loopholes during transmission or *** main security loophole here is spoofing *** attacks make the positioning or timing results of BeiDou civilian receivers *** errors may cause a series of security problems,which lays a serious hidden danger for Bei-Dou satellite information *** article proposes an anti-spoofing method for BeiDou navigation system based on the combination of SM commercial cryptographic algorithm and Timed Efficient Stream Loss-tolerant authentication(TESLA)for spoofing *** this solution,we use the SM3 algorithm to generate a TESLA key chain with time information,and then use the key in the key chain to generate the message authentication code for the BeiDou D2 navigation *** message authentication code is inserted into a reserved bit of the D2 navigation *** addition,this solution uses the SM2 algorithm to protect and encrypt time information in the TESLA key chain to prevent key replay attacks in *** experimental results tested on the experimental platform built in this paper show that this scheme reduces the possibility of the BeiDou navigation system being deceived and enhances the safety of the BeiDou navigation system.

关键词： BeiDou navigation system SM commercial cryptographic algorithm TESLA message authentication code D2 navigation message

来源：评论

学校读者我要写书评

暂无评论

Crypto-Aided MAP Test for Low-Latency Detection of False Data in Short Packets

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2021年 16卷 4939-4949页

作者： Kim, Sang Wu Liu, Xudong Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA Zhengzhou Univ Dept Elect Engn Zhengzhou 450001 Peoples R China

Cryptography has been used as the first line of defense to ensure data integrity. However, it incurs a significant overhead for short packets which represent the most common form of traffic in emerging applications, such as the Internet of Things. In this paper, we propose an interdisciplinary framework for detecting false data in short packets that are collected from multiple sources through a relay. The proposed scheme performs a lightweight cryptographic integrity check that employs a short message authentication code, thereby reducing the overhead for data integrity, followed by the maximum a posteriori (MAP) test at the physical layer that detects any remaining false data that the cryptographic integrity check misses. This interdisciplinary approach interplays between the cryptographic integrity check and the physical-layer integrity check to assure the data integrity of short packets with reduced overhead and low latency. The proposed scheme can also provide a significant reduction in the average probability of detection error over the traditional cryptographic integrity check.

关键词： Cryptography Wireless communication Relay networks (telecommunication) codes message authentication Low latency communication Internet of Things False data injection message authentication code MAP test integrity short packet low latency

来源：评论

学校读者我要写书评

暂无评论

CIPHER BLOCK BASED authentication MODULE: A HARDWARE DESIGN PERSPECTIVE

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2011年第2期20卷 163-184页

作者： Michail, Harris E. Schinianakis, Dimitrios Goutis, Costas E. Kakarountas, Athanasios P. Selimis, Georgios Univ Patras Dept Elect & Comp Engn GR-26500 Patras Greece Univ Cent Greece Dept Comp Sci & Biomed Informat GR-35100 Lamia Greece IMEC Holst Ctr NL-5656 AE Eindhoven Netherlands

message authentication codes (MACs) are widely used in order to authenticate data packets, which are transmitted thought networks. Typically MACs are implemented using modules like hash functions and in conjunction with encryption algorithms (like Block Ciphers), which are used to encrypt the transmitted data. However NIST in May 2005 issued a standard, addressing certain applications and their needs, defining a way to implement MACs through FIPS-approved and secure block cipher algorithms. In this paper the best performing implementation of the CMAC standard is presented, in terms of throughput, along with an efficient AES design and implementation.

关键词： message authentication code VLSI cryptography

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cluster based secure authentication technique using ant colony optimization in wireless sensor networks

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2016年第1期31卷 423-432页

作者： Rajesh, D. Hevin Paramasivan, B. St Xaviers Catholic Coll Engn Dept Informat Technol Kanyakumari Tamil Nadu India Natl Engn Coll Dept Comp Sci & Engn Kovilpatti Tamil Nadu India

In cluster based wireless sensor networks the existing technique does not offer security to the cluster head. The communication between the cluster head and the sink is not secured. Also, the technique to prevent malicious cluster head is not provided. In this paper, we propose to design a cluster based secure authentication technique based on ant colony optimization in wireless sensor networks. Initially the sensor nodes are authenticated before they are deployment in the network. The authenticated sensor node with maximum energy and trust value is selected as Cluster Head (CH). The distance among the cluster member and cluster head is estimated using the ant colony optimization (ACO) technique. The estimated distance, trust value and energy consumed by each cluster member are taken as input over fuzzy logic technique to select the secure node for data aggregation. The aggregated data is delivered from the CH to the Base Station (BS) attached with a message authentication code (MAC). By simulation results, we show that the proposed technique improves the secured data communication in the network.

关键词： Ant colony optimization (ACO) technique WSN cluster based secure authentication technique message authentication code clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：