Open Access Open Access  Restricted Access Subscription or Fee Access

Secure Keying in Peer Network using Secret Sharing Technique

Y.M. Rajashri, D.K. Nayana

Abstract


Identity-based cryptography (IBC) is a type of public key cryptography which a publicly known string representing an individual or organization is used as a public key. The public string could include an email address, domain name, or a physical IP address. IBC has been introduced into Peer-to-Peer (P2P) networks recently for identity verification and authentication purposes. IBC uses user’s identity as public key and private keys are issued by key generate center (KGC) after verifying the user’s credentials. In current IBC-based solutions issuing of the private keys are not secured. In this paper we propose a secure keying using a secret sharing technique for an IBC based peer to peer network. Where a peer can select the level of security required depending on the importance of the message. This consists of an IBC infrastructure setup phase, a peer registration phase, a secure keying phase and system maintenance phase. These phases make use of a key generation center (KGC) and key privacy authorities (KPAs) to issue private keys to peers securely in order to enable the IBC systems to be more acceptable and applicable in real-world P2P networks. Secret sharing technique used in this project prevents the collusion attacks and denial of service. The theoretical analysis and experimental results show that Secure Keying in Peer Network using this Secret Sharing Technique performs efficiently and also able to support large scale networks.

Keywords


Identity based Cryptography, Secure Keying.

Full Text:

PDF

References


E. Sit and R. Morris, “Security considerations for peer-to-peer distributed hash tables,” in IPTPS, 2002, pp. 261–269.

A. Shamir, “Identity-based cryptosystems and signature schemes,” in CRYPTO, 1984, pp. 47–53.

D. Boneh and M. K. Franklin, “Identity-based encryption from the weil pairing,” in CRYPTO, 2001, pp. 213–229.

B. Lee, C. Boyd, E. Dawson, K. Kim, J. Yang, and S. Yoo, “Secure key issuing in id-based cryptography,” in ACSW Frontiers, 2004, pp. 69–74.

R. Gangishetti, M. C. Gorantla, M. L. Das, A. Saxena, and V. P. Gulati, “An efficient secure key issuing protocol in id- based cryptosystems,” in ITCC (1), 2005, pp. 674–678.

A. Saxena,“Threshold ski protocol for id-based cryptosys- tems,” in IAS, 2007, pp.65–70.

Z.-L. Lu, G.-H.; Zhang, “Wheel of trust: A secure framework for overlay-based services,” ICC, pp. 1148–1153, 2007.

I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in SIGCOMM, 2001, pp.149–160.

E. K. Lua, “Securing peer-to-peer overlay networks from sybil attack,” in ISCIT’07, Sydney, Australia, 2007.

S. Ryu, K. R. B. Butler, P. Traynor, and P. D. McDaniel, “Leveraging identity-based cryptography for node id assignment in structured p2p systems,” in AINA Workshops (1), 2007, pp. 519–524.

L. M. Aiello, M. Milanesio, G. Ruffo, and R. Schifanella, “Tempering kademlia with a robust identity based system,” in Peer-to-Peer Computing, 2008, pp. 30–39.

A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979.

I. Baumgart and S. Mies, “S/kademlia: A practicable approach towards secure key-based routing,” in ICPADS, 2007, pp. 1–8.

R. Chen, W. Guo, L. Tang, J. Hu, and Z. Chen, “Scalable byzantine fault tolerant public key authentication for peer-to- peer networks,” in Euro-Par, 2008.

M. J. Freedman and R. Morris, “Tarzan: a peer-to-peer anonymizing network layer,” in CCS, 2002, pp. 193–206.

B. Parno, D. Wendlandt, E. Shi, A. Perrig, B. M. Maggs, and Y.-C. Hu, “Portcullis: protecting connection setup from denial-of-capability attacks,” in SIGCOMM, 2007, pp. 289–300.

P. Maymounkov and D. Mazie`res, “Kademlia: A peer-to-peer information system based on the xor metric,” in IPTPS, 2002, pp. 53–65.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.