检索结果-南通市图书馆

One-to-many authentication for access control in mobile pay-TV systems

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第5期59卷 118-132页

作者： Debiao HE Neeraj KUMAR Han SHEN Jong-Hyouk LEE State Key Laboratory of Software Engineering Computer School Wuhan University Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Department of Computer Science and Engineering Thapar University Department of Computer Science and Engineering Sangmyung University

In traditional authentication schemes for access control in mobile pay-TV systems, one-to-one delivery is used, i.e., one authentication message per request is delivered from a head-end system(HES) to a subscriber. The performance of one-to-one delivery for authentication is not satisfactory as it requires frequent operations which results in high bandwidth consumption. To address this issue, one-to-many authentication for access control in mobile pay-TV systems was developed. It requires only one broadcasted authentication message from a HES to subscribers if there are many requests for the same service in a short period of ***, later it was revealed that the one-to-many authentication scheme was vulnerable to an impersonation attack, i.e., an attacker without any secret key could not only impersonate the mobile set(MS) to the HES but also impersonate the HES to the MS. Then, a new scheme has been recently introduced for secure operations of one-to-many authentication. However, as shown in this paper, the recent work for one-to-many authentication is still vulnerable to the impersonation attack. To mitigate this attack, in this paper, a new scheme for one-tomany authentication using bilinear pairing is proposed that eliminates security weaknesses in the previous *** obtained depict that the new improved scheme in this paper provides better performance in terms of computation and communication overheads.

关键词： authentication bilinear pairing conditional access system mobile pay-TV

Practical Constant-Size Ring Signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第3期33卷 533-541页

作者： Meng-Jun Qin Yun-Lei Zhao Zhou-Jun Ma Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai 201203 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710126 China State Key Laboratory of Cryptology State Cryptology Administration Beijing 100878 China

Bitcoin has gained its popularity for almost 10 years as a ＂secure and anonymous digital currency＂. However, according to several recent researches, we know that it can only provide pseudonymity rather than real anonymity, and privacy has been one of the main concerns in the system similar to Bitcoin. Ring signature is a good method for those users who need better anonymity in cryptocurrency. It was first proposed by Rivest et al. based upon the discrete logarithm problem （DLP） assumption in 2006, which allows a user to sign a message anonymously on behalf of a group of users even without their coordination. The size of ring signature is one of the dominating parameters, and constant-size ring signature （where signature size is independent of the ring size） is much desirable. Otherwise, when the ring size is large, the resultant ring signature becomes unbearable for power limited devices or leads to heavy burden over the communication network. Though being extensively studied, currently there are only two approaches for constant-size ring signature. Achieving practical constant-size ring signature is a long-standing open problem since its introduction. In this work, we solve this open question. We present a new constant-size ring signature scheme based on bilinear pairing and accumulator, which is provably secure under the random oracle （RO） model. To the best of our knowledge, it stands for the most practical ring signature up to now.

关键词： ring signature constant size bilinear pairing accumulator

Authenticating Tripartite Key Agreement Protocol with pairings

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2004年第2期19卷 169-176页

作者： Sheng-LiLiu Fang-GuoZhang Ke-FeiChen DepartmentofComputerScienceandEngineering ShanghaiJiaoTongUniversityShanghai200030P.R.China SchoolofInformationScienceandTechnology ZhongshanUniversityGuangzhou510275P.R.China

In this paper, an authenticated tripartite key agreement protocol is proposed, which is an ID-based one with pairings. This protocol involves only one round. The authenticity of the protocol is assured by a special signature scheme, so that messages carrying the information of two ephemeral keys can be broadcasted authentically by an entity. Consequently, one instance of the protocol results in eight session keys for three entities. In other word, one instance of the protocol generates a session key, which is eight times longer than those obtained from traditional key agreement protocols. Security attributes of the protocol are presented, and the computational overhead and bandwidth of the broadcast messages are analyzed as well.

关键词： key agreement bilinear pairing identity-based cryptography

Constructing pairing-free certificateless public key encryption with keyword search

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2019年第8期20卷 1049-1061页

作者： Yang LU Ji-guo LI College of Computer and Information Hohai University

Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data *** offers a perfect cryptographic solution to encrypted data retrieval in encrypted data storage *** cryptography(CLC)is a novel cryptographic primitive that has many *** overcomes the key escrow problem in identity-based cryptosystems and the cumbersome certificate problem in conventional public key *** by the appealing features of CLC,three certificateless encryption with keyword search(CLEKS)schemes were presented in the ***,all of them were constructed with the costly bilinear pairing and thus are not suitable for the devices that have limited computing resources and battery ***,it is interesting and worthwhile to design a CLEKS scheme without using bilinear *** this study,we put forward a pairing-free CLEKS scheme that does not exploit bilinear *** strictly prove that the scheme achieves keyword ciphertext indistinguishability against adaptive chosen-keyword attacks under the complexity assumption of the computational Diffie-Hellman problem in the random oracle *** comparison and the simulation show that it enjoys better performance than the previous pairing-based CLEKS *** addition,we briefly introduce three extensions of the proposed CLEKS scheme.

