Hi! Could somebody give a comment on the following question?
Does it make any sense to require for a deterministic encryption scheme
to provide indistinguishability for two sets, each consisting of unique
plaintexts (the sets themselves can intersect)? By such scheme I
understand a scheme that reveals nothing but a distribution of
plaintexts (unlike one-time-pad that, for example, can reveals
exclusive-or of two plaintexts).
Re: A question on indistinguishabilty definition ... By such scheme I ...plaintexts (unlike one-time-pad that, for example, can reveals... It would be obvious that as many A ciphertexts matched B ciphertexts as there were matching pairs of plaintexts, but proper encryption should make the list of A ciphertexts indistinguishable from the list of B ciphertexts without knowledge of the key. ... (sci.crypt)
Re: A question on indistinguishabilty definition ... By such scheme I ...plaintexts (unlike one-time-pad that, for example, can reveals ... The two-time pad reveals the xor of two plaintexts, ...One-time-pad, obviously, fails here, but are there deteministic schemes ... (sci.crypt)
Re: A question on indistinguishabilty definition ... By such scheme I ...plaintexts (unlike one-time-pad that, for example, can reveals ... The two-time pad reveals the xor of two plaintexts, ...One-time-pad, obviously, fails here, but are there deteministic schemes ... (sci.crypt)
Re: A question on indistinguishabilty definition ... By such scheme I ...plaintexts (unlike one-time-pad that, for example, can reveals... The two-time pad reveals the xor of two plaintexts, ... (sci.crypt)
Re: A question on indistinguishabilty definition ... By such scheme I ...plaintexts (unlike one-time-pad that, for example, can reveals ...One-time-pad, obviously, fails here, but are there deteministic schemes ... It would be obvious that as many A ciphertexts matched B ciphertexts ... (sci.crypt)
