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

LPbT-SSO: Password-Based Threshold Single-Sign-On Authentication From LWE

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2025年第1期22卷 491-504页

作者： Cao, Chenchen Xu, Chunxiang Jiang, Changsong Zhang, Zhao Dong, Xinfeng Chen, Kefei Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Univ Elect Sci & Technol China Yangtze Delta Reg Inst Huzhou Huzhou 313001 Peoples R China Sci & Technol Commun Secur Lab Chengdu 610041 Peoples R China Hangzhou Normal Univ Dept Math Hangzhou 310027 Peoples R China

In networks, clients access various servers. Servers need to authenticate clients' identities and provide services to clients who pass the authentication. Password-based threshold single-sign-on authentication (PbT-SSO) delegates multiple identity servers to authenticate a client with the client's password, and issue a token for subsequent access. However, existing PbT-SSO schemes are based on conventional hardness problems, which are vulnerable to adversaries equipped with quantum computers in the near future. Once quantum computers are accessible, adversaries can retrieve passwords by off-line dictionary guessing attacks (DGA) from the credentials of clients' passwords. Moreover, quantum adversaries can derive identity servers' secret from public information and further forge tokens with the secret. Motivated by these issues, we propose a password-based threshold single-sign-on authentication from learning with errors problem (LWE), dubbed LPbT-SSO, which is resistant to quantum attacks. LPbT-SSO evaluates a one-way function of passwords, and takes the function outputs as credentials. Since the function is grounded on LWE problem intractable for quantum computation, quantum adversaries cannot recover passwords by off-line DGA. Additionally, LPbT-SSO leverages a lattice-based threshold signature scheme to issue tokens, and guarantees that no adversary can forge a valid token. The comprehensive performance evaluation demonstrates that LPbT-SSO is efficient in terms of computation, storage, and communication costs.

关键词： Servers Passwords Authentication Quantum computing Cryptography Computers Security Password-based threshold single-sign-on authentication dictionary guessing attacks tokens forgery attacks lattice-based cryptography learning with errors problem

来源：评论

学校读者我要写书评

暂无评论

A lattice-based signcryption scheme without random oracles

引用

Frontiers of Computer Science 2014年第4期8卷 667-675页

作者： Xiuhua LU Qiaoyan WEN Zhengping JIN Licheng WANG Chunli YANG State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Mathematics and Information Science Langfang Teachers University Langfang 065000 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China

In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.

关键词： signcryption standard model lattice-based cryptography learning with errors problem small integer solution problem

来源：评论

学校读者我要写书评

暂无评论

An Efficient Identity-Based Encryption With Equality Test in Cloud Computing

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2023年第3期11卷 2983-2992页

作者： Yang, Zhichao He, Debiao Qu, Longjiang Ye, Qing Naval Univ Engn Dept Informat Secur Wuhan 430000 Peoples R China Qilu Univ Technol Shandong Acad Sci Shandong Prov Key Lab Comp Networks Jinan 250014 Peoples R China Wuhan Univ Sch Cyber Sci & Engn Wuhan 430000 Peoples R China Natl Univ Def Technol Coll Liberal Arts & Sci Changsha 410000 Peoples R China

Identity-based encryption with equality test (IBEET) provides a feasible way for cloud server partitioning or searching on ciphertexts in the cloud. In that case, the server can judge if two different ciphertexts encrypt the same plaintexts or not. In response to threats posed by quantum computers, lattice-based IBEET schemes have been proposed to make cloud service post-quantum secure. However, those schemes are inefficient and can hardly meet the needs of resource-constrained devices. In this article, an efficient post-quantum IBEET scheme is introduced, which achieves testability by embedding the hash value of plaintext into testing trapdoor instead of encrypting it directly and doubling the size of ciphertext. We also prove that, with the learning With errors (LWE) problem assumption, the new scheme is one-way secure against selective identity and chosen ciphertext attacks (OW-sID-CCA) in quantum secure model. Furthermore, we evaluate the performance of the new construction and demonstrate its efficiency by showing that it only costs about half storage comparing with other lattice-based IBEET schemes. The execution time of encryption and decryption phrases in the new scheme reduce by 50%, while the computational cost in test algorithm keeps the same. Therefore, the new proposed IBEET is much more practical for working in post-quantum cloud computing scenarios.

