Talk:Ciphertext indistinguishability

From Wikipedia, the free encyclopedia

References would be nice! —Preceding unsigned comment added by 141.201.6.60 (talk) 12:50, 25 February 2008 (UTC)

[edit] Incorrect definition for IND-CPA

I've changed the previous definition, which was as follows:

A cryptosystem is indistinguishable under chosen plaintext attack if no adversary can win the above game with probability greater than (1 / 2) + ε, where ε is a negligible function in the security parameter k...

This definition is incorrect, because clearly ε = 0 is a negligible function, but there exists adversaries which which have a winning probability greater than 1/2. Moreover the term negligible function redirected to Colombeau algebra, where negligible functions have a different definition. To avoid confusion the link was removed. 62.167.39.178 17:49, 28 May 2006 (UTC)