Sort by:

• Highly Influential Citations
• Citations
• Acceleration
• Velocity
• Recency

Learn More

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

• Andrey Nikolaevich Berezin, A. A. Moldovyan, N. A. Moldovyan
• 2015 XVIII International Conference on Soft…
• 2015

For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some… (More)

On Using Mersenne Primes in Designing Cryptoschemes

• Nikolay Andreevich Moldovyan, Alexander Andreevich Moldovyan, Andrey Nikolaevich Berezin
• I. J. Network Security
• 2016

The paper proposes justification of using Mersenne primes in the following cryptoschemes: commutative and publickey encryption algorithms and zero-knowledge protocol. The cryptoschemes are based on… (More)

Randomized pseudo-probabilistic encryption algorithms

• A. A. Moldovyan, N. A. Moldovyan, Andrey Nikolaevich Berezin, Prof. A. I. Shapovalov
• 2017 XX IEEE International Conference on Soft…
• 2017

The aim of the paper is providing resistance of the deniable encryption protocols to coercive attacks at which coercer has possibility to cause repeated encryption of the same input messages and/or… (More)

Deniable encryption protocols based on probabilistic public-key encryption

• Nikolay A. Moldovyan, Andrey Nikolaevich Berezin, Anatoly Kornienko, Alexander A. Moldovyan
• 2017 20th Conference of Open Innovations…
• 2017

The paper proposes a new method for designing deniable encryption protocols characterized in using RSA-like probabilistic public-key encryption algorithms. Sender-, receiver-, and bi-deniable… (More)

• ‹
• 1
• ›