关键词： Cloud computing Cryptography Servers Encryption Testing Computational modeling Public key equality test identity-based encryption learning with errors problem quantum secure model

来源：评论

学校读者我要写书评

暂无评论

Security estimation of LWE via BKW algorithms

引用

Cybersecurity 2024年第1期7卷 71-87页

作者： Yu Wei Lei Bi Xianhui Lu Kunpeng Wang SKLOIS Institute of Information EngineeringCASBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina

The learning With errors(LWE)problem is widely used in lattice-based cryptography,which is the most promising post-quantum cryptography *** are a variety of LWE-solving methods,which can be classified into four groups:lattice methods,algebraic methods,combinatorial methods,and exhaustive *** Blum–Kalai–Wasserman(BKW)algorithm is an important variety of combinatorial algorithms,which was first presented for solving the learning Parity With Noise(LPN)problem and then extended to solve *** this paper,we give an overview of BKW algorithms for solving *** introduce the framework and key techniques of BKW algorithms and make comparisons between different BKW algorithms and also with lattice methods by estimating concrete security of specific LWE *** also briefly discuss the current problems and potential future directions of BKW algorithms.

关键词： Post-quantum cryptography learning with errors problem Lattice-based cryptography Security estimation

来源：评论

学校读者我要写书评

暂无评论

Full secure identity-based encryption scheme with short public key size over lattices in the standard model

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2016年第6期93卷 854-863页

作者： Wang, Fenghe Liu, ZhenHua Wang, Chunxiao Shandong Jianzhu Univ Dept Math & Phys Jinan Peoples R China Xidian Univ Sch Math & Stat Xian Peoples R China

An efficient identity-based encryption (IBE) scheme over lattice is proposed in this paper. Under the hardness of the learning with errors (LWE) problem, the proposed scheme is semantic secure against adaptive chosen identity and chosen plaintext attack in the standard model. To improve the efficiency of the lattice-based IBE scheme, unlike the identity string is encoded into a matrix by a group of public matrices in several known constructions, the identity string of l bits is encoded into a vector with the help of l + 1 vectors in this paper. With the help of this idea, we achieve the private key extraction of IBE scheme at the same lattice. Then, the public key of the proposed scheme only consists of one n x m matrix and l + 1 vectors, compared with that the public keys of the known lattice-based IBE schemes all consist as a group of n x m matrices. Hence, the public key size of this scheme is shorter than that of the known constructions.

关键词： identity-based encryption lattice learning with errors problem pre-image sampling function the standard model

来源：评论

学校读者我要写书评

暂无评论

Lattice-based Dynamical and Anonymous Broadcast Encryption Scheme 10

Lattice-based Dynamical and Anonymous Broadcast Encryption S...

引用

10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing 3PGCIC

作者： Wang Fenghe Wang Xuan Wang Chunxiao Shandong Jianzhu Univ Dept Math & Phys Jinan 250014 Peoples R China Engn Univ Chinese Armed Police Force Xian 710086 Peoples R China

ISBN: (纸本)9781467394734

This paper proposes a broadcast encryption scheme over lattice which is dynamical and anonymous simultaneously. The dynamic property means that the authorized user is not fixed in proposed scheme, and the broadcaster can send the message to any receiver without any added operation. The anonymous property means that the identity of an authorized receiver is protected efficiently, any outsider attacker would not find the chosen receiver's identity. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE).

关键词： Broadcast Encryption Lattice-based Cryptography Anonymity Dynamic learning with errors problem

来源：评论

学校读者我要写书评

暂无评论

Cold Boot Attacks on Bliss 6th

Cold Boot Attacks on Bliss

引用

6th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT)

作者： Villanueva-Polanco, Ricardo Univ Norte Barranquilla Colombia

ISBN: (纸本)9783030305307;9783030305291

