Deniable cryptosystems: simpler constructions and achieving leakage resilience

DOI10.1007/978-3-031-50594-2_2MaRDI QIDQ6550608zbMATH OpenFDO

Authors Zhiyuan An, Haibo Tian, Chao Chen, Fangguo Zhang

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-3-031-50594-2_2

zbMATH Keywords

deniable encryptionleakage resilienceside-channel attackssimulatable encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Lower and upper bounds for deniable public-key encryption
• New Practical Public-Key Deniable Encryption
• Deniable encryption with negligible detection probability: an interactive construction
• On minimal assumptions for sender-deniable public key encryption
• Bi-deniable public-key encryption

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A homomorphic LWE based E-voting scheme
• Bi-deniable public-key encryption
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Constrained pseudorandom functions and their applications
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Deniable encryption in a Quantum world
• Deniable Encryptions Secure against Adaptive Chosen Ciphertext Attack
• Deniable fully homomorphic encryption from learning with errors
• Deniable Functional Encryption
• Deniable searchable symmetric encryption
• Exposure-resilient functions and all-or-nothing transforms
• Fully deniable interactive encryption
• Fully homomorphic encryption using ideal lattices
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• scientific article; zbMATH DE number 1759297 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Improved non-committing encryption with applications to adaptively secure protocols
• Indistinguishability obfuscation from well-founded assumptions
• New Practical Public-Key Deniable Encryption
• Public-key encryption schemes with auxiliary inputs
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Theory of Cryptography
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls
• Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Cited in

(1)

• Deny whatever you want: dual-deniable public-key encryption

This page was built for publication: Deniable cryptosystems: simpler constructions and achieving leakage resilience

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