Welcome to the resource topic for 2024/1686
Title:
Circular Insecure Encryption: from Long Cycles to Short Cycles
Authors: Zehou Wu
Abstract:We prove that the existence of a CPA-secure encryption scheme that is insecure in the presence of key cycles of length n implies the existence of such a scheme for key cycles of any length less than n. Equivalently, if every encryption scheme in a class is n-circular secure and this class is closed under our construction, then every encryption scheme in this class is n'-circular secure for n' > n.
ePrint: https://eprint.iacr.org/2024/1686
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .