Advertisement

Method for Pseudo-probabilistic Block Encryption

  • Moldovyan Nikolay Andreevich
  • Moldovyan Alexander Andreevich
  • Tam Nguyen Duc
  • Hai Nguyen Nam
  • Minh Nguyen HieuEmail author
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 221)

Abstract

There is considered implementation of the plan-ahead share-key deniable encryption algorithms that produce the cryptogram that satisfy criterion of the computational indistinguishability from probabilistic encryption of the fake message. This paper introduces a general design of the pseudoprobabilistic block ciphers. The proposed method includes encryption of the secret message block and the fake message block followed by a transformation procedure mapping the pair of intermediate ciphertext blocks into a single block of the output ciphertext. The transformation procedure represents solving the system of two linear congruencies.

Keywords

Block cipher Plan-ahead Shared-key Pseudo-probabilistic cipher Symmetric Deniable Encryption 

References

  1. 1.
    Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable encryption. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 90–104. Springer, Heidelberg (1997).  https://doi.org/10.1007/BFb0052229 CrossRefGoogle Scholar
  2. 2.
    O’Neill, A., Peikert, C., Waters, B.: Bi-deniable public-key encryption. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 525–542. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22792-9_30 CrossRefGoogle Scholar
  3. 3.
    Moldovyan, N.A., Shcherbacov, A.V., Eremeev, M.A.: Deniable-encryption protocols based on commutative ciphers. Quasigroups Relat. Syst. 95–108 (2017)Google Scholar
  4. 4.
    Meng, B.: A secure internet voting protocol based on non-interactive deniable authentication protocol and proof protocol that two ciphertexts are encryption of the same plaintext. J. Netw. 4, 370–377 (2009)Google Scholar
  5. 5.
    Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406–425. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20465-4_23 CrossRefGoogle Scholar
  6. 6.
    Moldovyan, A.A., Moldovyan, D.N., Shcherbacov, V.A.: Stream deniable-encryption algorithm satisfying criterion of the computational indistinguishability from probabilistic ciphering. In: Workshop on Foundations of Informatics, Chisinau, pp. 318–330 (2015)Google Scholar
  7. 7.
    Moldovyan, N.A., Moldovyan, A.A., Moldovyan, D.N., Shcherbacov, V.A.: Stream deniable-encryption algorithms. Comput. Sci. J. Mold. 24, 68–82 (2016)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Moldovyan, N.A., Moldovyan, A.A.: Data-driven Block Ciphers for Fast Telecommunication Systems, 1st edn. Auerbach Publications, Boston (2007)CrossRefzbMATHGoogle Scholar
  9. 9.
    Dürmuth, M., Freeman, D.M.: Deniable encryption with negligible detection probability: an interactive construction. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 610–626. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20465-4_33 CrossRefGoogle Scholar
  10. 10.
    Barakat, T.M.: A new sender-side public-key deniable encryption scheme with fast decryption. KSII Trans. Internet Inf. Syst. (TIIS) 8, 3231–3249 (2014)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018

Authors and Affiliations

  • Moldovyan Nikolay Andreevich
    • 1
  • Moldovyan Alexander Andreevich
    • 1
  • Tam Nguyen Duc
    • 2
  • Hai Nguyen Nam
    • 2
  • Minh Nguyen Hieu
    • 2
    Email author
  1. 1.St. Petersburg Institute for Informatics and Automation of Russian Academy of SciencesSt. PetersburgRussia
  2. 2.Academy of Cryptography TechniquesHanoiVietnam

Personalised recommendations