# Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation

@inproceedings{Chen2018LeakageResilientCF,
title={Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation},
author={Yu Chen and Yuyu Wang and Hong-Sheng Zhou},
booktitle={IACR Cryptol. ePrint Arch.},
year={2018}
}
• Published in IACR Cryptol. ePrint Arch. 2 December 2018
• Mathematics, Computer Science
In this work, we develop a framework for building leakage-resilient cryptosystems in the bounded leakage model from puncturable primitives and indistinguishability obfuscation ($$i\mathcal {O}$$). The major insight of our work is that various types of puncturable pseudorandom functions (PRFs) can achieve leakage resilience on an obfuscated street.
Strong Leakage and Tamper-Resilient PKE from Refined Hash Proof System
• Computer Science, Mathematics
ACNS
• 2019
This work presents an enhanced security against both kinds of attacks, namely strong leakage and tamper-resilient chosen-ciphertext (sLTR-CCA) security, and proposes a generic paradigm achieving this security on the basis of a refined hash proof system (HPS) called public-key-malleable HPS.
Public-Key Cryptography – PKC 2020: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4–7, 2020, Proceedings, Part I
• Computer Science, Mathematics
Public Key Cryptography
• 2020
The talk will survey some of this work in minimizing well-motivated complexity measures of lower-end primitives that would otherwise seem poorly motivated, and make the case that despite the progress already made, there is much more to be explored.
Witness Maps and Applications
• Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
• 2020
A Dual Mode Witness Map (DMWM) is defined which adds an “extractable” mode to a CWM, a relaxation of UWM which maps all the witnesses to a small number of witnesses, resulting in a “lossy” deterministic-prover, non-interactive proof-system.

## References

SHOWING 1-10 OF 62 REFERENCES
Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation
• Computer Science, Mathematics
Inscrypt
• 2016
Leakage-resilient cryptography requires that a crypto-system remain provably secure even if the attacker gets additional information about the internal states, which is usually the secret key in the
Achieving Leakage Resilience through Dual System Encryption
• Computer Science, Mathematics
TCC
• 2011
This work provides fully secure IBE, HIBE, and ABE systems which are resilient to bounded leakage from each of many secret keys per user, as well as many master keys.
Authenticated Encryption in the Face of Protocol and Side Channel Leakage
• Computer Science, Mathematics
ASIACRYPT
• 2017
It is shown how to achieve authenticated encryption that is simultaneously both misuse resistant and leakage resilient, based on a sufficiently leakage resilient PRF, and finally a concrete, pairing-based instantiation of the latter is proposed.
Leakage-Resilient Public-Key Encryption from Obfuscation
• Computer Science, Mathematics
Public Key Cryptography
• 2016
A compiler is presented that transforms any public-key encryption or signature scheme to one that is continual leakage resilient with leakage on key updates, assuming indistinguishability obfuscation and adapting and optimizing recent techniques of Sahai and Waters STOC 2014 that make any encryption scheme sender-deniable.
Public-Coin Differing-Inputs Obfuscation and Its Applications
• Computer Science, Mathematics
TCC
• 2015
Differing inputs obfuscation (diO) is a strengthening of indistinguishability obfuscation (iO) that has recently found applications to improving the efficiency and generality of obfuscation,
Differential Fault Analysis of Secret Key Cryptosystems
• Computer Science, Mathematics
CRYPTO
• 1997
This work states that this attack is applicable only to public key cryptosystems such as RSA, and not to secret key algorithms such as the Data Encryption Standard (DES).
Barriers in cryptography with weak, correlated and leaky sources
There has been much recent progress in constructing cryptosystems that maintain their security without requiring uniform randomness and perfect secrecy. These schemes are motivated by a diverse set
Signatures Resilient to Uninvertible Leakage
• Computer Science, Mathematics
SCN
• 2016
In this paper, we present a fully leakage resilient signature scheme in the selective auxiliary input model, which captures an extremely wide class of side-channel attacks that are based on physical
Leakage-Resilient Authentication and Encryption from Symmetric Cryptographic Primitives
• Computer Science, Mathematics
CCS
• 2015
This paper proposes and analyzes new constructions of leakage-resilient MAC and encryption schemes, which allow fixing security and efficiency drawbacks of previous proposals in this direction.
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
• Computer Science, Mathematics
2010 IEEE 51st Annual Symposium on Foundations of Computer Science
• 2010
This work constructs public-key encryption schemes, digital signatures, and identity-based encryption schemes that remain secure even if an attacker can leak a constant fraction of the secret memory in each time period between key updates.