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

pseudo-random functions and Parallelizable Modes of Operations of a Block Cipher

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第8期57卷 4025-4037页

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

A general result is proved for constructions which use a pseudo-random function (PRF) with a "small" domain to build a PRF with a "large" domain. This result is used to analyse a new block-cipher based parallelizable PRF, called iPMAC which improves upon the well-known PMAC algorithm. New authenticated encryption schemes are described and then combined with iPMAC to obtain new schemes for authenticated encryption with associated data. Improvements over well known schemes such as the offset codebook (OCB) mode include avoiding a design-stage discrete logarithm computation, a small speed-up and a smaller size decryption algorithm.

关键词： Authenticated encryption authenticated encryption with associated data authentication message authentication PMAC pseudo-random function

来源：评论

学校读者我要写书评

暂无评论

A New Class of pseudo-random functions

A New Class of Pseudo-random Functions

引用

Asia-Pacific Conference on Information Processing (APCIP 2009)

作者： Huang, Huawei S China Agr Univ Coll Informat Guangzhou 510642 Guangdong Peoples R China

ISBN: (纸本)9780769536996

This paper proposes a new construction of pseudo-random functions based on an extended decisional Diffie-Hellman (EDDH) problem proposed by Huang et al. The new construction is pseudo-random if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new pseudo-random function is a good replacement for Naor-Reingold pseudo-random function when bilinear group is adopted as construction platform.

关键词： pseudo-random function DDH problem Bilinear groups

来源：评论

学校读者我要写书评

暂无评论

Designing a Secure Round function Based on Chaos

引用

China Communications 2020年第5期17卷 29-37页

作者： Bin Lu Xin Ge Fenlin Liu Zhengzhou Information Science and Technology Institute Zhengzhou 45000China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 45000China

A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.

关键词： image encryption round function chaos pseudo-random function

来源：评论

学校读者我要写书评

暂无评论

An efficient random key distribution scheme for large-scale distributed sensor networks

引用

SECURITY AND COMMUNICATION NETWORKS 2011年第2期4卷 162-180页

作者： Das, Ashok Kumar Int Inst Informat Technol Dept Comp Sci & Engn Bhubaneswar 751013 Orissa India Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

Key establishment in sensor networks is a challenging problem because of resource constraints of the sensors. Due to resource limitations and vulnerable to physical capture of the sensor nodes, the classical public-key routines are impractical in most sensor network architectures. In this paper, we propose a new random key pre-distribution scheme. Our scheme always defines a relationship between the ids of neighbor nodes and the keys possessed by those nodes while maintaining the required randomness in choice of keys. Our proposed scheme provides better security against node capture attack than the existing random key pre-distribution schemes. Moreover, it has better trade-off between communication overhead, network connectivity and security against node capture compared to the existing random key pre-distribution schemes. In addition, it supports dynamic node addition efficiently after initial deployment of the nodes in the network. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： key establishment sensor networks key pre-distribution pseudo-random function security

来源：评论

学校读者我要写书评

暂无评论

A New Class of pseudo-random functions

A New Class of Pseudo-random Functions

引用

2009 Asia-Pacific Conference on Information Processing

作者： Huawei Huang College of Information South China Agricultural University Guangzhou 510642, China

关键词： pseudo-random function DDH problem Bilin-ear groups

来源：评论

学校读者我要写书评

暂无评论

Authentication Scheme Using Pre-Registered Information on Blockchain

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2019年第9期E102D卷 1676-1678页

作者： Tsuchida, Toshiki Takita, Makoto Shiraishi, Yoshiaki Mohri, Masami Takano, Yasuhiro Morii, Masakatu Kobe Univ Kobe Hyogo 6578501 Japan Gifu Univ Gifu 5011193 Japan

In the context of Cyber-Physical System (CPS), analyzing the real world data accumulated in cyberspace would improve the efficiency and productivity of various social systems. Towards establishing data-driven society, it is desired to share data safely and smoothly among multiple services. In this paper, we propose a scheme that services authenticate users using information registered on a blockchain. We show that the proposed scheme has resistance to tampering and a spoofing attack.

关键词： blockchain authentication Internet of Things pseudo-random function service cooperation

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving location-based service protocols with flexible access

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2019年第3期20卷 412-423页

