University of Wollongong
Browse

Edit distance based encryption and its application

Download (564.9 kB)
journal contribution
posted on 2024-11-15, 07:46 authored by Phuong Viet Xuan Tran, Guomin Yang, Willy SusiloWilly Susilo, Kaitai Liang
Edit distance, also known as Levenshtein distance, is a very useful tool to measure the similarity between two strings. It has been widely used in many applications such as natural language processing and bioinformatics. In this paper, we introduce a new type of fuzzy public key encryption called Edit Distance-based Encryption (EDE). In EDE, the encryptor can specify an alphabet string and a threshold when encrypting a message, and a decryptor can obtain a decryption key generated from another alphabet string, and the decryption will be successful if and only if the edit distance between the two strings is within the pre-defined threshold. We provide a formal definition and security model for EDE, and propose an EDE scheme that can securely evaluate the edit distance between two strings embedded in the ciphertext and the secret key. We also show an interesting application of our EDE scheme named Fuzzy Broadcast Encryption which is very useful in a broadcasting network.

History

Citation

Phuong, T. Viet Xuan., Yang, G., Susilo, W. & Liang, K. (2016). Edit distance based encryption and its application. Lecture Notes in Computer Science, 9723 103-119. Melbourne, Australia Proceedings of The 21st Australasian Conference on Information Security and Privacy (ACISP)

Journal title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

9723

Pagination

103-119

Language

English

RIS ID

106715

Usage metrics

    Categories

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC