检索结果-南通市图书馆

Efficient Identity Based Signcryption Scheme with Public Verifiability and forward security

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第1期10卷 248-250页

作者： FEIFei-yu CHENWen CHENKe-fei MAChang-she DepartmentofComputerScienceandEngineering ShanghaiJiaotongUniversityShanghai200030China

In this paper, we point out that Libert and Quisquater’s signcryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some-what more efficient than Libert and Quisquater’s one.

关键词： signcryption identity based public verifiability forward security

Efficient ldentity Based Signcryption Scheme with Public Verifiability and forward security

在线全文

学校读者我要写书评

暂无评论

Efficient ldentity Based Signcryption Scheme with Public Ver...

LaTLS: A Lattice-Based TLS Proxy Protocol

The 1st Chinese Conference on Trusted Computing and Information security

作者： LEI Fei-yu, CHEN Wen, CHEN Ke-fei,MA Chang-she Department of Computer Science and Engineering. Shanghai Jiaotong University, Shanghai 200030,China

＜正＞ In this paper, we point out that Libert and Quisquater’s signeryption scheme cannot provide public *** we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiabilityand forward security at the same time. Under the BilinearDiffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be somewhatmore efficient than Libert and Quisquater’s one.

关键词： signcryption identity based pulili(?) verifiability forward security

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2022年第2期31卷 313-321页

作者： ZHANG Xinglong CHENG Qingfeng LI Yuting State Key Laboratory of Mathematical Engineering and Advanced Computing

The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two-party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice. This paper analyzes the classic agent protocol mcTLS and pointed out the security issues. We focus on the security of TLS 1.3 and proposed a lattice-based multi-party proxy protocol:La TLS. LaTLS can be proved secure in the eCK model, it can resist key-sharing attacks, counterfeiting attacks, replay attacks, and achieve forward security. Compared with traditional DH and ECDH schemes, LaTLS is more effcient. Its security is based on the shortest vector problem, therefor it has anti-quantum attack properties.

关键词： security issues Internet lattice-based multiparty proxy protocol relatively few proxy protocols data exchanged LaTLS key sharing attacks unsafe multiparty protocol Internet proxy shortest vector problem protocols antiquantum attack properties forward security two-party secure communication protocol classic agent protocol mcTLS classic agent protocol computer network security

A Secure Elliptic Curve-Based RFID Protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2009年第2期24卷 309-318页

作者： Santi Martínez Magda Valls Concepció Roig Josep M. Miret Francesc Giné Computer Science Department Universitat de Lleida Mathematics Department Universitat de Lleida

Nowadays, the use of Radio Frequency Identification （RFID） systems in industry and stores has increased Nevertheless, some of these systems present privacy problems that may discourage potential users. Hence, high confidence and efficient privacy protocols are urgently needed. Previous studies in the literature proposed schemes that are proven to be secure, but they have scalability problems. A feasible and scalable protocol to guarantee privacy is presented in this paper. The proposed protocol uses elliptic curve cryptography combined with a zero knowledge-based authentication scheme. An analysis to prove the system secure, and even forward secure is also provided.

关键词： elliptic curve cryptography forward security RFID zero knowledge

Key-insulated encryption based group key management for wireless sensor network

在线全文

学校读者我要写书评

暂无评论

Journal of Central South University 2013年第5期20卷 1277-1284页

作者：邱卫东周耀伟朱博郑燕飞龚征 School of Information security Engineering Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai Jiao Tong University School of Computer Science South China Normal University

The key exposure problem is a practical threat for many security applications. In wireless sensor networks (WSNs), keys could be compromised easily due to its limited hardware protections. A secure group key management scheme is responsible for secure distributing group keys among valid nodes of the group. Based on the key-insulated encryption (KIE), we propose a group key management scheme (KIE-GKMS), which integrates the pair-wise key pre-distribution for WSN. The KIE-GKMS scheme updates group keys dynamically when adding or removing nodes. Moreover, the security analysis proves that the KIE-GKMS scheme not only obtains the semantic security, but also provides the forward and backward security. Finally, the theoretical analysis shows that the KIE-GKMS scheme has constant performance on both communication and storage costs in sensor nodes.

