Public-key cryptosystems resilient to continuous tampering and leakage of arbitrary functions

N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present the first chosen-ciphertext secure public-key encryption schemes resilient to continuous tampering of arbitrary (efficiently computable) functions. Since it is impossible to realize such a scheme without a self-destruction or key-updating mechanism, our proposals allow for either of them. As in the previous works resilient to this type of tampering attacks, our schemes also tolerate bounded or continuous memory leakage attacks at the same time. Unlike the previous results, our schemes have efficient instantiations, without relying on zero-knowledge proofs.We also prove that there is no secure digital signature scheme resilient to arbitrary tampering functions against a stronger variant of continuous tampering attacks, even if it has a self-destruction mechanism.

Cite

CITATION STYLE

APA

Fujisaki, E., & Xagawa, K. (2016). Public-key cryptosystems resilient to continuous tampering and leakage of arbitrary functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10031 LNCS, pp. 908–938). Springer Verlag. https://doi.org/10.1007/978-3-662-53887-6_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free