Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 A peer mutual authentication method on super peer based peer-to- peer network Authors: Byeong-Thaek Oh, Sang-Bong Lee, and Ho-Jin Park Source: IEEE International.

Published byBryan Nelson Modified over 9 years ago

Similar presentations

Presentation on theme: "1 A peer mutual authentication method on super peer based peer-to- peer network Authors: Byeong-Thaek Oh, Sang-Bong Lee, and Ho-Jin Park Source: IEEE International."— Presentation transcript:

1 1 A peer mutual authentication method on super peer based peer-to- peer network Authors: Byeong-Thaek Oh, Sang-Bong Lee, and Ho-Jin Park Source: IEEE International Symposium on Consumer Electronics, pp. 1-4, 2008 Speaker: Shu-Fen Chiou ( 邱淑芬 )

2 2 Introduction Super peer P2P network Advantages: Reduce time and bandwidth for search Autonomous units Manageability Load balancing

3 3 Motivation Exchange information Security issues: Copyright protect Anonymous malicious attack => Guarantee mutual Authentication

4 4 Peer authentication Peer A-> Super Peer A: UID A ||PID A ||TS 2 ||PKC||Sign Sign=E_K PA [UID A ||TS 1 ]

5 5 Peer mutual authentication Super Peer A-> AS: UID A ||PID A ||PID B ||SID B ||TS 3 Ticket B1 =E_K B [K A,B ||UID A ||PID A ||SID B ||TS 4 ||TID 1 ||lifetime 1 ] AS->Super Peer A:E_K A [K A,B ||SID B ||TS 4 ||lifetime 1 ||Ticket B1 ] Peer A->Peer B: Ticket B1, Authenticator A Authenticator A =E_K A,B [UID A ||PID A ||SID B ||TS 5 ] Peer B-> Peer A: Ticket B2 Ticket B2 =E_K B [K A,B ||UID A ||PID A ||SID B ||TS 6 ||TID 2 ||lifetime 2 ]

6 6 Comments Peer A-> Super Peer A: UID A ||PID A ||TS 2 ||PKC||Sign Sign=E_K PA [UID A ||TS 1 ] Peer A-> Super Peer A: PID A ||TS 2 ||PKC||Sign Sign=E_K PA [PID A ||TS 1 ]

7 7 Comments Super Peer A-> AS: UID A ||PID A ||PID B ||SID B ||TS 3 Ticket B1 =E_K B [K A,B ||UID A ||PID A ||SID B ||TS 4 ||TID 1 ||lifetime 1 ] AS->Super Peer A:E_K A [K A,B ||SID B ||TS 4 ||lifetime 1 ||Ticket B1 ] Peer A->Peer B: Ticket B1, Authenticator A Authenticator A =E_K A,B [UID A ||PID A ||SID B ||TS 5 ] Peer B-> Peer A: Ticket B2 Ticket B2 =E_K B [K A,B ||UID A ||PID A ||SID B ||TS 6 ||TID 2 ||lifetime 2 ]

Download ppt "1 A peer mutual authentication method on super peer based peer-to- peer network Authors: Byeong-Thaek Oh, Sang-Bong Lee, and Ho-Jin Park Source: IEEE International."

Similar presentations

1 P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains Authors: P. Dewan and P. Dasgupta Source: IEEE Transactions.

1 P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains Authors: P. Dewan and P. Dasgupta Source: IEEE Transactions.
11 Efficient and Secure Certificateless Authentication and Key Agreement Protocol for Hybrid P2P Network Authors: Z. B. Xu and Z. W. Li Source: The 2nd.

11 Efficient and Secure Certificateless Authentication and Key Agreement Protocol for Hybrid P2P Network Authors: Z. B. Xu and Z. W. Li Source: The 2nd.
Kerberos Assisted Authentication in Mobile Ad-hoc Networks Authors: Asad Amir Pirzada and Chris McDonald Sources: Proceedings of the 27th Australasian.

Kerberos Assisted Authentication in Mobile Ad-hoc Networks Authors: Asad Amir Pirzada and Chris McDonald Sources: Proceedings of the 27th Australasian.
Further improvement on the modified authenticated key agreement scheme Authors: N.Y. Lee and M.F. Lee Source: Applied Mathematics and Computation, Vol.157,