作者： Tang, Shuyang Liu, Shengli Huang, Xinyi Liu, Zhiqiang Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Fujian Normal Univ Sch Math & Comp Sci Fuzhou Fujian Peoples R China

We propose an efficient privacy-preserving, content-protecting location-based service (LBS) scheme. Our proposal gives refined data classification and uses generalised ElGamal to support flexible access to different data classes. We also make use of pseudo-random function (PRF) to protect users' position query. Since PRF is light-weight primitive, our proposal enables the cloud server to locate position efficiently while preserving the privacy of the queried position.

关键词： location-based services LBS outsourced cloud security privacy preserving public-key cryptosystems pseudo-random function PRF ElGamal cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring

引用

INFORMATION PROCESSING LETTERS 1999年第2期70卷 83-87页

作者： Biham, E Boneh, D Reingold, O Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Stanford Univ Dept Comp Sci Stanford CA 94305 USA Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

The Diffie-Hellman key-exchange protocol may naturally be extended to k > 2 parties. This gives rise to the generalized Diffie-Hellman assumption (GDH-Assumption). Naor and Reingold have recently shown an efficient construction of pseudo- random functions and proved its security based on the GDH-Assumption. In this note, we prove that breaking this assumption module a so called Blum-integer would imply an efficient algorithm for factorization. Therefore, both the key-exchange protocol and the pseudo-random functions are secure as long as factoring Blum-integers is hard. Our reduction strengthen a previous "worst-case" reduction of Shmuely (1985). (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： cryptography Diffie-Hellman assumption factoring key-exchange pseudo-random function

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving model for biometric-based authentication and Key Derivation function

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2023年 78卷

作者： Italis, Olson Pierre, Samuel Quintero, Alejandro Polytech Montreal Dept Comp & Software Engn 2500 Chem Polytech Montreal PQ H3T 1J4 Canada

Bio-cryptosystems often save the biometric template for authentication and generally employ randomly generated keys to encrypt and sign data. This method raises privacy protection concerns. Furthermore, for a system secured by the usage of a cryptographic key, losing the key often has disastrous consequences. To overcome the privacy issues, and allow the secure recovery of lost keys, we design a Key Derivation function to extract a key from biometric data: a new method - based on clustering algorithms - detects consistent and discriminative features from biometric characteristics to create a code. Then, HMAC-SHA256 (as specified by the National Institute of Standards and Technology) generates a standard key from the code. To reproduce the code at future times (that also serves for authentication), the Key Derivation function stores helper data with the guarantee of privacy. Indeed, with a private face dataset, the probability of generating the code with only the helper data is less than 2-300, and less than 2-246 for a subset of the YouTube Face database. Moreover, on the private database and the tested users from the YouTube Face database, our system has a false acceptance rate of 0%. It corrects up to 40.3% of noise levels on the private database and has good management of the inter-user variability.

关键词： Biometric data Fuzzy extractor Clustering algorithms Key derivation function Privacy pseudo-random function

来源：评论

学校读者我要写书评

暂无评论

An External Data Integrity Tracking and Verification System for Universal Stream Computing System Framework 21

An External Data Integrity Tracking and Verification System ...

引用

21st International Conference on Advanced Communication Technology (ICACT)

作者： Wang Hongyuan China Acad Elect & Informat Technol LoongCloud Common Prod Res Inst Beijing Peoples R China

ISBN: (纸本)9791188428021

With the development of the cloud computing and big data, massive data based computing and storage have emerged as core technologies. Moreover, a key problem to ensure data availability and analysis accuracy is the data integrity which has received extensive attention. Compared to the mature solution in the batch computing, the data integrity in the stream computing did not receive due attention. However, the characters of timeliness, volatility, suddenness and disorder of big data make the data integrity in the stream computing a very difficult problem. Based on the framework of current general stream computing system, in this paper, we construct an externally data integrity tracking and verification system for the real-time tracking and analysing of the data content and processing path of each message, and the discovering of the data integrity problem. We use the common cryptographic algorithm to construct a universal data integrity tracking and verification scheme outside the stream computing system to ensure the integrity and consistency of the data. Then we give the formal security analysis in standard model, and perform simulations in cloud environment. Results show that the proposed system can verify data integrity efficiently without compromising the efficiency.

关键词： Stream computing system data integrity verification homomorphic message authentication code pseudo-random function security proof

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：