scholarly journals Democratic key escrow scheme

1997 ◽  
pp. 249-260 ◽  
Author(s):  
Chor Wah Man ◽  
Rei. Safavi-Naini
Keyword(s):  
Key Escrow

scholarly journals A LIGHTWEIGHT AUTHENTICATION TECHNIQUE FOR SECURE COMMUNICATION OF EDGE/FOG DATA-CENTERS

2020 ◽  
Vol 2 (1) ◽  
pp. 76-81
Author(s):  
Muktar Yahuza ◽  
Yamani Idna Bin Idris ◽  
Ainuddin Wahid Bin Abdul Wahab ◽  
Mahdi A. Musa ◽  
Adamu Abdullahi Garba
Keyword(s):  
Load Balancing ◽  
Secure Communication ◽  
Secret Key ◽  
End User ◽  
Resource Constrained ◽  
Key Escrow ◽  
Academic Researchers ◽  
Cloud Datacenter ◽  
Lightweight Authentication ◽  
Data Centres

Edge computing has significantly enhanced the capabilities of cloud computing. Edge data-centres are used for storing data of the end-user devices. Secure communication between the legitimate edge data-centres during the load balancing process has attracted industrial and academic researchers. Recently, Puthal et al. have proposed a technique for authenticating edge datacenters to enable secure load balancing. However, the resource-constraint nature of the edge data-centres is ignored. The scheme is characterized by complex computation and memory intensive cryptographic protocol. It is also vulnerable to key escrow attack because the secret key used for encrypting and decrypting of the communicated messages is been created by the trusted cloud datacenter. Additionally, the key sharing phase of their algorithm is complex. Therefore, to address the highlighted challenges, this paper proposed a lightweight key escrow-less authentication algorithm that will ensure secure communication of resource-constrained edge data-centres during the load balancing process. The security capability of the proposed scheme has been formally evaluated using the automatic cryptographic analytical tool ProVerif. The relatively low computation and communication costs of the proposed scheme compared to the benchmark schemes proved that it is lightweight, thus suitable for resource-constrained edge datacenters.      

scholarly journals Privacy-Preserving Scheme in the Blockchain Based on Group Signature with Multiple Managers

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Fei Tang ◽  
Zhuo Feng ◽  
Qianhong Gong ◽  
Yonghong Huang ◽  
Dong Huang
Keyword(s):  
Single Point ◽  
Privacy Preserving ◽  
Bilinear Pairing ◽  
Group Signature ◽  
Key Generation ◽  
Provable Data Possession ◽  
Key Escrow ◽  
Authentication Mechanism ◽  
Traditional Scheme

Group signature can provide the privacy-preserving authentication mechanism for the blockchain. In the traditional blockchain privacy-preserving scheme based on the group signature, there is only one group manager to revoke the anonymity. Thus, the traditional scheme will have single point of failure and key escrow problems. To solve these problems, we propose a privacy-preserving scheme in the blockchain based on the group signature with multiple managers. Our scheme is constructed based on bilinear pairing and the technique of distributed key generation. Finally, we analyze the application of the proposed scheme in the field of blockchain-based provable data possession (PDP), as well as the correctness and security of the scheme.

scholarly journals A Reliable Time Lock Encryption Scheme For Relatively Weak Computational Resources

2019 ◽  
Vol 8 (2) ◽  
pp. 893-897
Keyword(s):  
Real World ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Paper Briefly ◽  
Prototype Implementation ◽  
Key Escrow ◽  
Computational Overhead ◽  
Mortgage Payment ◽  
Encryption Decryption ◽  
Computational Resources

Time-lock encryption is a type of encryption in which the process is bound by a factor of time that enables previously impossible applications such as secure auctions, mortgage payment, key escrow, or fair multiparty computations. Existing solution approaches of time lock either employ computational overhead to calculate time or use analogues to map the real-world time, hence lacks reliability. We propose a reliable time-lock encryption scheme, where even receivers with relatively weak computational resources can decrypt the cipher after an accurate real-world deadline, without any interaction with the sender. Proposed solution uses time fetched from timeservers over secured https channel for time lock accuracy and strong AES-256 encryption/decryption techniques for reliability. The paper briefly discusses a java based prototype implementation of the proposed approach and the experimental results

Key escrow in mutually mistrusting domains

1997 ◽  
pp. 139-153 ◽  
Author(s):  
L. Chen ◽  
D. Gollmann ◽  
C. J. Mitchell
Keyword(s):  
Key Escrow
Sign in / Sign up

Export Citation Format

Share Document