Recently, coverless information hiding methods have focused primarily on improving hiding capacity and robustness, whereas the sender and recipient have access to the same dataset. However, these methods require a lots of space to carry the datasets and a high bandwidth to share it, which is certainly an inevitable drawback. Meanwhile, the secret data and the cover image are independent of each other, allowing an arbitrary selection of images from dataset. This means that the secret data do not pertain to a specific image. However in some cases like military, medical imaging, etc., the secret data to be shared and the corresponding image are dependent and do not allow an arbitrary selection of images from dataset. In such situations, the efficiency of existing coverless information hiding methods may be compromised. To overcome these limitations, we propose an entropy based new coverless method with an increased hiding capacity that uses only a single image for secret communication. The method is more efficient and requires less storage space than the existing methods. Unlike the existing approaches, it divides an image into blocks, calculates the entropy of each sub-block, generates binary hash sequences based on the entropy values, performs a bitwise XOR operation between the ASCII code of the hash sequence and secret data, and stores into the mapping file. Furthermore, a permutation technique with seed value is used to encrypt the mapping file to be shared with the receiver. Ultimately, by utilizing the mapping file, the hiding capacity is enhanced and space to carry the dataset and high computation is significantly reduced. Apart from high embedding capacity and low computation, experimental results confirm that the proposed approach exhibits better resiliency and security against image processing attacks as compared to the state-of-the-art approaches in coverless information hiding.