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

14th International Conference on Information Security Practice and Experience (ISPEC)

作者： Luo, Fucai Wang, Kunpeng Lin, Changlu Univ Chinese Acad Sci Sch Cyber Secur Beijing Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing Peoples R China Fujian Normal Univ Coll Math & Informat Fuzhou Fujian Peoples R China

ISBN: (纸本)9783319998077;9783319998060

hierarchical identity-based fully homomorphic encryption (HIBFHE) aggregates the advantages of both fully homomorphic encryption (FHE) and hierarchical identity-based encryption (HIBE) that permits data encrypted by HIBE to be processed homomorphically. This paper mainly constructs a new leveled HIBFHE scheme based on Learning with Rounding (LWR) problem, which removes Gaussian noise sampling in encryption process. In more detail, we use the lattice basis delegation method proposed by Agrawal, Boneh and Boyen at CRYPTO 2010 to generate delegated basis, while cleverly exploit a scaled rounding function of LWR problem to hide plaintext rather than adding an auxiliary Gaussian noise matrix. Besides, Gentry, Sahai and Waters constructed the first leveled LWE-based HIBFHE schemes from identitybased encryption scheme at CRYPTO 2013, in this work, however, we also focus on improving their leveled HIBFHE scheme, using AlperinSheriff and Peikert's technically simpler method. We prove that our schemes are adaptively secure under classic lattice hardness assumptions.

关键词： FHE hierarchical identity-based encryption Learning with Rounding

来源：评论

学校读者我要写书评

暂无评论

identity-based hierarchical Key-Insulated encryption Without Random Oracles 19th

Identity-Based Hierarchical Key-Insulated Encryption Without...

引用

19th IACR International Conference on the Theory and Practice of Public-Key Cryptography (PKC)

作者： Watanabe, Yohei Shikata, Junji Yokohama Natl Univ Grad Sch Environm & Informat Sci Yokohama Kanagawa Japan Yokohama Natl Univ Inst Adv Sci Yokohama Kanagawa Japan AIST Informat Technol Res Inst Tokyo Japan

ISBN: (纸本)9783662493847;9783662493830

Key-insulated encryption is one of the effective solutions to a key exposure problem. Recently, identity-based encryption (IBE) has been used as one of fundamental cryptographic primitives in a wide range of various applications, and it is considered that the identity-based key-insulated security has a huge influence on the resulting applications. At Asiacrypt'05, Hanaoka et al. proposed an identity-based hierarchical key-insulated encryption (hierarchical IKE) scheme. Although their scheme is secure in the random oracle model, it has a "hierarchical key-updating structure," which is attractive functionality that enhances key exposure resistance. In this paper, we first propose the hierarchical IKE scheme without random oracles. Our hierarchical IKE scheme is secure under the symmetric external Diffie-Hellman (SXDH) assumption, which is known as the simple and static one. Furthermore, when the hierarchy depth is one (i.e. not hierarchical case), our scheme is the first IKE scheme that achieves constant-size parameters including public parameters, secret keys, and ciphertexts.

关键词： Key-insulated encryption identity-based hierarchical key-insulated encryption hierarchical identity-based encryption Asymmetric pairing

来源：评论

学校读者我要写书评

暂无评论

Dual trapdoor identity-based encryption with keyword search

引用

SOFT COMPUTING 2017年第10期21卷 2599-2607页

作者： Liu, Jia'nan Lai, Junzuo Huang, Xinyi Jinan Univ Coll Informat Sci & Technol Guangzhou 510632 Guangdong Peoples R China Fujian Normal Univ Sch Math & Comp Sci Fujian Prov Key Lab Network Secur & Cryptol Fuzhou 350007 Peoples R China Nanjing Univ Informat Sci & Technol Nanjing Jiangsu Peoples R China

identity-based encryption with keyword search (IBEKS) is a useful cryptographic primitive for cloud computing, i.e., it allows a data owner to encrypt and store his data in a cloud storage server, and later the owner can use his/her private key to produce a search trapdoor for searching the encrypted data. Existing IBEKS schemes only focus on supporting efficient and complex queries for the private key holder, while the authority, who is in charge of the generation of the private keys for users, cannot efficiently search the encrypted data. However, some applications might require the authority to efficiently search the encrypted data intended for any user. To address this problem, in this paper, we introduce a new primitive named dual trapdoor identity-based encryption with keyword search (DTIBEKS). In this primitive, the authority can use a peculiar way to produce one more trapdoor, which allows the authority to search any identity's encrypted data. We formally give the definition and security model for DTIBEKS, and then propose a novel DTIBEKS scheme. We further prove the security of our proposed DTIBEKS without random oracles. It is worth noting that our scheme can be easily transformed into identity-based encryption with fuzzy keyword search.

关键词： Cloud computing Fuzzy keyword search identity-based encryptionwith keyword search hierarchical identity-based encryption Dual system encryption

来源：评论

学校读者我要写书评

暂无评论

