1-2hit |
Kou KOBAYASHI Tomoyuki UDAGAWA Honggang ZHANG Takemi ARITA Masao NAKAGAWA
In a wireless home network, shadowing is frequently caused by human bodies or furniture. Therefore, relay transmission function is considered for the hub station in Wireless Homelink when the direct communication of terminals is obstructed. However, in relaying high rate isochronous data such as video streams, the bandwidth resource of Wireless Homelink may be crammed with those data. In this paper, we propose an efficient relay scheme--"Pipeline Repeater" for Wireless Homelink. The proposed scheme spatially multiplexes the relay transfer of the isochronous data using antenna directivity. The Pipeline Repeater can relay the isochronous packets as an efficient use of the limited frequency band, and it can be achieved to repeat the high rate data with delay of only one frame. To verify the proposed scheme, we conduct measurements in some actual home environments, and perform the numerical analyses and computer simulations based on the measurements. Our results confirm the efficiency of the Pipeline Repeater scheme.
Yukou KOBAYASHI Naoto YANAI Kazuki YONEYAMA Takashi NISHIDE Goichiro HANAOKA Kwangjo KIM Eiji OKAMOTO
By using Password-based Authenticated Key Exchange (PAKE), a server can authenticate a user who has only the same password shared with the server in advance and establish a session key with the user simultaneously. However, in the real applications, we may have a situation where a user needs to share a session key with server A, but the authentication needs to be done by a different server B that shares the password with the user. Further, to achieve higher security on the server side, it may be required to make PAKE tolerant of a server breach by having multiple authentication servers. To deal with such a situation, Abdalla et al. proposed a variant of PAKE called Gateway Threshold PAKE (GTPAKE) where a gateway corresponds to the aforementioned server A being an on-line service provider and also a potential adversary that may try to guess the passwords. However, the schemes of Abdalla et al. turned out to be vulnerable to Undetectable On-line Dictionary Attack (UDonDA). In this paper, we propose the first GTPAKE provably secure against UDonDA, and in the security analysis, we prove that our GTPAKE is secure even if an adversary breaks into parts of multiple authentication servers.