关键词： Searchable public key encryption Certificateless public key encryption with keyword search bilinear pairing Computational Diffie-Hellman problem

A pairing-BASED PUBLICLY VERIFIABLE SECRET SHARING SCHEME

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第1期24卷 186-194页

作者： Tsu-Yang WU Yuh-Min TSENG Department of Mathematics National Changhua University of Education Jin-De Campus Chang-Hua 500 Taiwan

A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryp- tographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.

关键词： bilinear pairing cryptography random oracle model secret sharing.

ID-based authentication scheme combined with identity-based encryption with fingerprint hashing

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2008年第4期15卷 75-80,120页

作者： JIANG Wei-qiang HUANG Zheng-quan YANG Yi-xian TIAN Jie LI Liang Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences Beijing 100080 China

Current identity-based （ID） cryptosystem lacks the mechanisms of two-party authentication and user＇s private key distribution. Some ID-based signcryption schemes and ID-based authenticated key agreement protocols have been presented, but they cannot solve the problem completely. A novel ID-based authentication scheme based on ID-based encrypfion （IBE） and fingerprint hashing method is proposed to solve the difficulties in the IBE scheme, which includes message receiver authenticating the sender, the trusted authority （TA） authenticating the users and transmitting the private key to them. Furthermore, the scheme extends the application of fingerprint authentication from terminal to network and protects against fingerprint data fabrication. The fingerprint authentication method consists of two factors. This method combines a token key, for example, the USB key, with the user＇s fingerprint hash by mixing a pseudo-random number with the fingerprint feature. The security and experimental efficiency meet the requirements of practical applications.

关键词： ID authentication D-based encryption bilinear pairing fingerprint authentication fingerprint hashing

Efficient pairing-based batch anonymous authentication scheme for VANET

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2018年第1期25卷 85-94页

作者： Song Cheng Zhang Mingyue Peng Weiping School of Computer Science and Technology Henan Polytechnic University

To solve the efficiency problem of batch anonymous authentication for vehicular Ad-hoc networks （VANET） , an improved scheme is proposed by using bilinear pairing on elliptic curves. The signature is jointly generated by roadside unit （RSU） node and vehicle, thus reducing the burden of VANET certification center and improving the authentication efficiency, and making it more difficult for attacker to extract the key. Furthermore, under random oracle model （ROM） security proof is provided. Analyses show that the proposed scheme can defend against many kinds of security problems, such as anonymity, man-in-the-middle （ MITM ） attack, collusion attack, unforgeability, forward security and backward security etc. , while the computational overheads are significantly reduced and the authentication efficiency is effectively improved. Therefore, the scheme has great theoretical significance and application value under computational capability constrained Internet of things （IoT） environments.

关键词： bilinear pairing anonymous authentication privacy protection vehicular Ad-hoc networks random oracle model

Improvement of an ID-Based Deniable Authentication Protocol

在线全文

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2018年第2期16卷 139-144页

作者： Tzu-Chun Lin Department of Applied Mathematics Feng Chia UniversityTaichung 40724

The deniable authentication protocol is an important notion that allows a receiver to identify the source of a given message, but not to prove the identity of the sender to a third party. Such property is very useful for providing secure negotiation over the Internet. The ID-based deniable authentication protocol based on elliptic Diffie-Hellman key agreement protocol cannot defend the sender spoofing attack and message modification attack. In this paper, we present an improved protocol based on double elliptic Diffie- Hellman scheme. According to the comparison result, the proposed protocol performs better.

关键词： bilinear pairing deniable authentication Diffie-Hellman elliptic curves

Provably Secure General Aggregate Signcryption Scheme in the Random Oracle Model

在线全文

学校读者我要写书评

暂无评论

China Communications 2012年第11期9卷 107-116页

作者： Qi Zhenghua Ren Xunyi Yang Geng College of Computer Nanjing University of Posts and TelecommunicationsNanjing 210003P.R.China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003P.R.China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and TelecommunicationsMinistry of EducationJiangsu ProvinceNanjing 210003P.R.China

To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggregate signature algorithm are combined in a practical and secure manner to form the general aggregate signcryption scheme's schema and concept, and a new secure, efficiently general aggregate signcryption scheme, which allows the aggregation of n distinct signcryptions by n distinct users on n distinct messages, is proposed. First, the correction of the GASC scheme is analyzed. Then, we formally prove the security of GASC in the random oracle models IND-CCA2 and EUF-CMA under the DBDHP assumption and the DLP assumption, respectively. The results show that the GASC scheme is not only secure against any probabilistic polynomial-time IND-GASC-CCA2 and EUF-GASC-CMA adversary in the random oracle models but also efficient in pairing ê computations. In addition, the GASC scheme gives an effective remedy to the key escrow problem, which is an inherent issue in IBC by splitting the private key into two parts, and reduces the communication complexity by eliminating the interaction among the senders (signers) before the signcryption generation.

关键词： identity-based cryptography signcryption aggregate signature bilinear pairing