Loading...

Design of Leakage-resilient and Tamper-resilient Encoding Schemes with Provable Security

Mortazavi, Amir | 2018

826 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 51055 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Salmasizadeh, Mahmoud; Daneshgar, Amir
  7. Abstract:
  8. Security analysis of cryptographic systems against implementation attacks, including active and passive attacks, is an important issue due to the large number of such attacks in the real world. Since 2000’s, cryptographers have begun attempting to model active and passive attacks to implementation of cryptographic algorithms. At first, cryptographers modeled the attackers with ability to exploit leakaged information, leading to leakage-resilient cryptography. Afterwards, cryptographers modeled the attackers with ability to tamper with the cryptographic algorithms which led to tamper-resilient cryptography. Actually, the major proposed cryptographic primitive dealing with tampering is the concept of a non-malleable code.In this dissertation, on the one hand, we propose a unified framework for security models related to tamper-detection and leakage-resilience, and on the other hand, we introduce a new strongly secure continuous non-malleable encoding scheme having tamper-detection property with respect to all polynomial-time adversaries, satisfying a better leakage bound whose security is based on the existence of secure MAC’s. Also, as a byproduct, we introduce and justify the importance of an intermediate security model called semistrong continuous non-malleability, while we discuss different variants of these security models and provide a secure semistrong continuous non-malleable encoding scheme whose security is based on the existence of CCA-secure public-key encryption. Also, we present a new proof for continuous non-malleability of the FMNV scheme, while the new proof will also give rise to an improved and more efficient version of this scheme. The new proof also shows that one may achieve continuous non-malleability of the same security with fewer bits for the leakage bound
  9. Keywords:
  10. Provable Security ; Cryptosystem ; leakage-Resilient ; Tampering ; Tamper-Resilient ; Non-Malleabity

 Digital Object List

 Bookmark

...see more