Anamorphic Encryption: New Constructions and Homomorphic Realizations

被引:4
作者
Catalano, Dario [1 ]
Giunta, Emanuele [2 ,3 ,4 ]
Migliaro, Francesco [1 ]
机构
[1] Univ Catania, Dipartimento Matemat & Informat, Catania, Italy
[2] IMDEA Software Inst, Madrid, Spain
[3] Univ Politecn Madrid, Madrid, Spain
[4] Web 3 0 Fdn, Zug, Switzerland
来源
ADVANCES IN CRYPTOLOGY, PT II, EUROCRYPT 2024 | 2024年 / 14652卷
关键词
ATTACKS;
D O I
10.1007/978-3-031-58723-8_2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The elegant paradigm of Anamorphic Encryption (Persiano et al., Eurocrypt 2022) considers the question of establishing a private communication in a world controlled by a dictator. The challenge is to allow two users, sharing some secret anamorphic key, to exchange covert messages without the dictator noticing, even when the latter has full access to the regular secret keys. Over the last year several works considered this question and proposed constructions, novel extensions and strengthened definitions. In this work we make progress on the study of this primitive in three main directions. First, we show that two general and well established encryption paradigms, namely hybrid encryption and the IBE-to-CCA transform, admit very simple and natural anamorphic extensions. Next, we show that anamorphism, far from being a phenomenon isolated to "basic" encryption schemes, extends also to homomorphic encryption. We show that some existing homomorphic schemes, (and most notably the fully homomorphic one by Gentry, Sahai and Waters) can be made anamorphic, while retaining their homomorphic properties both with respect to the regular and the covert message. Finally we refine the notion of anamorphic encryption by envisioning the possibility of splitting the anamorphic key into an encryption component (that only allows to encrypt covert messages) and a decryption component. This makes possible for a receiver to set up several, independent, covert channels associated with a single covert key.
引用
收藏
页码:33 / 62
页数:30
相关论文
共 23 条
[1]   Fully Homomorphic NIZK and NIWI Proofs [J].
Ananth, Prabhanjan ;
Deshpande, Apoorvaa ;
Kalai, Yael Tauman ;
Lysyanskaya, Anna .
THEORY OF CRYPTOGRAPHY, TCC 2019, PT II, 2019, 11892 :356-385
[2]  
Banfi F., 2023, Report 2023/249
[3]  
Blaze M., 1994, 2nd ACM Conference on Computer and Communications Security, P59, DOI 10.1145/191177.191193
[4]  
Blum M., 1985, P ADV CRYPTOLOGY, P289
[5]   Chosen-ciphertext security from identity-based encryption [J].
Boneh, Dan ;
Canetti, Ran ;
Halevi, Shai ;
Katz, Jonathan .
SIAM JOURNAL ON COMPUTING, 2006, 36 (05) :1301-1328
[6]  
Canetti R, 1997, LECT NOTES COMPUT SC, V1294, P90
[7]  
Cramer R, 1998, LECT NOTES COMPUT SC, V1462, P13, DOI 10.1007/BFb0055717
[8]  
Frankel Y, 1995, LECT NOTES COMPUT SC, V963, P222
[9]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[10]  
Impagliazzo R., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P12, DOI 10.1145/73007.73009