In order to improve the confidentiality of the private key generator(PKG)in identity-based encryption-signature(IBES)scheme,we improve the Xavier IBES scheme,and use(t,n)secret sharing scheme of threshold cryptography to split the master secret s among n peer to peer third PKGs.We apply the new IBES scheme in wireless sensor network,and discuss its efficiency and security in terms of complexity,storage requirement and security.Analysis shows that our scheme can efficiently improve the confidentiality of the PKG and the security of wireless sensor network.
In order to improve the confidentiality of the private key generator(PKG)in identity-based encryption-signature(IBES)scheme,we improve the Xavier IBES scheme,and use(t,n)secret sharing scheme of threshold cryptography to split the master secret s among n peer to peer third PKGs.We apply the new IBES scheme in wireless sensor network,and discuss its efficiency and security in terms of complexity,storage requirement and security.Analysis shows that our scheme can efficiently improve the confidentiality of the PKG and the security of wireless sensor network.
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity-based Encryption (RB-OOIBE). It splits the encryption process into two parts – the offline and the online part. In the offline part, all heavy computations are done without the knowledge of the receiver’s identity and the plaintext message. In the online stage, only light computations such as modular operation and symmetric key encryption are required, together with the receiver’s identity and the plaintext message. Moreover, since each offline ciphertext can be re-used for the same receiver, the number of offline ciphertexts the encrypter holds only confines the number of receivers instead of the number of messages to be encrypted. In this way, a sensor node (with limited computation power and limited storage) in WSN can send encrypted data easily: A few offline ciphertexts can be computed in the manufacturing stage while the online part is light enough for the sensor to process. We propose an efficient construction for this new notion. The scheme can be proven selective-ID CCA secure in the standard model. Compared to previous online/offline identity-based encryption schemes, our scheme is exempt from a high storage requirement, which is proportional to the number of messages to be sent. The improvement is very significant if many messages are sent to few receivers. 1.
Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user's private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction phase. For Point-to-Multipoint Identity-based Broadcast Encryption (P2MIBBE) that the computing capabilities of receiver are limited, these approaches are impracticable. We propose a new approach what we call Augmented Broadcaster Identity-based Broadcast Encryption (AB- IBBE). It requires neither multiple PKGs nor calculation of receiver in the private key extraction phase. We construct a universal scheme to realize AB-IBBE, such that any IND-ID-CPA secure IBBE scheme can be extended to an IND-ID-CPA secure AB-IBBE scheme.
Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages over the Internet. However, an IBE scheme necessarily requires a private-key generator (PKG), which can create private keys for clients, and so can passively eavesdrop on all encrypted communications. Although a distributed PKG has been suggested as a way to mitigate this problem for Boneh and Franklin’s IBE scheme, the security of this distributed protocol has not been proven and the proposed solution does not work over the asynchronous Internet. Further, a distributed PKG has not been considered for any other IBE scheme. In this paper, we design distributed PKG setup and private key extraction protocols in an asynchronous communication model for three important IBE schemes; namely, Boneh and Franklin’s IBE, Sakai and Kasahara’s IBE, and Boneh and Boyen’s BB1-IBE. We give special attention to the applicability of our protocols to all possible types of bilinear pairings and prove their IND-ID-CCA security in the random oracle model. Finally, we also perform a comparative analysis of these protocols and present recommendations for their use. 1
Wireless Sensor Networks (WSNs), consisting of spatially distributed sensor nodes (SNs) that collect and transmit data to a base station, often operate in environments where secure communication is critical. Classical cryptographic techniques, while effective, frequently struggle to balance strong confidentiality with low latency, leading to vulnerabilities and inefficiencies. To overcome these challenges, this paper proposes the Randomized Asymmetric Certificate-less Arbitrated Quantum Signature (RACAQS) model, a novel quantum-assisted security framework for WSNs. The model integrates the McEliece Certificate-less cryptographic scheme with Arbitrated Quantum Signature mechanisms, ensuring robust confidentiality, integrity, and authenticity of transmitted data. RACAQS operates through three core phases: key pair generation, arbitrated quantum signcryption, and arbitrated quantum unsigncryption. Through these processes, SNs achieve secure key distribution, quantum-based encryption, and reliable verification with minimal overhead. Simulation results demonstrate that RACAQS achieves up to 4% higher confidentiality, integrity, and packet delivery ratio, and a 14% reduction in computation overhead, compared with existing schemes.
Based on the Hadamard operator and Bell states, an identity-based public-key quantum signature scheme is proposed. In our scheme, the signer’s identity is used as her public key. Her private keys are generated by the trusted private key generator (PKG). Given a quantum signature, the verifier can verify the validity of the quantum signature by the signer’s identity information without any public-key certificate. So, our quantum signature has the advantages of the identity-based signature system. On the other hand, in our scheme, it need not use the long-term quantum memory. The verifier need not perform any quantum swap test or state comparison algorithm. What is more, our quantum signature is secure against PKG’s forgery attack. And the disputation of losing quantum signature can be arbitrated by PKG. Therefore, our scheme is relatively more practical and efficient than the similar schemes.