China
Africa
Explore chapters and articles related to this topic
Internet of Things and Blockchain
Published in Sudhir Kumar Sharma, Bharat Bhushan, Aditya Khamparia, Parma Nand Astya, Narayan C. Debnath, Blockchain Technology for Data Privacy Management, 2021
Ansh Riyal, Parth Sarthi Prasad, Deepak Kumar Sharma
In cryptography systems throughout the world, a shift from secret key sharing to public key cryptography has been observed. Besides the scope of implementing different pairing mechanisms for faster computation, and the opportunity to introduce pairing-based cryptography systems, the biggest advantage of public key systems over those using secret keys is not having to establish a guaranteed secure transmission channel whereby to share a secret key. The private key is generated by and kept by the recipient, who simply makes the public key public for everyone.
Hybrid lightweight cryptography with attribute-based encryption standard for secure and scalable IoT system
Published in Connection Science, 2022
Mounika Jammula, Venkata Mani Vakamulla, Sai Krishna Kondoju
Other than CP-ABE, pairing-based cryptography involves many more applications, e.g. signature techniques, key establishment algorithms with ABE methods, privacy-enhancing schemes using anonymous credentials, etc. Pairing-based Identity-based encryption (IBE), which enables a sender to encrypt a communication without having a receiver's public key to have been authenticated and transmitted earlier, has been established using cryptography. IBE creates a public key using some type of identification for a person (or business). In (Li et al., 2022), authors proposed the control, ciphertext-policy weighted attribute-based encryption (CP-WABE) for IoT environments. The use of a projective homogenous co-ordinate system has been proposed by cryptographers to reduce the inversion cost due to arithmetic operations like point addition and points doubling on elliptic and elliptic type curves. In (Zeng et al., 2021), the authors established a trilinear pairing map of rank 3 on restricted free R-modules (R is a commutative ring) based policy-hiding attribute-based keyword search and data sharing scheme (PH-ABKS-DS) environment. The multiple key establishment approach was used for hashing purposes. Besides, it does not require a digital signature algorithm for user confirmation. But these methods are suffering from the same policy preserving problems and token generation issues. In (Ge et al., 2022), authors suggested a Diffie-Hellman problem-based key setup mechanism using Revocable Attribute-Based Encryption with Data Integrity (RABE-DI). A revocable attribute-based encryption with data integrity (RABE-DI) system maintains data integrity of 329 the original ciphertext and the cancelled ciphertext if an adversary A has the advantage. A RABE-DI system consists of the original data owner, a cloud server, an authoritative party, and the receivers. In addition, after compiling the key setup scheme, this plan illustrates that the two users can share different keys for communication. But this method suffers from the white box traceability problems. In (Xiong et al., 2021), the authors demonstrate a competent authenticated key formation strategy that recompiles in less time than Harn's protocol using Unbounded and Efficient Revocable based ABE (UER-ABE). Because the accompanying protocol relies on self-linear maps, the available shared keys (in numbers) in the following scheme are greater than those in conventional ABE.