TY - GEN
T1 - A new aspect for security notions
T2 - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001
AU - Koshiba, Takeshi
PY - 2001
Y1 - 2001
N2 - In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.
AB - In this paper, we introduce a framework in which we can uniformly and comprehensively discuss security notions of public-key encryption schemes even for the case where some weak generator producing seemingly random sequences is used to encrypt plaintext messages. First, we prove that indistinguishability and semantic security are not equivalent in general. On the other hand, we derive some sufficient condition for the equivalence and show that polynomial-time pseudo-randomness is not always necessary for the equivalence.
UR - http://www.scopus.com/inward/record.url?scp=84937425036&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937425036&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84937425036
VL - 1992
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 87
EP - 103
BT - Public Key Cryptography - 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Proceedings
PB - Springer Verlag
Y2 - 13 February 2001 through 15 February 2001
ER -