关键词： wireless sensor network data encryption group key management forward security key-insulated encryption

forward and backward secure searchable encryption with multi-keyword search and result verification

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第5期65卷 270-272页

作者： Jie CUI Yue SUN Yan XU Miaomiao TIAN Hong ZHONG School of Computer Science and Technology Anhui University Institute of Physical Science and Information Technology Anhui University Anhui Engineering Laboratory of LoT security Technologies Anhui University

Dear editor,Searchable encryption [1] is a new search method that not only protects personal privacy, but also searches over encrypted data. The multi-keyword scheme can search documents with more keywords so that the... 详细信息

关键词： forward security Backward security Multi-keyword Search Verification Searchable Encryption

Set signatures and their applications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science in China(Series F) 2009年第8期52卷 1346-1357页

作者： WU ChuanKun State Key Laboratory of Information security Institute of Software Chinese Academy of Sciences Beijing 100190 China

There are many constraints in the use of digital signatures. This paper proposes a new way of using digital signatures with some restrictions, i.e. set signatures. It works in such a way that when the signing algorithm is given, one can use it to create a valid signature on a message if and only if the message belongs to a pre-defined set, and given the information about the signing algorithm, it is computationally infeasible to create valid signatures on any other arbitrary messages outside of the set. This special property enables the signing algorithm to be made public, which seems to contradict with the traditional signature where a private key is needed, which must be kept secret. What makes the problem challenging is that the signing algorithm does not reveal the secret signing key, and hence forging normal signatures for arbitrary messages is computationally infeasible. In many cases, the signing algorithm does not reveal the elements in the authorized set. As an application of the new concept, set signatures for intelligent mobile agents committing ＂smaller than＂ condition is studied, which shows the applicability of set signatures on small sets.

关键词： cryptography set signature forward security

An Efficient forward Secure Signature Scheme

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2006年第2期11卷 242-247页

作者：于佳孔凡玉李大兴 Inst. of Network security Shandong Univ. Jinan 250100 ChinaCollege of Information Eng. Qingdao Univ. Qingdao 266071) Inst. of Network security Shandong Univ. Jinan 250100 China

A new efficient forward secure signature scheme based on bilinear pairings is presented m this paper. Each complexity of key generation, key update, signing and verifying algorithms in this scheme is O（1） in terms of the total number of time periods T. Because a new structure in node secret key storage and a unique strategy in key update are employed, the signing and verifying costs don＇t grow when T increases. At the same time, the key generation and key update algorithms are efficiently constructed thanks to using the pre-order traversal technique of binary trees. Compared with other schemes based on bilinear pairings, the signature size in this scheme is very short, which doesn＇t change with T increasing. The scheme is forward secure in random oracle model assuming CDH problem is hard.

关键词： forward security bilinear pairing digital signature

A New forward-Secure Authenticated Encryption Scheme with Message Linkages

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1537-1540页

作者： LI Yanping SI Guangdong WANG Yumin Key Laboratory of Computer Networks and Information security Ministry of Education Xidian University Xi＇an 710071 Shaanxi China College of Mathematics and Information Science Shaanxi Normal University Xi＇an 710062 Shaanxi China

Yoon and Yoo recently proposed a robust authenticated encryption scheme and claimed their scheme has the properties of forward secrecy and confidentiality. The current paper, however, points out that Yoon-Yoo＇s scheme also can not provide forward secrecy and confidentiality such that any adversary can easily recover the transferred message. Based on intractability of reversing the one-way hash function and discrete logarithm problem, an improved authenticated encryption scheme with messages linkage is proposed. The above security faults get solved perfectly. The new scheme is proven to satisfy all the basic security requirements of the authenticated encryption scheme. And by the concrete comparison, it has the similar efficiency of the original scheme.

关键词： authenticated encryption scheme non-repudiation forward security