1 / 14

Efficient User Authentication and Key Management for Peer-to-Peer Live Streaming Systems

Efficient User Authentication and Key Management for Peer-to-Peer Live Streaming Systems. Authors: X. Liu, Y. Hao, C. Lin, and C. Du Source: Tsinghua Science and Technology, vol. 14, no. 2, pp. 234-241, 2009 Speaker: Shu-Fen Chiou ( 邱淑芬 ). Introduction. P2P Live streaming. a.wmv. A.

akando
Download Presentation

Efficient User Authentication and Key Management for Peer-to-Peer Live Streaming Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Efficient User Authentication and Key Management for Peer-to-Peer Live Streaming Systems Authors: X. Liu, Y. Hao, C. Lin, and C. Du Source: Tsinghua Science and Technology, vol. 14, no. 2, pp. 234-241, 2009 Speaker: Shu-Fen Chiou (邱淑芬)

  2. Introduction • P2P Live streaming a.wmv A Frame 1 Frame 2 Frame 3 … Frame N Frame 2 Frame 1 B Live to watch a.wmv

  3. Challenges in streaming systems • High bit rates • End-to-end delay • Packet losses • Network congestion • Service guarantees • Security

  4. Motivation • For P2P live media streaming, authors proposed a secure scheme using user authentication and key managements.

  5. Requirements • Confidentiality • Data integrity • Scalability • Efficient

  6. User authentication Notation AS Authorization server PriKAS, PubKAS Private and corresponding public keys from the AS n Total number of users Ui, Uj i-th and j-th users PriKi , PubKi Private and corresponding public keys of Ui CTi Certificate of Ui Hm(x) Hm(x)=H(Hm-1(x)), m>1, H() is a one-way hash Ts, Te certificate lifetime RSi Private number for Ui only known by AS

  7. User authentication • Certificate generation New user Ui AS Generate PriKi , PubKi Generate random value Ri, and calculate Hm(Ri) Login request Verify Ui Generate CTi CTi={IDi|Ts|Te|T|IPi|PubKi| Hm(Ri)|Hm(RSi)|SigNi} CTi

  8. User authentication • Certificate update user Ui AS Between frames <Te+(t-1)T, Te+t  T>, 0<t<m {IDi|t|Hm-t(Ri)} Check whether H(Hm-t(Ri))=Hm-(t-1)(Ri) {IDi|Hm-t(RSi)}

  9. User authentication • Certificate verification (Uk verify Ui) user Ui user Uk CTi={IDi|Ts|Te|T|IPi|PubKi| Hm(Ri)|Hm(RSi)|SigNi} CTi Verify CTi Select random value Mi Encrypt Miby PriKi Decrypt E(Mi)by PubKi Get Mi’ Check whether Mi’=Mi Select random value Mk as symmetric secret key Encrypt Mk by PubKi {Mi|E(Mi)} {E(Mk} Decrypt E(Mk)by PriKi to get Mk

  10. Key management • Every user has a logic key tree Key of secure channel Logic key tree of j before i joins

  11. Key management • User i joins to j 1. j sends {Pubki(K8), K8(K’78), K’78(K’58), K’58(KEK’)} to i 2. j sends other key materials to its old neighbors. e.g. j sends {K7(K’78), K’78(K’58), K’58(KEK’)} to U7 Logic key tree of j after i joins

  12. Key management When i leaves, j changes some of the key values and send to its neighbors • User i leaves j Logic key tree of j before i leaves Logic key tree of j after i leaves e.g. j sends {K4(K’34), K’34(K’14), K’14(KEK’)} to U4

  13. 此篇paper之優缺點 • 優點: • 延伸authentication及key management應用在P2P live streaming protocol • 缺點: • Certificate verification無相互驗證

  14. 可能研究方向 • Certificate verification相互驗證 • 加入付費機制

More Related