The two asymptotically equivalent definitions of IND-CPA
There are two asymptotically equivalent definitions of IND-CPA for secret-key encryption schemes. I think the one-challenge one makes the proof neater.
文章来源：
Author：Gee Law’s Blog
link：https://geelaw.blog/entries/ind-cpa-defn/?utm_source=feed&utm_medium=rss