# Perfect Secrecy, Encryption

An encryption scheme $(\mathrm{Gen},\mathrm{Enc},\mathrm{Dec})$ over a message space $M$ is perfectly secret if and only if for every probability distribution over $M$, every message $m\in M$, and every ciphertext $c\in C$, $$\mathrm{Pr}[C=c\mid M=m]=\mathrm{Pr}[C=c].$$

Please can you help me prove this?

-

## 1 Answer

Hint: What is your definition of "perfectly secret"? What this says is that knowing the message $m$ gives you no information about the cyphertext. A perfect encryption scheme says that knowing the encrypted text gives you no information about the message. These look like inverses.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 6, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.7987262606620789, "perplexity_flag": "head"}