http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Identity Based Proxy Re-encryption Scheme under LWE
( Wei Yin ),( Qiaoyan Wen ),( Wenmin Li ),( Hua Zhang ),( Zheng Ping Jin ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.12
The proxy re-encryption allows an intermediate proxy to convert a ciphertext for Alice into a ciphertext for Bob without seeing the original message and leaking out relevant information. Unlike many prior identity based proxy re-encryption schemes which are based on the number theoretic assumptions such as large integer factorization and discrete logarithm problem. In this paper, we first propose a novel identity based proxy re-encryption scheme which is based on the hardness of standard Learning With Error(LWE) problem and is CPA secure in the standard model. This scheme can be reduced to the worst-case lattice hard problem that is able to resist attacks from quantum algorithm. The key step in our construction is that the challenger how to answer the private query under a known trapdoor matrix. Our scheme enjoys properties of the non-interactivity, unidirectionality, anonymous and so on. In this paper, we utilize primitives include G-trapdoor for lattice and sample algorithms to realize simple and efficient re-encryption.
Cryptanalysis of a Certificateless Ring Signcryption Scheme
Hongzhen Du,Qiaoyan Wen 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.7
Certificateless public key cryptography (CL-PKC) is an appealing paradigm with the advantages of both conventional public key cryptosystem and ID-based cryptosystem because it avoids using certificates and eliminates the key escrow problem. Ring signcryption is an attractive primitive which allows one user to send a message anonymously, confidentially and authentically. Recently, Qi et al. proposed a novel certificateless ring signcryption scheme with bilinear pairings, and claimed the scheme is provably-secure in the random oracle model. In this paper, we reveal that Qi et al.’s scheme is not secure against both a Type I adversary and a Type II adversary. By giving specific attacks, we found it is unable to meet the fundamental requirements of confidentiality and unforgeability.
A Fuzzy Identity-Based Signcryption Scheme from Lattices
( Xiuhua Lu ),( Qiaoyan Wen ),( Wenmin Li ),( Licheng Wang ),( Hua Zhang ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.11
Fuzzy identity-based cryptography introduces the threshold structure into identity-based cryptography, changes the receiver of a ciphertext from exact one to dynamic many, makes a cryptographic scheme more efficient and flexible. In this paper, we propose the first fuzzy identity-based signcryption scheme in lattice-based cryptography. Firstly, we give a fuzzy identity-based signcryption scheme that is indistinguishable against chosen plaintext attack under selective identity model. Then we apply Fujisaki-Okamoto method to obtain a fuzzy identity-based signcryption scheme that is indistinguishable against adaptive chosen ciphertext attack under selective identity model. Thirdly, we prove our scheme is existentially unforgeable against chosen message attack under selective identity model. As far as we know, our scheme is the first fuzzy identity-based signcryption scheme that is secure even in the quantum environment.
A Proxy-Based Data Security Solution in Mobile Cloud
Xiaojun Yu,Qiaoyan Wen 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.5
This paper proposes a data security solution in mobile cloud, which solves the security issues in the mobile client and cloud. The proposed solution also relieves the performance limitation of mobile client when executing security technologies. The analysis about the security, feasibility, compatibility and expansibility and the experiment suggests the proposed solution is rational.