Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Protecting cryptographic keys against continual leakage
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Parallel repetition for leakage resilience amplification revisited
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Achieving leakage resilience through dual system encryption
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Signatures resilient to continual leakage on memory and computation
TCC'11 Proceedings of the 8th conference on Theory of cryptography
One-time computable self-erasing functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fully leakage-resilient signatures
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Commuting signatures and verifiable encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Leakage-resilient zero knowledge
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Cryptography with tamperable and leaky memory
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Leakage-Resilient cryptography from the inner-product extractor
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
BiTR: built-in tamper resilience
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Masking with randomized look up tables
Cryptography and Security
Multiparty computation secure against continual memory leakage
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Leakage-Tolerant interactive protocols
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Identity-based encryption resilient to continual auxiliary leakage
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Malleable proof systems and applications
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Distributed public key schemes secure against continual leakage
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
From selective to full security: semi-generic transformations in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Multi-location leakage resilient cryptography
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Fully leakage-resilient signatures with auxiliary inputs
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Leakage-Resilient spatial encryption
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Barriers in cryptography with weak, correlated and leaky sources
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Signature schemes secure against hard-to-invert leakage
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
The k-BDH assumption family: bilinear map cryptography from progressively weaker assumptions
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Succinct malleable NIZKs and an application to compact shuffles
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Multi-key leakage-resilient threshold cryptography
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Leakage-resilient lossy trapdoor functions and public-key encryption
Proceedings of the first ACM workshop on Asia public-key cryptography
Leakage resilient IBE and IPE under the DLIN assumption
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Limits of a conjecture on a leakage-resilient cryptosystem
Information Processing Letters
Threshold public key encryption scheme resilient against continual leakage without random oracles
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
We say that a cryptographic scheme is Continuous Leakage-Resilient (CLR), if it allows users to refresh their secret keys, using only fresh local randomness, such that: 1. The scheme remains functional after any number of key refreshes, although the public key never changes. Thus, the “outside world'' is neither affected by these key refreshes, nor needs to know about their frequency. 2. The scheme remains secure even if the adversary can continuously leak arbitrary information about the current secret-key, as long as the amount of leaked information is bounded in between any two successive key refreshes. There is no bound on the total amount of information that can be leaked during the lifetime of the system. In this work, we construct a variety of practical CLR schemes, including CLR one-way relations, CLR signatures, CLR identification schemes, and CLR authenticated key agreement protocols. For each of the above, we give general constructions, and then show how to instantiate them efficiently using a well established assumption on bilinear groups, called the K-Linear assumption (for any constant K greater than or equal to 1). Our constructions are highly modular, and we develop many interesting techniques and building-blocks along the way, including: leakage-indistinguishable re-randomizable relations, homomorphic NIZKs, and leakage-of-cipher text non-malleable encryption schemes.