Secure partial secret key issuing in Certificateless Public Key Infrastructure

Seyedehnegin Mehrasa, Nazrul M. Ahmad, Alireza Khorram, Asrul H. Yaacob
2011 2011 IEEE Student Conference on Research and Development  
Disruption-tolerant networks (DTN"s) are successful solutions when there are connectivity issues (intermittent connectivity, Long or Variable Delay, Asymmetric Data Rates, High Error Rates) in the network. DTN"s are wireless networks. DTN"s provide external storage nodes in the network. Confidential information is stored in these storage nodes when there is communication problem in the network among the users in the network. In hostile environments storing and retrieving of data from these
more » ... ge nodes becomes complicated. Cipher text-policy attribute-based encryption (CP-ABE) is a cryptographic solution to access control issues in DTN"s. For secure data retrieval from these storage nodes CP-ABE scheme is used. While applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper we propose a scheme known as Partial key Distribution for DTN"s for securing the secret keys and confidential data. Here we will explain how the Partial key distribution scheme protects the confidentiality of data. 9167 B) Reconstruction Algorithm: 4) Encryption: Secret key is reconstructed from k partial keys. Only authenticated users can get those partial keys. This secret key is used to encrypt the messages send by the sender. Encrypted messages are stored in external storage node and if the receiver is currently available then the messages are also delivered to the receiver. Encryption of the messages is done by using Advanced Encryption Standard algorithm. Advanced Encryption Standard (AES) Algorithm: Copy the final state array output as the encrypted data (cipher text). Store the encrypted data into storage node if the receiver is unavailable. If the receiver is available then directly send the data. 5) Decryption: If the receiver is currently available in the network then he will get the message directly. He will request k KPA"s for partial keys and then reconstructs the secret key for decrypting the message. If the receiver is not present then he will check in the storage node for messages. If any messages available then he will decrypt the data using the secret key. This secret key reconstructed from the k partial keys.
doi:10.1109/scored.2011.6148712 fatcat:bfdk67u5njbsdlzkorxmgdmnli