Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1072 7 |
Ultima descărcare din IBN: 2023-05-10 16:58 |
Căutarea după subiecte similare conform CZU |
004.056.55:519.254 (3) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4095) |
Probabilitate. Statistică matematică (81) |
SM ISO690:2012 MOLDOVYAN, Nikolay, SHCHERBACOV, Alexei, EREMEEV, Mikhail. Deniable-encryption protocols based on commutative ciphers. In: Quasigroups and Related Systems, 2017, vol. 25, nr. 1(37), pp. 95-108. ISSN 1561-2848. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Quasigroups and Related Systems | |
Volumul 25, Numărul 1(37) / 2017 / ISSN 1561-2848 | |
|
|
CZU: 004.056.55:519.254 | |
MSC 2010: 94A60, 11S05 | |
Pag. 95-108 | |
Descarcă PDF | |
Rezumat | |
There are considered three new deniable encryption protocols representing practical interest. The sender-deniable and sender and receiver-deniable ones have been designed on the base of combining commutative encryption function (Vernam cipher) with probabilistic public key encryption (RSA algorithm), subexponential resistance to coercive attack being obtained. To get exponential deniability it is proposed to use the ElGamal-like probabilistic algorithm based on computational difficulty of discrete logarithm on elliptic curves instead of the RSA one. The third DE protocol is based on the Pohlig-Hellman exponentiation cipher and represents a planahead shared-key bi-deniable scheme satisfying criterion of computational indistinguishability from probabilistic encryption protocol. Each of the proposed deniable encryption schemes is a three-pass protocol. |
|
Cuvinte-cheie cryptography, public encryption, commutative encryption, deniable encryption, shared key, probabilistic encryption |
|
|