In this paper, we examine the feasibility of cold boot attacks against the BLISS signature scheme. We believe this to be the first time that this has been attempted. Our work is the continuation of the trend to develop cold boot attacks for different schemes as revealed by the literature. But it is also the continuation of the evaluation of post-quantum cryptographic schemes against this class of attack. Particularly, we review the BLISS implementation provided by the strongSwan project. This implementation particularly stores its private key in memory in an interesting way therefore requiring novel approaches to key recovery. We present various approaches to key recovery. We first analyse the key recovery problem in this particular case via key enumeration algorithms, and so propose different techniques for key recovery. We then turn our attention to exploit further the algebraic relation among the components of the private key, and we thus establish a connection between the key recovery problem in this particular case and an instance of learning with errors problem (LWE). We then explore various key recovery techniques to tackle this instance of LWE. In particular, we show a key recovery strategy combining lattice techniques and key enumeration. Finally, we report results from experimenting with one of the key recovery algorithms for a range of parameters, showing it is able to tolerate a noise level of alpha = 0.001 and beta = 0.09 for a parameter set when performing a 2(40) enumeration.

关键词： Cold boot attacks Enumeration algorithms Noisy image Key recovery learning with errors problem

来源：评论

学校读者我要写书评

暂无评论

Anonymous Broadcast Authentication with Logarithmic-Order Ciphertexts from LWE 22nd

Anonymous Broadcast Authentication with Logarithmic-Order Ci...

引用

22nd International Conference on Cryptology and Network Security

作者： Aono, Yoshinori Shikata, Junji Yokohama Natl Univ Inst Adv Sci 79-5 TokiwadaiHodogaya Ku Yokohama Kanagawa 2408501 Japan Natl Inst Informat & Commun Technol 4-2-1 Nukui Kitamachi Koganei Tokyo Japan Yokohama Natl Univ Grad Sch Environm & Informat Sci 79-7 TokiwadaiHodogaya Ku Yokohama Kanagawa 2408501 Japan

ISBN: (纸本)9789819975624;9789819975631

We propose an anonymous broadcast authentication (ABA) scheme to simultaneously control massive numbers of devices within practical resources. As a theoretical foundation, we find a barrier to construct an ABA working with a larger number of devices: there is a trilemma between (i) security, (ii) ciphertext length, and (iii) freedom in the target devices selection. For practical use, we propose ABAs with a ciphertext size of O(logN) where N is the number of target devices while we impose a certain restriction on (iii). We provide an ABA template and instantiate it into a specific scheme from the learning with errors (LWE) problem. Then, we give estimation of size and timing resources.

关键词： Anonymous broadcast authentication IoT Network learning with errors problem

来源：评论

学校读者我要写书评

暂无评论

Full Secure Identity-based Encryption Scheme over Lattices in the Standard Model 10

Full Secure Identity-based Encryption Scheme over Lattices i...

引用

10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing 3PGCIC

作者： Wang Jizhong Wang Chunxiao Shandong Jianzhu Univ Dept Math & Phys Jinan 250014 Peoples R China

ISBN: (纸本)9781467394734

Using a known lattice-based chosen plain-text secure encryption scheme and the Bonsai trees primitive, a identity-based encryption (IBE) scheme is proposed in this paper. A public matrices chosen rule that has been used in a known efficient lattice-based chosen ciphtertext secure encryption scheme is used in this paper to reduce the public key size and the message-to ciphtertext expanse factor. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Since a new public key chosen rule is used in our design scheme, the public key size of the proposed scheme would be short. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.

关键词： Broadcast Encryption Lattice-based Cryptography Anonymity Dynamic learning with errors problem

来源：评论

学校读者我要写书评

暂无评论

Efficient hierarchical identity based encryption scheme in the standard model over lattices

引用

Frontiers of Information Technology & Electronic Engineering 2016年第8期17卷 781-791页

作者： Feng-he WANG Chun-xiao WANG Zhen-hua LIU Department of Mathematics and Physics Shandong Jianzhu University Jinan 250014 China School of Mathematics and Statistics Xidian University Xi'an 710071 China

Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption（HIBE） scheme in the standard model whose public key size is only（dm^2＋ mn） log q bits and whose message-ciphertext expansion factor is only log q, where d is the maximum hierarchical depth and（n, m, q）are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is（2dm^2＋ mn ＋ m） log q. To reduce the message-ciphertext expansion factor of the proposed scheme to log q, the encryption algorithm of this scheme is built based on Gentry＇s encryption scheme, by which m^2 bits of plaintext are encrypted into m^2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.

关键词： Hierarchical identity based encryption scheme Lattice-based cryptography Standard model learning with errors problem Gaussian

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：