A Framework for Unconditionally Secure Public-Key Encryption (with Possible Decryption Errors)

  • Mariya Bessonov
  • Dima Grigoriev
  • Vladimir ShpilrainEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10931)


We offer a public-key encryption protocol where decryption of a single bit by a legitimate party is correct with probability p that is greater than 1/2 but less than 1. At the same time, a computationally unbounded (passive) adversary correctly recovers the transmitted bit with probability exactly 1/2.


  1. 1.
    Bessonov, M., Grigoriev, D., Shpilrain, V.: Probabilistic solution of Yao’s millionaires’ problem, preprint.
  2. 2.
    Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342–360. Springer, Heidelberg (2004). Scholar
  3. 3.
    Holenstein, T., Renner, R.: One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 478–493. Springer, Heidelberg (2005). Scholar
  4. 4.
    Osin, D., Shpilrain, V.: Public key encryption and encryption emulation attacks. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 252–260. Springer, Heidelberg (2008). Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Mariya Bessonov
    • 1
  • Dima Grigoriev
    • 2
  • Vladimir Shpilrain
    • 3
    Email author
  1. 1.New York City College of TechnologyBrooklynUSA
  2. 2.Université de LilleLilleFrance
  3. 3.The City College of New YorkNew YorkUSA

Personalised recommendations