检索结果-南通市图书馆

Committed-programming reductions: formalizations,implications and relations

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第10期67卷 151-171页

作者： Jiang ZHANG Yu YU Dengguo FENG Shuqin FAN Zhenfeng ZHANG State Key Laboratory of Cryptology Department of Computer Science and Engineering Shanghai Jiao Tong University Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences

In this work, we introduce a class of black-box(BB) reductions called committed-programming reduction(CPRed) in the random oracle model(ROM) and obtain the following interesting results:(1) we demonstrate that some well-known schemes, including the full-domain hash(FDH) signature(Eurocrypt1996) and the Boneh-Franklin identity-based encryption(IBE) scheme(Crypto 2001), are provably secure under CPReds;(2) we prove that a CPRed associated with an instance-extraction algorithm implies a reduction in the quantum ROM(QROM). This unifies several recent results, including the security of the Gentry-Peikert-Vaikuntanathan IBE scheme by Zhandry(Crypto 2012) and the key encapsulation mechanism(KEM) variants using the Fujisaki-Okamoto transform by Jiang et al.(Crypto 2018) in the ***, we show that CPReds are incomparable to non-programming reductions(NPReds) and randomly-programming reductions(RPReds) formalized by Fischlin et al.(Asiacrypt 2010).

关键词： provable security random oracle model quantum random oracle model black-box reduction/separation programmability

An Efficient and Provably Secure SM2 Key-Insulated Signature Scheme for Industrial Internet of Things

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

工程与科学中的计算机建模(英文) 2024年第1期138卷 903-915页

作者： Senshan Ouyang Xiang Liu Lei Liu Shangchao Wang Baichuan Shao Yang Zhao School of Mechanical Engineering Northwestern Polytechnical UniversityXi’anChina Department of Process and Information Technology Chengdu Aircraft Industrial(Group)Co.Ltd.ChengduChina School of Information and Software Engineering The Network and Data Security Key Laboratory of Sichuan ProvinceUniversity of Electronic Science and Technology of ChinaChengduChina

With the continuous expansion of the Industrial Internet of Things(IIoT),more andmore organisations are placing large amounts of data in the cloud to reduce ***,the channel between cloud servers and smart equipment is not trustworthy,so the issue of data authenticity needs to be *** SM2 digital signature algorithm can provide an authentication mechanism for data to solve such ***,it still suffers from the problem of key *** order to address this concern,this study first introduces a key-insulated scheme,SM2-KI-SIGN,based on the SM2 *** scheme boasts strong key insulation and secure *** scheme uses the elliptic curve algorithm,which is not only more efficient but also more suitable for IIoT-cloud ***,the security proof of SM2-KI-SIGN is given under the Elliptic Curve Discrete Logarithm(ECDL)assumption in the random oracle.

关键词： Key-insulated SM2 algorithm digital signature Industrial Internet of Things(IIoT) provable security

A leakage-resilient certificateless public key encryption scheme with CCA2 security

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2018年第4期19卷 481-493页

作者： Yan-wei ZHOU Bo YANG Hao CHENG Qing-long WANG School of Computer Science Shaanxi Normal University School of Information Engineering Chang'an University

In recent years,much attention has been focused on designing provably secure cryptographic primitives in the presence of key *** constructions of leakage-resilient cryptographic primitives have been ***,for any polynomial time adversary,most existing leakage-resilient cryptographic primitives cannot ensure that their outputs are random,and any polynomial time adversary can obtain a certain amount of leakage on the secret key from the corresponding output of a cryptographic *** this study,to achieve better performance,a new construction of a chosen ciphertext attack 2(CCA2)secure,leakage-resilient,and certificateless public-key encryption scheme is proposed,whose security is proved based on the hardness of the classic decisional Diffie-Hellman *** to our analysis,our method can tolerate leakage attacks on the private *** method also achieves better performance because polynomial time adversaries cannot achieve leakage on the private key from the corresponding ciphertext,and a key leakage ratio of 1/2 can be *** of these good features,our method may be significant in practical applications.

关键词： Certificatetess public-key encryption Leakage-resilience provable security CCA2 security Decisional Diffie-Hellman

Modular approach to the design and analysis of password-based security protocols

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2007年第3期50卷 381-398页

作者： FENG DengGuo CHEN WeiDong State Key Laboratory of Information security Institute of Software Chinese Academy of Sciences Beijing100080 China

