检索结果-南通市图书馆

Anonymous handover authentication protocol for mobile wireless networks with conditional privacy preservation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第5期60卷 113-129页

作者： Debiao HE Ding WANG Qi XIE kefei chen State Key Laboratory of Software Engineering Computer School Wuhan University State Key Laboratory of Cryptology School of Electronics Engineering and Computer Science Peking University Hangzhou Key Laboratory of Cryptography and Network Security Hangzhou Normal University

With the development of the wireless communication technology and the popularity of mobile devices, the mobile wireless network(MWN) has been widely used in our daily life. Through the access point(AP), users could access the Internet anytime and anywhere using their mobile devices. Therefore, MWNs can bring much convenience to us. Due to the limitation of AP’s coverage, the seamless handover frequently occurs in practical applications. How to guarantee the user’s privacy and security and identify the real identity when he/she brings harm to the system becomes very challenging. To achieve such goals, many anonymous handover authentication(AHA) protocols have been proposed in the last several years. However, most of them have high computation costs because mobile nodes need to carry out the bilinear pairing operations or the hash-to-point operations. Besides, most of them cannot satisfy some critical requirements, such as non-traceability and perfect forward secrecy. In this paper, we first outline the security requirements of AHA protocols, and then propose a new AHA protocol to eliminate weaknesses existing in previous AHA protocols. Based on the hardness of two famous mathematical problems, we demonstrate that the proposed AHA protocol is secure against different kinds of attacks and can meet a variety of security requirements. It can be seen from the details of implementations that the proposed AHA protocol also has much less computation cost than three latest AHA protocols.

关键词： mobile wireless network handover authentication anonymity conditional privacy preservation provable security

Optimistic fair exchange E-commerce protocol based on secret sharing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2006年第4期17卷 858-863页

作者： Ma Changshe Lei Feiyu chen kefei Dept. of Computer Science and Engineering Shanghai Jiaotong Univ. Shanghai 200080 P.R.China School of Computer South China Normal Univ. Guangzhou 510631 P.R.China The State Key Lab of Information Security China Academy of Sciency Beijing 100039 P.R.China

A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.

关键词： E-commerce optimistic fair-exchange publicly verfiable secret sharing.

维普期刊数据库

Efficient identity-based threshold decryption scheme from bilinear pairings

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2018年第1期12卷 177-189页

作者： Wei GAO Guilin WANG kefei chen Xueli WANG School of Mathematics and Statistics Ludong University Yantai 264025 China School of Computer and Software Nanjing University of Information Science & Technology Nanjing 210044 China Key Laboratory of Information Security Guangzhou University Guangzhou 510006 China Shield Lab Singapore Research Center of Huawei Singapore 117674 Singapore Department of Mathematics Hangzhou Normal University Hangzhou 311121China School of Mathematics South China Normal University Guangzhou 510631 China

Using Shamir＇s secret sharing scheme to indi- rectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and prove its se- curity in the random oracle model. This new paring-based scheme features a few improvements compared with other schemes in the literature. The two most noticeable features are its efficiency, by drastically reducing the number of pair- ing computations, and the ability it gives the user to share the identity-based private key without requiring any access to a private key generator. With the ability it gives the user to share the identity-based private key, our ID-based threshold decryption （IBTD） scheme, the second of its kind, is signif- icantly more efficient than the first scheme, which was de- veloped by Baek and Zheng, at the expense of a slightly in- creased ciphertext length. In fact, our IBTD scheme tries to use as few bilinear pairings as possible, especially without depending on the suite of Baek-Zheng secret sharing tools based on pairings.

关键词： identity-based cryptography threshold cryptog-raphy provable security random oracle model bilinear pair-ing identity-based threshold decryption

Identity-based threshold key-insulated signature

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2012年第3期18卷 275-280页

作者： chen Jianhong chen kefei Long Yu Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 P. R. China Department of Computer Engineering Huaiyin Institute of Technology Huaian 223003 P. R. China National Laboratory of Modern Communications Chengdu 610041 P. R. China

Due to the compromise of the security of the underlying system or machine stonng the key, exposure of the private key can be a devastating attack on a cryptosystem. Key insulation is an important technique to protect private keys. To deal with the private （signing） key exposure problem in identity-based signature systems, we propose an identity-based threshold key-insulated signature （IBTKIS） scheme. It strengthens the security and flexibility of existing identity-based key-insulated signature schemes. Our scheme＇ s security is proven in the random oracle model and rests on the hardness of the computational Diffie-Helhnan problem in groups equipped with a pairing. To the best of our knowledge, it is the first IBTKIS scheme up to now.

关键词： threshold key-insulated signature random oracle model

LR-RRA-CCA secure functional encryption for randomized functionalities from trapdoor HPS and LAF

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第5期61卷 291-305页

作者： Huige WANG kefei chen Baodong QIN Ziyuan HU Department of Network Engineering Anhui Science and Technology University Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Mathematics Hangzhou Normal University National Engineering Laboratory for Wireless Security Xi'an University of Posts and Telecommunications State Key Laboratory of Cryptology

Original public-key encryption is viewed as a tool to encrypt point-to-point *** data is aimed at a particular user,where a sender encrypts a message x under a specified public key P *** this case,only the owner of the(unique)secret key corresponding to P K can decrypt the resulting ciphertext to recover the message ***,on some occasions,encryption is necessary to implement more fine-grained control of the encrypted *** example,the sender

