network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | Nov 21 '12 at 11:32 | |
| stats | profile views | 7 |
Cryptography? I'm preparing to the exam :)
|
Nov 5 |
accepted | Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure? |
|
Nov 5 |
awarded | Scholar |
|
Nov 5 |
accepted | Messages of different lengths and one-time computationally-secret |
|
Nov 5 |
accepted | Modifications of CBC-MAC |
|
Oct 30 |
comment |
Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure? I think I do not understand some statements. What does it exactly mean, that "MAC is deterministic"? And if MAC parts of these two messages are equal? Could you help me with understanding how (un)likely is such event? |
|
Oct 30 |
comment |
Messages of different lengths and one-time computationally-secret What is efficiency condition? Could you tell me a little bit more how should the formal proof be looking like? I think I know what is the idea, but I have big problem with writing it down rigorously. Thank you. |
|
Oct 28 |
awarded | Student |
|
Oct 28 |
revised |
Messages of different lengths and one-time computationally-secret Added definition of one-time computationally-secret encryption scheme |
|
Oct 28 |
comment |
Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure? $1^n = \underbrace{1 1 \ldots 1}_n$. The security parameter $n$ needs to be given to algorithms in the form of $1^n$ in order for algorithms to run in time bounded by a polynomial in $n$ instead of $||n||=\log_2(n)$. |
|
Oct 28 |
asked | Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure? |
|
Oct 28 |
awarded | Editor |
|
Oct 28 |
asked | Modifications of CBC-MAC |
|
Oct 28 |
revised |
Messages of different lengths and one-time computationally-secret added 3 characters in body |
|
Oct 28 |
asked | Messages of different lengths and one-time computationally-secret |
