Deniability of symmetric encryption based on computational indistinguishability from probabilistic ciphering

DOI10.1007/978-981-10-7512-4_21MaRDI QIDQ5117282zbMATH OpenOpenAlexFDO

Authors Ahmed al-Majmar Nashwan, Duc Tam Nguyen, Nam Hai Nguyen, Hieu Minh Nguyen, N. A. Moldovyan

Publication date 20 August 2020

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-10-7512-4_21

zbMATH Keywords

computational indistinguishabilityprobabilistic cipheringshared-key deniable encryptionsymmetric encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Stream deniable-encryption algorithms
• Deniable encryption with negligible detection probability: an interactive construction
• scientific article; zbMATH DE number 1088228
• Deniable Encryptions Secure against Adaptive Chosen Ciphertext Attack
• Practical method for bi-deniable public-key encryption

Cites work

• Bi-deniable public-key encryption
• Efficient non-interactive secure computation
• Generating cubic equations as a method for public encryption
• scientific article; zbMATH DE number 177050 (Why is no real title available?)
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• scientific article; zbMATH DE number 7177933 (Why is no real title available?)
• New algorithms and protocols for information authentication in automatic control systems
• Practical Deniable Encryption

Cited in

(5)

• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Stream deniable-encryption algorithms
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• scientific article; zbMATH DE number 6536413 (Why is no real title available?)
• Computationally Sound Symbolic Secrecy in the Presence of Hash Functions

This page was built for publication: Deniability of symmetric encryption based on computational indistinguishability from probabilistic ciphering

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