Latest update

- How to prove f has degree at most n, with the caveat that |z|>R
- Trigonometric function based sums
- Quick Archimedean Property Question. Sequence Convergence
- Show that every non-degenerate perfect set in $\mathbb{R}^4$ is uncountable.
- Find f(x) using definition of differentiability
- Using $Q$ as in the Gauss-Seidel method, prove that if $A$ is diagonally dominant, then $\|I-Q^{-1}A\|_{\infty}<1$.
- Show that $E[M_{\tau}] = E[M_{m}]$ where $\tau = a 1_{A} + b 1_{A^{C}}$
- Flipping to terms in lamda calculus
- put n balls into n boxes
- Define homomorphism between two algebraic structures
- How to evaluate $\lim_{x\to0} \frac{1-\cos(x)}{x^2}$ in terms of $\alpha = \lim_{x\to0} \frac{\sin(x)}{x}$?
- What is the correct parametrisation of this curve, and why is it so?
- This is a example from a book. let X be the number of faces that never show up in these n rolls
- Proof: Show that if A is similar to $B$ and $A$ is nonsingular, then $B$ must also be nonsingular and $A^{-1}$ and $B^{-1}$ are similar
- A geometry question.
- Gauss Theorem application
- Delay estimation
- Prob. 10, Sec. 3.5, in Bartle & Sherbert's INTRO TO REAL ANALYSIS: If $x_1 < x_2$ are arbitrary real numbers and . . .
- Applied Uses for Pure Theorems (“Mathematical Sinners”)
- Why a term that comes out of variance braket is squared?

# One-time pad and Perfect secrecy

2018-03-22 03:18:19

Consider the following property of one-time symmetric encryption scheme (Enc, Dec, K). For Every message distribution M, every pair of messages $m_{_0}$,$m_{_1}$ belongs to M and every ciphertext c belongs to C, it holds that: (Pr means Probability)

Pr[M=$m_{_0}$ | C=c] = Pr[M=$m_{_1}$ | C=c]

Argue that the above property is not a characterization of perfect secrecy via a counterexample. (Consider the one-time pad and any non-uniform distribution over {0,1}^j )