• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.105-113
• /
• 2004

An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory(1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.53-62
• /
• 2001

In this paper, we study the security of key recovery enhanced key exchange protocol. We present a subliminal channel of self-escrowed Diffie-Hellman key exchange protocol proposed by P. Paillier and M. Yung in ICISC\`99, and also we present a method to prevent such a subliminal channel. In addition, we review and analyze the weakness of the modified key recovery enhanced key exchange Protocol proposed by C. Kim and p. Lee in PKC 2001.