In this paper, a general framework for designing and analyzing password-based security protocols is presented. First we introduce the concept of ＂weak computational indistinguishability＂ based on current progress of password-based security protocols. Then, we focus on cryptographic foundations for password-based security protocols, i.e., the theory of ＂weak pseudorandomness＂. Furthermore, based on the theory of weak pseudorandomness, we present a modular approach to design and analysis of password-based security protocols. Finally, applying the modular approach, we design two kinds of password-based security protocols, i.e., password-based session key distribution （PSKD） protocol and protected password change （PPC） protocol. In addition to having forward secrecy and improved efficiency, new protocols are proved secure.

关键词： security protocols weak computational indistinguishability provable security random oracle model (ROM) standardmodel

A Formal Model for the security of Proxy Signature Schemes

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第1期10卷 275-278页

作者： GUChun-xiang ZHUYue-fei ZHANGYa-juan NetworkEngineeringDepartment InformationEngineeringUniversityZhengzhou450002HenanChina

This paper provides theoretical foundations for the secure proxy signatureprimitive. We pres-enta formal model for the security of proxy signature schemes, which defines thecapabilities of the adversary and the security goals to capture which mean for a prox-ysignaturescheme to be secure. Then, we present an example of proxy signature scheme that can be proven securein the standard model.

关键词： provable security digital signature proxy signature

Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme

在线全文

学校读者我要写书评

暂无评论

Science China Mathematics 2013年第7期56卷 1385-1401页

作者： CHEN Yu CHEN LiQun LIN DongDai State Key Laboratory of Information security (SKLOIS) Institute of Information Engineering Chinese Academy of Sciences Hewlett Packard Labs Long Down Avenue Stoke Gifford Bristol BS34 8QZ UK

In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement.

关键词： identity-based encryption Fujisaki-Okamoto transformation provable security cascading reduction

security model and modular design of fair authentication key exchange protocols

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第2期53卷 278-287页

作者： FENG DengGuo & CHEN WeiDong State Key Laboratory of Information security, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China State Key Laboratory of Information security Institute of Software Chinese Academy of Sciences Beijing China

It is traditionally assumed that the legal two parties in authentication key exchange (AKE) communications are both credible. However, in more and more network applications nowadays, it is often required that such protocols be run under the circumstances where ones do not trust in each other. Therefore, in this paper we propose the idea of fair authentication key exchange (FAKE), which has not only the basic properties of AKE protocols, but also some new properties: the "session proof" embedded in the input of protocols by the customer; and if not revealed, the protocols have the deniability, otherwise the transcript of protocol is binding for the identifications. Such a method is capable of solving the contradiction between protecting privacy and the dissension on network service. Then the security model of FAKE protocols is formulated systematically and a flaw of the security model of current signature schemes proposed by Kudla is also corrected. Finally, a kind of FAKE protocol based on current signature schemes is designed and the mBJM-AK security, conditional deniability and fairness of FAKE protocols are proved in the random oracle model.

关键词： authentication key exchange protocols deniability fairness concurrent signature provable security

A Flaw in the security Proof of BDOP-PEKS and PEKS-STAT

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 25-28页

作者： ZHANG Yajuan ZHU Yuefei GU Chunxiang FU Changchun Institute of Information Engineering InformationEngineering University Zhengzhou 450002 Henan China Key Laboratory of Information Engineering GuangzhouUniversity Guangzhou 510006 Guangdong China School of Computer Wuhan University Wuhan 430072Hubei China

provable security has been widely used for analyzing the security of cryptosystems. Its main idea is to reduce the security to some well-defined computational assumption. The reduction process is called the security proof. In this paper, we find a flaw in the security proof of BDOP-PEKS and PEKS-STAT, present a new conclusion for the security of BDOP-PEKS, and give a security proof. The flaw in the security proof of PEKS-STAT can be fixed in the same way. Finally we conclude some steps of security proof, and emphasize that the probability is as important as the construction.

关键词： provable security public key encryption with keyword search(PEKS) GBDH BDOP-PEKS PEKS-IND-CKA

EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUT RANDOM ORACLES

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2010年第6期23卷 1167-1182页

作者： Piyi YANG Zhenfu CAO Xiaolei DONG Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai 200240 China.

This paper defines the security notion for Certificateless Threshold Signatures （CLTHS）. Different from the adversarial model defined by Wang, et al. （2007）, our definition considers Type I and Type II adversary separately. At the same time, the authors develop the simulatability and relationship between certificateless threshold signature and the underlying certificateless signature. We also propose the first CLTHS scheme which is proved existentially unforgeable against adaptively chosen message attack without random oracles. Compared with the previous scheme by Wang, et al. （2007）, our scheme does not use hash function and is more efficient.

关键词： Certificateless digital signature key escrow provable security threshold robustness simulatabiltiy.