http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Danhui Xu (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
An Untraceable Off-Line Electronic Cash Scheme without Merchant Frauds
Baoyuan Kang,Danhui Xu 보안공학연구지원센터 2016 International Journal of Hybrid Information Techno Vol.9 No.1
In an electronic cash scheme, there are three participants, the bank, the spender and the merchant. First, a spender opens an account in a bank. Then, he withdraws electronic cash from his account and pays it to a merchant. After checking the electronic cash’s validity, the merchant accepts it and deposits it to the bank. There are a number of requirements for an electronic cash scheme, such as, anonymity, unforgeability, unreusability, date attachability, divisibility, transferability and portability. In this paper, we show a recently proposed electronic cash scheme is suffering from some faults in anonymity, expiration date and merchant frauds. To improve the scheme, we propose a new untraceable off-line electronic cash scheme and give a security analysis for it.
-
A secure Certificateless Aggregate Signature Scheme
Baoyuan Kang,Danhui Xu 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.3
Aggregate signatures allow n signatures on n distinct messages from n distinct signers to be aggregated into a single signature that convinces any verifier that n signers do indeed sign the n messages, respectively. The major advantage of utilizing aggregate signatures is to address the security of data and save bandwidth and computations in sensor networks. Recently, people discuss aggregate signature in certificateless public key setting. But some existing certificateless aggregate signature schemes are not secure. In this paper, we analyze the security of Zhang et al.’s certificateless aggregate signature schemes, and propose a new ew ew certificateless aggregate signature schemes, and prove the new scheme is existentially unforgeable under adaptive chosen-message attacks under the assumption that computational Diffie–Hellman problem is hard. Furthermore, in signing equation of the proposed scheme user’s partial private key and secret value are directly combined with the signed message. So, the scheme is also secure against some inside forgery attack.
-
A Secure Multi-receivers E-mail Protocol
Baoyuan Kang,Danhui Xu 보안공학연구지원센터 2016 International Journal of Multimedia and Ubiquitous Vol.11 No.11
In open decentralized networks, it is important to make certain data available to only a selected group of users. For example, in a secure e-mail system, a user may send an e-mail to multiple receivers at once. Recently, Chen proposed a secure multicast key protocol for e-mail system based on Chinese Remainder Theorem. They claimed that their protocol provide perfect forward secrecy and ensure confidentiality and authentication. But, in this paper, we show that Chen’s protocol suffers from the sender and the e-mail server impersonation attacks and mail content confidentiality attack. Moreover, we give an improvement to Chen’s protocol. To contribute a secure multireceiver e-mail protocol, we propose a novel protocol by adopting Lagrange polynomial interpolation. We also discuss the security of the novel multireceiver e-mail protocol. Our protocol provides the perfect forward secrecy and resists unknown key-share attack, replay attack, sender impersonation attack, e-mail server impersonation attack and mail content confidentiality attack.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
