Yoroi: Updatable Whitebox Cryptography

Author(s):  
Yuji Koike ◽  
Takanori Isobe

Whitebox cryptography aims to provide security in the whitebox setting where the adversary has unlimited access to the implementation and its environment. In order to ensure security in the whitebox setting, it should prevent key extraction attacks and code-lifting attacks, in which the adversary steals the original cryptographic implementation instead of the key, and utilizes it as a big key. Although recent published ciphers such as SPACE, SPNbox, and Whiteblock successfully achieve security against the key extraction attacks, they only provide mitigation of codelifting attack by the so-called space hardness and incompressibility properties of the underlying tables as the space-hard/incompressible table might be eventually stolen by continuous leakage. The complete prevention of such attacks may need to periodically update the secret key. However, that entails high costs and might introduce an additional vulnerability into the system due to the necessity for the reencryption of all data by the updated key. In this paper, we introduce a new property, denominated longevity, for whitebox cryptography. This property enhances security against code-lifting attacks with continuous leakage by updating incompressible tables instead of the secret key. We propose a family of new whitebox-secure block ciphers Yoroi that has the longevity property in addition to the space hardness. By updating its implementation periodically, Yoroi provides constant security against code-lifting attacks without key updating. Moreover, the performance of Yoroi is competitive with existing ciphers implementations in the blackbox and whitebox context.

2013 ◽  
Vol 12 (5) ◽  
pp. 917-930 ◽  
Author(s):  
Sriram Nandha Premnath ◽  
Suman Jana ◽  
Jessica Croft ◽  
Prarthana Lakshmane Gowda ◽  
Mike Clark ◽  
...  

2021 ◽  
Author(s):  
Ibraheem Abdelazeem Ibraheem Ali ◽  
Zhang Weibin ◽  
Zhenping Zeng ◽  
Abdeldime mohamed saleh

Abstract Security in Vehicular Ad Hoc Network (VANET) is one of the major challenging topics and the secure key interchange between two legitimate vehicles is an important issue. The multi-environment of VANET has been exploited to extract the secret key and employed security services in VANET. However, it offered more excellence randomness owed to fading, noise multi-path, and velocity difference. Some of the factors like Bit-rate, complication and memory requests are reduced by using a process known as quantization. This paper proposes a new quantization method to extract the secret key for vehicular communications that uses a lossy quantizer in combination with information reconciliation and privacy amplification. Our work focuses on the quantization phase for the secret generation procedure. The comprehensive simulations display the propose method increases the zone and number of the quantization levels to utilize the maximum number of measurements to reduce reasonably the wasted measurements.


2020 ◽  
Vol 66 (1) ◽  
pp. 11-21 ◽  
Author(s):  
Mi-Kyung Oh ◽  
Sangjae Lee ◽  
Yousung Kang ◽  
Dooho Choi

Sign in / Sign up

Export Citation Format

Share Document