Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More
Taiga Hiroka, Fuyuki Kitagawa, Tomoyuki Morimae, Ryo, Nishimaki, Tapas Pal, Takashi Yamakawa

TL;DR
This paper introduces the concept of certified everlasting security in cryptography, providing new constructions for various primitives that guarantee security even after the receiver's deletion, leveraging quantum properties.
Contribution
It defines certified everlasting secure versions of multiple cryptographic primitives and presents novel constructions based on existing cryptographic assumptions and techniques.
Findings
Constructs for collusion-resistant FE from indistinguishability obfuscation
Secure compute-and-compare obfuscation from homomorphic encryption
Secure PKE, SKE, RNCE, and garbled circuits from standard schemes
Abstract
We study certified everlasting secure functional encryption (FE) and many other cryptographic primitives in this work. Certified everlasting security roughly means the following. A receiver possessing a quantum cryptographic object can issue a certificate showing that the receiver has deleted the cryptographic object and information included in the object was lost. If the certificate is valid, the security is guaranteed even if the receiver becomes computationally unbounded after the deletion. Many cryptographic primitives are known to be impossible (or unlikely) to have information-theoretical security even in the quantum world. Hence, certified everlasting security is a nice compromise (intrinsic to quantum). In this work, we define certified everlasting secure versions of FE, compute-and-compare obfuscation, predicate encryption (PE), secret-key encryption (SKE), public-key…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Quantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs
