Deepthi Rao Kulkarni

Music and cryptography have been linked to one another since ancient times. The idea of replacing plaintext letters with music notes and sending the music file to receiver, is not new. But such replacements sometimes result in music clips which are not pleasant to listeners and thereby leading to the music clip gaining unnecessary extra attention. Most of the works done in this area, fail to ensure the generation of a music clip that invariably conforms to any particular form of music. Melody… Show more

Music and cryptography have been linked to one another since ancient times. The idea of replacing plaintext letters with music notes and sending the music file to receiver, is not new. But such replacements sometimes result in music clips which are not pleasant to listeners and thereby leading to the music clip gaining unnecessary extra attention. Most of the works done in this area, fail to ensure the generation of a music clip that invariably conforms to any particular form of music. Melody of the music clip is neglected. In order to address this issue, current paper proposes a novel approach for sharing a secret message based on concepts of Carnatic Classical Music. The method proposed here aims at converting a message in textual format to a music clip before sending it to the receiver. Receiver can then decrypt that message using the knowledge of range of frequency values associated with each musical note also called as 'swara' in Carnatic Classical Music. Each plaintext character from English alphabet is replaced by different combinations of swaras. The set of swaras mapped to each plaintext character is so chosen that the final music file produced as the output of encryption always conforms to a melodic form ('Raga') governed by the framework of Carnatic Classical Music. Ten subject matter experts in the field of Carnatic music have given their opinion about the conformance of these music clips to specified ragas. Also, Mean Opinion Score (MOS) of 25 listeners has been tabulated to test and verify the melodic aspect of these music clips. Show less

Searchable Encryption (SE) schemes provide secu- rity and privacy to the cloud data. The existing SE approaches enable multiple users to perform search operation by using various schemes like Broadcast Encryption (BE), Attribute-Based Encryption (ABE), etc. However, these schemes do not allow multiple users to perform the search operation over the encrypted data of multiple owners. Some SE schemes involve a Proxy Server (PS) that allow multiple users to perform the search operation. However… Show more

Searchable Encryption (SE) schemes provide secu- rity and privacy to the cloud data. The existing SE approaches enable multiple users to perform search operation by using various schemes like Broadcast Encryption (BE), Attribute-Based Encryption (ABE), etc. However, these schemes do not allow multiple users to perform the search operation over the encrypted data of multiple owners. Some SE schemes involve a Proxy Server (PS) that allow multiple users to perform the search operation. However, these approaches incur huge computational burden on PS due to the repeated encryption of the user queries for transformation purpose so as to ensure that users’ query is searchable over the encrypted data of multiple owners. Hence, to eliminate this computational burden on PS, this paper proposes a secure proxy server approach that performs the search operation without transforming the user queries. This approach also returns the top-k relevant documents to the user queries by using Euclidean distance similarity approach. Based on the experimental study, this approach is efficient with respect to search time and accuracy. Show less