Earticle

초록

영어

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 f-1; with the condition that encryption should require just one computation of f , decryption should require just one computation of 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 f (rx) , 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 f (rx) is almost k . Our scheme achieves semantic security, which implies chosen-cipher text security and non-malleability. Keywords: Asymmetric encryption

목차

Abstract
 1. Introduction
  1.1. The Basic Scheme
  1.2. Computational Efficiency of the Proposed Model
  1.3. The Ideal Hash Function Paradigm
  1.4. Assessment of the ‘Exact Security’ of our Scheme
 2. Notations and Conventions
  2.1 Probabilistic algorithms
  2.2 Random Oracles
  2.3 Trapdoor Permutations and their Security
 3. Semantically Secure Encryption
  3.1 Encryption Schemes
  3.2 Semantic Security
 4. The Basic Encryption Scheme
  4.1 A Prototype Model of our Scheme
 5. Conclusion
 References

키워드

저자

• Odule, Tola John [ Department of Mathematical Sciences Olabisi Onabanjo University P.M.B. 2002, Ago-Iwoye, Ogun State. Nigeria. ] Correspondence author
• Awodele O. [ Department of Mathematics and Computer Science, Babcock University Ilishan-Remo, Ogun State. Nigeria. ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605