Articolul precedent |
Articolul urmator |
840 7 |
Ultima descărcare din IBN: 2022-06-01 15:17 |
SM ISO690:2012 MOLDOVYAN, Alexandr, MOLDOVYAN, Dmitriy, SHCHERBACOV, Victor. Stream Deniable-Encryption Algorithm Satisfying Criterion of the Computational Indistinguishability from Probabilistic Ciphering. In: Workshop on Foundations of Informatics, 24-29 august 2015, Chisinau. Chișinău, Republica Moldova: "VALINEX" SRL, 2015, I, pp. 318-330. ISBN 978-9975-4237-3-1. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Workshop on Foundations of Informatics I, 2015 |
||||||
Conferința "Workshop on Foundations of Informatics" Chisinau, Moldova, 24-29 august 2015 | ||||||
|
||||||
Pag. 318-330 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
It is proposed a method for stream deniable encryption of secret message, which is computationally indistinguishable from the probabilistic encryption of some fake message. The method uses generation of two key streams with some secure block cipher. One of the key streams is generated depending on the secret key and the other one is generated depending on the fake key. The key streams are mixed with the secret and fake data streams so that the output ciphertext looks like the ciphertext produced by some probabilistic encryption algorithm applied to the fake message with using the fake key. When the receiver or/and sender of the ciphertext are coerced to open the encryption key and the source message, they open the fake key and the fake message. To disclose their lie the coercer should demonstrate possibility of the alternative decryption of the ciphertext, however this is a computationally hard problem. |
||||||
Cuvinte-cheie cryptology, deniable, algorithm, stream, encryption |
||||||
|