期刊名称:International Journal of Security and Its Applications
印刷版ISSN:1738-9976
出版年度:2015
卷号:9
期号:11
页码:293-302
DOI:10.14257/ijsia.2015.9.11.27
出版社:SERSC
摘要:This paper considers a scenario in which a sender who holds a k -bit to k -bit trapdoor permutation f wants to transmit a message x to a receiver who holds the inverse permutation 1 . f ; with the condition that encryption should require just one computation of f , decryption should require just one computation of 1 . f , the length of the enciphered text should be precisely k and the length n of the text x that can be encrypted is close to k . Our scheme takes the encryption of x to be ) ( x r f , which is a simple probabilistic encoding of x . Assuming an ideal hash function and an arbitrary trapdoor permutation, we describe and prove secure a simple invertible enmesh scheme that is bit-optimal in that the length of the string x that can be encrypted by ) ( x r f is almost k . Our scheme achieves semantic security, which implies chosen-cipher text security and non-malleability.