http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Hongzhen Du (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Efficient Certificateless Signcryption from Bilinear Pairings
Hongzhen Du 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.4
Certificateless public key cryptography is an attractive paradigm which combines advantages of both traditional certificate-based and ID-based public key cryptosystems. In this paper, the author formalizes the definition and the security model for certificateless signcryption (CLSC), and proposes a CLSC scheme that is proved to be secure in the random oracle model. The CLSC scheme satisfies such desirable properties as message confidentiality, signature unforgability, public verifiability and forward secrecy. Moreover, the scheme achieves significant efficiency in that it requires general cryptographic hash functions instead of the MapToPoint function which is inefficient and probabilistic, and the public/private key of a user in the scheme is a single group element, and it is unnecessary to check the validity of the public key, and signcryption algorithm needs no pairing operation while the reverse operation only requires two pairing computations.
-
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.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
