CRYPTO NEWS

ETH may consolidate as Merge excitement wears off, says expert

Markus Thielen of Singapore asset manager IDEG believes ETH could be headed for a consolidation phase, turning “cautious” on the cryptocurrency.

Indistinguishability models equivalence

I’m trying to prove the equivalence of LOR-CPA (ciphertext indistinguishability) and ROR-CPA (indistinguishability from random) models and looking for a "sketch" for this proof. Let’s assume a symmetric case $-$ models are defined for symmetric ciphers (e.g. secure block cipher in CBC mode with randomized IV). The idea of ROR $implies$ LOR is clear: if::Listen

I’m trying to prove the equivalence of LOR-CPA (ciphertext indistinguishability) and ROR-CPA (indistinguishability from random) models and looking for a "sketch" for this proof. Let’s assume a symmetric case $-$ models are defined for symmetric ciphers (e.g. secure block cipher in CBC mode with randomized IV).

The idea of ROR $implies$ LOR is clear: if one ciphertext is indistinguishable from random string, same holds for another one, then obviously they are indistinguishable from each other. Of course, one should prove it more accurate, but for now I need a "proof sketch" $-$ just an idea.

But what about LOR $implies$ ROR proof? I can’t figure out, why indistinguishability of two ciphertexts implies indistinguishability of them from random strings. Can anyone give a hint? The rest I’ll try to complete by myself 🙂

ETH may consolidate as Merge excitement wears off, says expert

Shopping cart
There are no products in the cart!
Continue shopping
0