http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Provably Secure Forward Secure Certificateless Proxy Signature Scheme
( Jiguo Li ),( Yanqiong Li ),( Yichen Zhang ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.8
In order to deal with key exposure problem, we introduce forward secure technique into certificateless proxy signature scheme, and propose the formal definition and security model of the forward secure certificateless proxy signature. Our security model takes into account the super adversary in certificateless signature. Furthermore, we present a construction of forward secure certificateless proxy signature scheme with bilinear maps. Based on the difficulty of computational Diffie-Hellman problem, we prove the scheme is secure against chosen message attack in the random oracle model. Finally, we analyze efficiency of the proposed scheme.
Jiguo Dong,Takako Yamada,Katsufusa Shono 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
By synthesizing the logistic map f(xt)=4xt(1-xt), xt+1=f(f(xt)) produces chaos having L = 4 where Lyapunov exponent is λ=lnL. The successive backward calculation f?¹(xt+1)=(1±√1-xt+1)/2, xt=f?¹(f?¹(xt+1)) can accept external four bit codes such as DNA(A,G,T,C) for the sign determination, the internal state t x obtained gives us the Lyapunov exponent L’ along the external codes and can be compared with L = 4 chaos. The Lyapunov exponent L" obtained is a measure of evolution of a gene, and the entropy G₂ gives characteristic distributions.
Ciphertext-Policy Attribute-Based Encryption with Hidden Access Policy and Testing
( Jiguo Li ),( Haiping Wang ),( Yichen Zhang ),( Jian Shen ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.7
In ciphertext-policy attribute-based encryption (CP-ABE) scheme, a user`s secret key is associated with a set of attributes, and the ciphertext is associated with an access policy. The user can decrypt the ciphertext if and only if the attribute set of his secret key satisfies the access policy specified in the ciphertext. In the present schemes, access policy is sent to the decryptor along with the ciphertext, which means that the privacy of the encryptor is revealed. In order to solve such problem, we propose a CP-ABE scheme with hidden access policy, which is able to preserve the privacy of the encryptor and decryptor. And what`s more in the present schemes, the users need to do excessive calculation for decryption to check whether their attributes match the access policy specified in the ciphertext or not, which makes the users do useless computation if the attributes don`t match the hidden access policy. In order to solve efficiency issue, our scheme adds a testing phase to avoid the unnecessary operation above before decryption. The computation cost for the testing phase is much less than the decryption computation so that the efficiency in our scheme is improved. Meanwhile, our new scheme is proved to be selectively secure against chosen-plaintext attack under DDH assumption.
SOME RESULTS ON FRACTIONAL n-FACTOR-CRITICAL GRAPHS
Yu, Jiguo,Bian, Qiuju,Liu, Guizhen,Wang, Na 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.25 No.1
A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.
Cryptanalysis and Improvement of an Efficient Certificateless Signature Scheme
Li, Jiguo,Huang, Xinyi,Mu, Yi,Wu, Wei The Korea Institute of Information and Commucation 2008 Journal of communications and networks Vol.10 No.1
In traditional digital signature schemes, certificates signed by a trusted party are required to ensure the authenticity of the public key. In Asiacrypt 2003, the concept of certificateless signature scheme was introduced. The advantage of certificateless public key cryptography successfully eliminates the necessity of certificates in the traditional public key cryptography and simultaneously solves the inherent key escrow problem suffered in identity-based cryptography. Recently, Yap et al. proposed an efficient certificateless signature scheme and claimed that their scheme is existentially unforgeable in the random oracle model. In this paper, we show that the certificateless signature scheme proposed by Yap et al. is insecure against public key replacement attacks. Furthermore, we propose an improved certificateless signature scheme, which is existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model and provide the security proof of the proposed scheme.
Certificate-Based Encryption Scheme without Pairing
( Ji Yao Jiguo Li ),( Yichen Zhang ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.6
Certificate-based cryptography is a new cryptographic primitive which eliminates the necessity of certificates in the traditional public key cryptography and simultaneously overcomes the inherent key escrow problem suffered in identity-based cryptography. However, to the best of our knowledge, all existed constructions of certificate-based encryption so far have to be based on the bilinear pairings. The pairing calculation is perceived to be expensive compared with normal operations such as modular exponentiations in finite fields. The costly pairing computation prevents it from wide application, especially for the computation limited wireless sensor networks. In order to improve efficiency, we propose a new certificate-based encryption scheme that does not depend on the pairing computation. Based on the decision Diffie-Hellman problem assumption, the scheme`s security is proved to be against the chosen ciphertext attack in the random oracle. Performance comparisons show that our scheme outperforms the existing schemes.
SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks
( Baogui Huang ),( Jiguo Yu ),( Dongxiao Yu ),( Chunmei Ma ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.11
In wireless sensor networks, link scheduling is a fundamental problem related to throughput capacity and delay. For a given set of communication requests L={l<sub>1</sub>,l<sub>2</sub>…,l<sub>n</sub>}, the MLS (maximum link scheduling) problem aims to find the largest possible subset S of L such that the links in S can be scheduled simultaneously. Most of the existing results did not consider bidirectional transmission setting, which is more realistic in wireless sensor networks. In this paper, under physical interference model SINR (signal-to-noise-plus-interference-ratio) and bidirectional transmission model, we propose a constant factor approximation algorithm MLSA (Maximum Link Scheduling Algorithm) for MLS. It is proved that in the same topology setting the capacity under unidirectional transmission model is lager than that under bidirectional transmission model. However, compared with some work under unidirectional transmission model, the capacity of MLSA is improved about 28% to 45%.
Provably Secure Certificate-Based Signcryption Scheme without Pairings
( Yang Lu ),( Jiguo Li ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.7
Certificate-based cryptography is a new cryptographic paradigm that provides an interesting balance between identity-based cryptography and traditional public key cryptography. It not only simplifies the complicated certificate management problem in traditional public key cryptography, but also eliminates the key escrow problem in identity-based cryptography. As an extension of the signcryption in certificate-based cryptography, certificate-based signcryption provides the functionalities of certificate-based encryption and certificate-based signature simultaneously. However, to the best of our knowledge, all constructions of certificate-based signcryption in the literature so far have to be based on the costly bilinear pairings. In this paper, we propose a certificate-based signcryption scheme that does not depend on the bilinear pairings. The proposed scheme is provably secure in the random oracle model. Due to avoiding the computationally-heavy paring operations, the proposed scheme significantly reduces the cost of computation and outperforms the previous certificate-based signcryption schemes.
Parallel Key-Insulated Signature Scheme without Random Oracles
Zhongmei Wan,Jiguo Li,Xuan Hong 한국통신학회 2013 Journal of communications and networks Vol.15 No.3
To alleviate the damage caused by key exposures, Dodis et al. introduced the notion of key-insulated security where secret keys are periodically updated by using a physically insulated helper key. To decrease the risk of helper key exposures, Hanaoka et al. advocated parallel key-insulated mechanism where distinct helpers are independently used in key updates. In this paper, we propose the first parallel key-insulated signature scheme which is provably secure without resorting to the random oracle methodology. Our scheme not only allows frequent key updating, but also does not increase the risk of helper key exposures.