Skip to main content

Verifiable Encryption

  • Reference work entry
Encyclopedia of Cryptography and Security
  • 729 Accesses

Related Concepts

Zero Knowledge Proof


Verifiable encryption is an encryption scheme where one can prove some property of a message m, while the message is given in an encrypted form. When an encryption scheme is secure, the encryption E(m) should reveal no information regarding m. But this property may not be suitable in cases where checking some property of the encrypted content is required before processing the encrypted data. Verifiable encryption allows a verifier to check certain property of the content that is encrypted.


An example of such a case is a key escrow_scheme. In a typical key escrow scheme, when a sender sends an encrypted message, he is required to encrypt the key which he used to encrypt the message, and the encryption of the key is by using the escrow agent’s public key. This way, the escrow agent can always obtain the key used to encrypt the message, and thus the escrow agent can read the message. However, the sender can fool the escrow...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Camenisch J, Damgård I (2000) Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In: Okamoto T (ed) Proceedings of AłSIACRYPT 2000, Lecture notes in computer science, vol 1976, Springer, Berlin, pp 331–345

    Google Scholar 

  2. Camenisch J, Shoup V (2003) Practical verifiable encryption and decryption of discrete logarithms. In: Boneh D (ed) Proceedings of CRYPTO 2003, Lecture notes in computer science, vol 2729, Springer, Berlin, pp 126–144

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Sako, K. (2011). Verifiable Encryption. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA.

Download citation

Publish with us

Policies and ethics