Efficient fully deniable public-key encryption from hidden-position key encapsulation

DOI10.1016/J.TCS.2026.116225MaRDI QIDQ7396336zbMATH OpenFDO

Authors Pengyu Gao, Jingwei Hu, Meixia Miao, Jianghong Wei, Huaxiong Wang

Publication date 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116225

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Adaptively secure, universally composable, multiparty computation in constant rounds
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Deniable cryptosystems: simpler constructions and achieving leakage resilience
• Deniable fully homomorphic encryption from learning with errors
• Deniable Functional Encryption
• Deniable searchable symmetric encryption
• Deny whatever you want: dual-deniable public-key encryption
• Efficent receipt-free voting based on homomorphic encryption
• Fully deniable interactive encryption
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2003
• Lower and upper bounds for deniable public-key encryption
• New Practical Public-Key Deniable Encryption
• New receipt-free voting scheme using double-trapdoor commitment
• Practical Deniable Encryption
• Practical receipt-free sealed-bid auction in the coercive environment
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

This page was built for publication: Efficient fully deniable public-key encryption from hidden-position key encapsulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396336)