Practical Deniable Encryption
- Marek KlonowskiAffiliated withInstitute of Mathematics and Computer Science, Wrocław University of Technology
- , Przemysław KubiakAffiliated withInstitute of Mathematics and Computer Science, Wrocław University of Technology
- , Mirosław KutyłowskiAffiliated withInstitute of Mathematics and Computer Science, Wrocław University of Technology
A party using encrypted communication or storing data in an encrypted form might be forced to show the corresponding plaintext. It may happen for law enforcement reasons as well as for evil purposes. Deniable encryption scheme introduced by Canetti et al. shows that cryptography can be used against revealing information: the owner of the data may decrypt it in an alternative way to a harmless plaintext. Moreover, it is impossible to check if there is another hidden plaintext.
The scheme of Canetti is inefficient in the sense that it is a special purpose scheme and using it indicates that there is some hidden message inside. We show that deniable encryption can be implemented in a different way so that it does not point to exploiting deniable encryption. Moreover, it is quite straightforward, so it can be used for both good and evil purposes.
Apart from that we show that even the special purpose original scheme can be extended to allow, in some circumstances, any “depth” of deniability.
- Practical Deniable Encryption
- Book Title
- SOFSEM 2008: Theory and Practice of Computer Science
- Book Subtitle
- 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008. Proceedings
- pp 599-609
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- deniable encryption
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.