Quantum-Safe HIBE: Does It Cost a Latte?

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2024年 19卷 2680-2695页

作者： Zhao, Raymond K. Mccarthy, Sarah Steinfeld, Ron Sakzad, Amin O'Neill, Maire Monash Univ Fac Informat Technol Clayton Vic 3800 Australia CSIROs Data61 Marsfield NSW 2122 Australia Univ Waterloo Inst Quantum Comp Waterloo ON N2L 3G1 Canada Queens Univ Belfast Ctr Secure Informat Technol Belfast BT3 9DT North Ireland

The United Kingdom (UK) government is considering advanced primitives such as identity-based encryption (IBE) for adoption as they transition their public-safety communications network from TETRA to an LTE-based service. However, the current LTE standard relies on elliptic-curve-based IBE, which will be vulnerable to quantum computing attacks, expected within the next 20-30 years. Lattices can provide quantum-safe alternatives for IBE. These schemes have shown promising results in terms of practicality. To date, several IBE schemes over lattices have been proposed, but there has been little in the way of practical evaluation. This paper provides the first complete optimised practical implementation and benchmarking of Latte, a promising hierarchical IBE (HIBE) scheme proposed by the UK National Cyber Security Centre (NCSC) in 2017 and endorsed by European Telecommunications Standards Institute (ETSI). We propose optimisations for the KeyGen, Delegate, Extract and Gaussian sampling components of Latte, to increase attack costs, reduce decryption key lengths by 2x-3x, ciphertext sizes by up to 33%, and improve speed. In addition, we conduct a precision analysis, bounding the Renyi divergence of the distribution of the real Gaussian sampling procedures from the ideal distribution in corroboration of our claimed security levels. Our resulting implementation of the Delegate function takes 0.4 seconds at 80-bit security level on a desktop machine at 4.2GHz, significantly faster than the order of minutes estimated in the ETSI technical report. Furthermore, our optimised Latte Encrypt/Decrypt implementation reaches speeds up to 9.7x faster than the ETSI implementation.

关键词： Lattices Cryptography Standards Matrix decomposition encryption Quantum computing Public key Lattice-based cryptography hierarchical identity-based encryption advanced primitives software design post-quantum

来源：评论

学校读者我要写书评

暂无评论

Anonymous HIBE with short ciphertexts: full security in prime order groups

引用

DESIGNS CODES AND CRYPTOGRAPHY 2015年第2期74卷 395-425页

作者： Lee, Kwangsu Park, Jong Hwan Lee, Dong Hoon Korea Univ Ctr Informat Secur Technol Seoul South Korea Columbia Univ Dept Comp Sci New York NY 10027 USA Sangmyung Univ Div Comp Sci Seoul South Korea

Anonymous hierarchical identity-based encryption (HIBE) is an extension of identity-based encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to anonymous communication systems and public key encryption systems with keyword searching. However, previous anonymous HIBE schemes have some disadvantages that the security was proven in the weaker model, the size of ciphertexts is not short, or the construction was based on composite order bilinear groups. In this paper, we propose the first efficient anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and prove its security in the full model with an efficient reduction. To achieve this, we use the dual system encryption methodology of Waters. We also present the benchmark results of our scheme by measuring the performance of our implementation.

关键词： identity-based encryption hierarchical identity-based encryption Anonymity Full model security Bilinear maps

来源：评论

学校读者我要写书评

暂无评论

Algorithms for the Generalized NTRU Equations and their Storage Analysis

引用

FUNDAMENTA INFORMATICAE 2020年第2期177卷 115-139页

作者： Cho, Gook Hwa Lim, Seongan Lee, Hyang-Sook Ewha Womans Univ Inst Math Sci Seoul South Korea Ewha Womans Univ Dept Math Seoul South Korea

In LATTE, a lattice based hierarchical identity-based encryption (HIBE) scheme, each hierarchical level user delegates a trapdoor basis to the next level by solving a generalized NTRU equation of level l >= 3. For l = 2, Howgrave-Graham, Pipher, Silverman, and Whyte presented an algorithm using resultant and Pornin and Prest presented an algorithm using a field norm with complexity analysis. Even though their ideas of solving NTRU equations can be conceptually extended for l >= 3, no explicit algorithmic extensions with the storage analysis are known so far. In this paper, we interpret the generalized NTRU equation as the determinant of a matrix. By using the mathematical properties of the determinant, we show that how to construct algorithms for solving the generalized NTRU equation either using resultant or a field norm for any l >= 3. We also obtain an upper bound of the size of solutions by using the properties of the determinant. From our analysis, the storage requirement of the algorithm using resultant is O(l(2)n(2) log B) and that of the algorithm using a field norm is O(l(2)n log B), where B is an upper bound of the coefficients of the input polynomials of the generalized NTRU equations. We present examples of our algorithms for l = 3 and the average storage requirements for l = 3, 4.

关键词： NTRU LATTE hierarchical identity-based encryption

来源：评论

学校读者我要写书评

暂无评论

