Provably sender-deniable encryption scheme
The use of the well known provably secure public-key cryptoscheme by Rabin is extended for the case of the deniable encryption. In the proposed new sender-deniable encryption scheme the cryptogram is computed as coefficients of quadratic congruence, the roots of which are two simultaneously encrypt...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2015-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v23-n1/v23-n1-(pp62-71).pdf.pdf |