scholarly journals GBD Threshold Cryptography with an Application to RSA Key Recovery

Author(s):  
Chris Steketee ◽  
Jaimee Brown ◽  
Juan M. González Nieto ◽  
Paul Montague
2021 ◽  
Vol 190 ◽  
pp. 104511
Author(s):  
Obert C. Chikwanha ◽  
Sandra Mupfiga ◽  
Bosede R. Olagbegi ◽  
Chenaimoyo L.F. Katiyatiya ◽  
Annelin H. Molotsi ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3474
Author(s):  
Taehoon Kim ◽  
Wonbin Kim ◽  
Daehee Seo ◽  
Imyeong Lee

Recently, as Internet of Things systems have been introduced to facilitate diagnosis and treatment in healthcare and medical environments, there are many issues concerning threats to these systems’ security. For instance, if a key used for encryption is lost or corrupted, then ciphertexts produced with this key cannot be decrypted any more. Hence, this paper presents two schemes for key recovery systems that can recover the lost or the corrupted keys of an Internet of Medical Things. In our proposal, when the key used for the ciphertext is needed, this key is obtained from a Key Recovery Field present in the cyphertext. Thus, the recovered key will allow decrypting the ciphertext. However, there are threats to this proposal, including the case of the Key Recovery Field being forged or altered by a malicious user and the possibility of collusion among participating entities (Medical Institution, Key Recovery Auditor, and Key Recovery Center) which can interpret the Key Recovery Field and abuse their authority to gain access to the data. To prevent these threats, two schemes are proposed. The first one enhances the security of a multi-agent key recovery system by providing the Key Recovery Field with efficient integrity and non-repudiation functions, and the second one provides a proxy re-encryption function resistant to collusion attacks against the key recovery system.


2010 ◽  
Vol 5 (4) ◽  
pp. 449-458 ◽  
Author(s):  
Yvo G. Desmedt

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Lin Ding ◽  
Chenhui Jin ◽  
Jie Guan ◽  
Qiuyan Wang

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2231and a data complexity of 268, which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 216. Furthermore, a related key chosenIVattack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 280, requiring 264chosenIVs. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.


1998 ◽  
Vol 21 (3) ◽  
pp. 147-157 ◽  
Author(s):  
Gerhard Weck
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document