Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks

Authors:
Shengli Liu;Jian Weng;Yunlei Zhao
Affiliations:
Dept. of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China,State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sci ...;Department of Computer Science, Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security, Jinan University, China,Shanghai Key Laboratory of Scalable Compu ...;Software School, Fudan University, Shanghai, China,State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Venue:
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Year:
2013

Citing 21
Cited 1

Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography
A survey of fast exponentiation methods

Journal of Algorithms
Complexity and Fast Algorithms for Multiexponentiations

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Differential Power Analysis

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Differential Fault Analysis of Secret Key Cryptosystems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
On lattices, learning with errors, random linear codes, and cryptography

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A computational introduction to number theory and algebra

A computational introduction to number theory and algebra
A block cipher based pseudo random number generator secure against side-channel key recovery

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

SIAM Journal on Computing
One-Time Programs

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Leakage-Resilient Cryptography

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Lest we remember: cold boot attacks on encryption keys

SS'08 Proceedings of the 17th conference on Security symposium
Simultaneous Hardcore Bits and Cryptography against Memory Attacks

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A Leakage-Resilient Mode of Operation

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Public-Key Cryptosystems Resilient to Key Leakage

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
On the importance of checking cryptographic protocols for faults

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Leakage-resilient lossy trapdoor functions and public-key encryption

Proceedings of the first ACM workshop on Asia public-key cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ+m≤logq−ω(logκ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to logq, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ≤logq−ω(logκ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to logq−ω(logκ) leakage.