http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Flexible Robust Group Key Agreement
Jarecki, S,Jihye Kim,Tsudik, G IEEE 2011 IEEE transactions on parallel and distributed syst Vol.22 No.5
<P>A robust group key agreement protocol (GKA) allows a set of players to establish a shared secret key, regardless of network/node failures. Current constant-round GKA protocols are either efficient and nonrobust or robust but not efficient; assuming a reliable broadcast communication medium, the standard encryption-based group key agreement protocol can be robust against arbitrary number of node faults, but the size of the messages broadcast by every player is proportional to the number of players. In contrast, nonrobust group key agreement can be achieved with each player broadcasting just constant-sized messages. We propose a novel 2-round group key agreement protocol, which tolerates up to T node failures, using O(T)-sized messages for any T. We show that the new protocol implies a fully-robust group key agreement with logarithmic-sized messages and expected round complexity close to 2, assuming random node faults. The protocol can be extended to withstand malicious insiders at small constant factor increases in bandwidth and computation. The proposed protocol is secure under the (standard) Decisional Square Diffie-Hellman assumption.</P>
Reducing RFID Reader Load with the Meet-in-the-Middle Strategy
천정희,Jeongdae Hong,,Gene Tsudik 한국통신학회 2012 Journal of communications and networks Vol.14 No.1
When tag privacy is required in radio frequency identi-fication (ID) system, a reader needs to identify, and optionally authenticate,a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to O(√N logN) without increasing communication cost. Our technique is based on the well-known “meet-in-themiddle”strategy used in the past to attack symmetric ciphers.
Reducing RFID Reader Load with the Meet-in-the-Middle Strategy
Cheon, Jung-Hee,Hong, Jeong-Dae,Tsudik, Gene The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.1
When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to $O$(${\sqrt{N}}$ log$N$) without increasing communication cost. Our technique is based on the well-known "meet-in-the-middle" strategy used in the past to attack symmetric ciphers.