Further improvement on the modified authenticated key agreement scheme Authors: N.Y. Lee and M.F. Lee Source: Applied Mathematics and Computation, Vol.157,
CS470, A.SelcukNeedham-Schroeder1 Needham-Schroeder Protocol Authentication & Key Establishment CS 470 Introduction to Applied Cryptography Instructor:

CS470, A.SelcukNeedham-Schroeder1 Needham-Schroeder Protocol Authentication & Key Establishment CS 470 Introduction to Applied Cryptography Instructor:
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
1 Fingerprint verification Speaker: Shu-Fen Chiou ( 邱淑芬 ) Date:2005/06/03.

1 Fingerprint verification Speaker: Shu-Fen Chiou ( 邱淑芬 ) Date:2005/06/03.
Peer-to-Peer Technology and Security Issues By Raul Rodriguez, Arash Zarrinbakhsh, Cynthia Roger and Phillip Shires College of Business Administration.

Peer-to-Peer Technology and Security Issues By Raul Rodriguez, Arash Zarrinbakhsh, Cynthia Roger and Phillip Shires College of Business Administration.
Peer-to-Peer Content Sharing. P2P File Sharing Benefits Why use a P2P model for a file sharing application?

Peer-to-Peer Content Sharing. P2P File Sharing Benefits Why use a P2P model for a file sharing application?
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.

CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
LEXP: Preserving User Privacy and Certifying the Location Information Author ： Ken Nakanishi, Jin Nakazawa, and Hideyuki Tokuda Presented by Yi Cheng Lin.

LEXP: Preserving User Privacy and Certifying the Location Information Author ： Ken Nakanishi, Jin Nakazawa, and Hideyuki Tokuda Presented by Yi Cheng Lin.
1 Improvement of the secure dynamic ID based remote user authentication scheme for multi-server environment Authors ： Han-Cheng Hsiang and Wei-Kuan Shih.

1 Improvement of the secure dynamic ID based remote user authentication scheme for multi-server environment Authors ： Han-Cheng Hsiang and Wei-Kuan Shih.
T F Select … (5, F) (4, F) (3, F) (2, T) (1, T) … (3, ‘Z’) (2, ‘Y’) (1, ‘X’) … (1, ‘A’)

T F Select … (5, F) (4, F) (3, F) (2, T) (1, T) … (3, ‘Z’) (2, ‘Y’) (1, ‘X’) … (1, ‘A’)
PEER-TO-PEER SECURITY PRESENTEDBY SHRUTI PARIHAR.

PEER-TO-PEER SECURITY PRESENTEDBY SHRUTI PARIHAR.
1 Analysis of SMTP Connection Characteristics for Detecting Spam Relays Authors: P. J. Sandford, J. M. Sandford, and D. J. Parish Speaker: Shu-Fen Chiou(

1 Analysis of SMTP Connection Characteristics for Detecting Spam Relays Authors: P. J. Sandford, J. M. Sandford, and D. J. Parish Speaker: Shu-Fen Chiou(
CSI5175 Wireless and Mobile Electronic Commerce Networks and their Applications Mao Zhang 2009.03.20 Wireless Hotspots: Current Challenges and Future Directions.

CSI5175 Wireless and Mobile Electronic Commerce Networks and their Applications Mao Zhang Wireless Hotspots: Current Challenges and Future Directions.
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.

Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.
Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.

Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.
P EER - TO -P EER N ETWORKS Michael Fine 1. W HAT ARE P EER -T O -P EER N ETWORKS ? Napster Social networking spawned from this concept. Emerged in the.

P EER - TO -P EER N ETWORKS Michael Fine 1. W HAT ARE P EER -T O -P EER N ETWORKS ? Napster Social networking spawned from this concept. Emerged in the.
1 A Collaboration Scheme for Making Peer-to-Peer Anonymous Routing Resilient Authors: X. Wang and J. Luo Source: 12th International Conference on Computer.

1 A Collaboration Scheme for Making Peer-to-Peer Anonymous Routing Resilient Authors: X. Wang and J. Luo Source: 12th International Conference on Computer.

Similar presentations

Ads by Google