Identifier discrimination: realizing selective-ID HIBE with authorized delegation and dedicated encryption privacy

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2019年第2期18卷 141-162页

作者： Zheng, Jian-Wu Zhao, Jing Guan, Xin-Ping Shijiazhuang Tiedao Univ Shijiazhuang 050043 Hebei Peoples R China Shanghai Jiao Tong Univ Shanghai 200240 Peoples R China

It has been almost one and a half decades since the introduction of the concept of hierarchical identity-based encryption (HIBE) systems, and many pairing-based HIBE systems have been proposed;however, how to achieve independent private key delegation in HIBE systems is still open. Independent private key delegation in HIBE systems requires that the following three conditions are satisfied: (1) private keys are not valid delegation credentials for deriving descendants' private keys, (2) any entity intending to derive a private key for any one of its descendants should own a valid delegation credential distributed by the root private key generator (PKG), and (3) a credential is only valid for deriving private keys for a given descendant. We present a new technique for composing private keys for entities in HIBE systems that we call identifier discrimination, aiming at resolving the problem of independent private key delegation. With the technique, we construct a selective identity secure HIBE system under the decisional bilinear Diffie-Hellman (DBDH) assumption in the standard model with the following properties. (1) Every entity in the HIBE system is prevented from deriving private keys for its descendants with the only use of its private key and the public parameters. (2) The root PKG can delegate the privilege (if needed) of generating private keys for each individual entity to any of its ancestors through authorization that we call authorized delegation, by distributing a specifically crafted secret (delegation credential) to the ancestor. (3) The encryption privacy of each ciphertext for its intended recipient is achieved, that is, ciphertexts encrypted on identity of any entity cannot be decrypted by any of its ancestors that we call dedicated encryption privacy.

关键词： hierarchical identity-based encryption Authorized delegation encryption privacy Identifier discrimination

来源：评论

学校读者我要写书评

暂无评论

Time-specific encryption from forward-secure encryption: generic and direct constructions

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2016年第5期15卷 549-571页

作者： Kasamatsu, Kohei Matsuda, Takahiro Emura, Keita Attrapadung, Nuttapong Hanaoka, Goichiro Imai, Hideki NTT Software Corp Yokohama Kanagawa Japan Natl Inst Adv Ind Sci & Technol Tokyo Japan Natl Inst Informat & Commun Technol NICT Tokyo Japan Univ Tokyo Tokyo Japan

Paterson and Quaglia (SCN 2010) proposed the concept of time-specific encryption (TSE) and its efficient constructions. TSE is a type of public-key encryption with an additional functionality where an encryptor can specify a suitable time interval, meaning that the ciphertexts may only be decrypted within this time interval. In this work, we propose a new methodology for designing efficient TSE schemes by using forward-secure encryption (FSE), and based on this methodology, we present a specific TSE scheme using Boneh-Boyen-Goh FSE, and a generic construction from any FSE. Our proposed TSE schemes are practical in all aspects with regard to computational costs and data sizes. The sizes of the ciphertext and the public parameter in our schemes are significantly smaller than those in previous schemes in an asymptotic sense.

关键词： Time-specific encryption Forward-secure encryption hierarchical identity-based encryption

来源：评论

学校读者我要写书评

暂无评论

Bonsai Trees, or How to Delegate a Lattice Basis

引用

JOURNAL OF CRYPTOLOGY 2012年第4期25卷 601-639页

作者： Cash, David Hofheinz, Dennis Kiltz, Eike Peikert, Chris IBM TJ Watson Res Ctr Hawthorne NY USA Karlsruhe Inst Technol Karlsruhe Germany Ruhr Univ Bochum Dept Math Bochum Germany Georgia Inst Technol Atlanta GA 30332 USA

We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include an efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and the first hierarchical identity-based encryption (HIBE) scheme (also in the standard model) that does not rely on bilinear pairings. Interestingly, the abstract properties of bonsai trees seem to have no known realization in conventional number-theoretic cryptography.

关键词： Lattices hierarchical identity-based encryption Digital signatures Bonsai trees

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a Compact Anonymous HIBE with Constant Size Private Keys

引用

COMPUTER JOURNAL 2019年第8期62卷 1087-1091页

作者： Lin, Xi-Jun Sun, Lin Qu, Haipeng Xian, He-Qun Ocean Univ China Dept Comp Sci & Technol Qingdao 266100 Shandong Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China Qingdao Univ Coll Liberal Arts Qingdao 266071 Shandong Peoples R China Qingdao Univ Coll Comp Sci & Technol Qingdao 266071 Shandong Peoples R China

Recently, Zhang et al. proposed a new anonymous hierarchical identity-based encryption (anonymous HIBE) over prime order groups to achieve both constant size private key and constant size ciphertext. Moreover, a double exponent technique was used to provide anonymity. They proved that their scheme is secure and anonymous against chosen plaintext attacks in the standard model. In this paper, we point out that their scheme is insecure.

关键词： hierarchical identity-based encryption anonymous constant size

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：