http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Efficient Identity-Based Generalized Ring Signcryption Scheme
Zhou, Caixue,Cui, Zongmin,Gao, Guangyong Korean Society for Internet Information 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12
In this paper, we introduce a new concept called generalized ring signcryption (GRSC), which can achieve ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system which has a large number of users, or has limited storage space, or whose function requirements may be changed later. We give a formal definition and a security model of GRSC and propose a concrete scheme based on bilinear pairings. In the random oracle model, the scheme's confidentiality can be proved under the GBDH assumption, and its unforgeability can be proved under GDH' assumption, and what is more, this scheme also allows unconditional anonymity. Compared with other identity-based ring signcryption schemes that use bilinear pairings as well, our scheme is a highly efficient one.
Efficient Identity-Based Generalized Ring Signcryption Scheme
( Caixue Zhou ),( Zongmin Cui ),( Guangyong Gao ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12
In this paper, we introduce a new concept called generalized ring signcryption (GRSC), which can achieve ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system which has a large number of users, or has limited storage space, or whose function requirements may be changed later. We give a formal definition and a security model of GRSC and propose a concrete scheme based on bilinear pairings. In the random oracle model, the scheme`s confidentiality can be proved under the GBDH assumption, and its unforgeability can be proved under GDH` assumption, and what is more, this scheme also allows unconditional anonymity. Compared with other identity-based ring signcryption schemes that use bilinear pairings as well, our scheme is a highly efficient one.
An Improved ID-based Proxy Signature Scheme with Message Recovery
Caixue Zhou 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.9
In 2012, Singh and Verma proposed an ID-based proxy signature scheme with message recovery. In this paper, we show that their scheme is vulnerable to the forgery attack, and an adversary can forge a valid proxy signature for any message with knowing a previous valid proxy signature. In addition, there is a security flaw in their proof. Furthermore, we propose an improved scheme that remedies the weakness of their scheme, and the improved scheme can be proved existentially unforgeable-adaptively chosen message and ID attack assuming the computational Diffie-Hellman problem is hard.
Reversible Watermarking with Adaptive Embedding Threshold Matrix
( Guangyong Gao ),( Yun-qing Shi ),( Xingming Sun ),( Caixue Zhou ),( Zongmin Cui ),( Liya Xu ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.9
In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.