关键词： LAF CCA RRA

Sequential Aggregate Signatures and Multisignatures in the Plain Public Key Model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第2期24卷 338-342页

作者： ZHOU Xuhua LAI Junzuo LIU Shengli chen kefei School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Department of Computer Science Jinan University School of Science Hangzhou Normal University

At Eurocrypt’06, Lu et al. presented the first Sequential aggregate signature(SAS) provably secure without random oracles. The drawback of their scheme is that users need long public keys and the security model makes the Knowledge of secure key(KOSK) assumption. We present the first SAS scheme, which the user needs short public keys and the security is proven without random oracles, in the plain public key model. We also present the first Multisignature(MS) scheme in the plain public key model, which the security is proven without random oracles.

关键词： Sequential aggregate signature Multisignature Plain public key model Standard model Computational Diffie-Hellman assumption

Pirate decoder for the broadcast encryption schemes from Crypto 2005

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

作者： WENG Jian LIU ShengLi chen kefei Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240China

In Crypto＇05, Boneh et al. presented two broadcast encryption schemes. Their work has exciting achievements： the header （also called ciphertexts） and the private keys are of constant size. In their paper, they give an open question to construct a traitor tracing algorithm for their broadcast encryption schemes, and combine the two systems to obtain an efficient trace-and-revoke system. In this paper, we give a negative answer to their open question. More precisely, we show that three or more insider users are able to collude to forge a valid private key for pirate decoding against their schemes. Moreover, we prove that there exists no traitor tracing algorithm to identify the colluders. Our pirate decoding can also similarly be applied to Lee et al.＇s broadcast encryption schemes in ISPEC＇06.

关键词： broadcast encryption pirate decoder traitor tracing

维普期刊数据库

花卉大棚喷药机器人远程控制系统设计——基于互联网

在线全文

学校读者我要写书评

暂无评论

农机化研究 2025年第2期47卷 61-67页

作者：陈可飞王铁广李文勤邢凯方赛银李明西南林业大学机械与交通学院昆明650224 安徽工程大学电气工程学院安徽芜湖241000

针对花卉薄膜大棚传统人工施药效率低、喷洒不均匀且漂浮药物对人体健康造成伤害等问题,设计了一种可实现远程手机控制的悬挂式喷药机器人系统。首先,根据花卉的生长特点和大棚空间结构,在不改变现有大棚结构的前提下,通过增设导轨的方... 详细信息

针对花卉薄膜大棚传统人工施药效率低、喷洒不均匀且漂浮药物对人体健康造成伤害等问题,设计了一种可实现远程手机控制的悬挂式喷药机器人系统。首先,根据花卉的生长特点和大棚空间结构,在不改变现有大棚结构的前提下,通过增设导轨的方式引入喷药机器人,并依据花卉精准施药的基本要求,在SolidWorks中建模并优化喷药机器人的机械结构;其次,以MCU esp8266模块作为核心控制单元,对继电器、电机、电磁阀和药液泵等硬件进行控制,采用PWM方式调节继电器的导通时间,进而实现喷药机器人根据不同行进速度作业;最后,通过WiFi无线通信模块结合物联网平台设计远程控制APP端,实现喷药机器人启停和环境数据采集等功能。系统测试表明:在无遮挡和有遮挡物环境中,数据传输的成功率分别约为98%和93%,丢包率分别约为1.98%和7%,且喷药机器人在不同的速度下运行稳定。测试结果能够为喷药机器人在大棚内行走稳定性和对花卉自动施药提供技术参考。

关键词：花卉大棚喷药机器人远程控制物联网手机APP

A new construction on randomized message-locked encryption in the standard model via UCEs

维普期刊数据库

同方期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第5期60卷 65-83页

作者： Huige WANG kefei chen Baodong QIN Xuejia LAI Yunhua WEN Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Network Engineering Anhui Science and Technology University Department of Mathematics Hangzhou Normal University Department of Computer Science and Engineering Southwest University of Science and Technology

We present a new primitive of randomized message-locked encryption(MLE) in this paper and define a new security model for it. The new primitive, named message-locked encryption3(hereafter referred as MLE3),is actually a variant of randomized message-locked encryption(Bellare et al. Eurocrypt’13). In order to prevent trivial attacks, our primitive admits a semi-trusted server, which is allowed to hold a secret key of public key encryption(PKE), to verify the correctness of a tag. The new security notion, called privacy chosen-distribution attacks3(PRV-CDA3), requires that a ciphertext generated by encrypting an unpredictable message and another ciphertext(possible invalid) chosen randomly from a ciphertext space are indistinguishable. Compared with the priori proposed security notion, privacy chosen-distribution attacks(PRV-CDA)(Bellare et al. Eurocrypt’13),which requires that two ciphertexts generated by encrypting two unpredictable messages are indistinguishable,the security notion we propose is much stronger. Based on the new primitive, under the blackbox reductions,we put forward a novel construction which achieves both privacy chosen-distribution attacks3(PRV-CDA3) and strong tag consistency(STC) securities in the standard model via universal computational extractors(UCEs)(Bellare et al. Crypto’13). In addition, our scheme also provides the validity-testing for ciphertext.

关键词： message-locked encryption3(MLE3) universal computational extractors(UCEs) privacy chosen distribution attacks3(PRV-CDA3) strong tag consistency(STC) standard model