Please use this identifier to cite or link to this item:
|Title:||Oblivious NFA evaluation with an untrusted third party||Authors:||Zhou, Haoran||Keywords:||Engineering::Computer science and engineering::Data::Data encryption||Issue Date:||2022||Publisher:||Nanyang Technological University||Source:||Zhou, H. (2022). Oblivious NFA evaluation with an untrusted third party. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/162890||Project:||SCSE21-0810||Abstract:||Oblivious substring matching is a well-studied problem, with plentiful applications in scenarios with privacy-preservation requirements, e.g., genome matching, malicious code detection, etc. A natural generalization of oblivious substring matching is oblivious finite automata evaluation, which matches a wider collection of patterns than substrings. In this paper, we propose an efficient protocol for the oblivious evaluation of Non-deterministic finite Automata (NFA) with the help of an untrusted third party and extend the protocol to Non-deterministic Finite state transducers. We prove the security of the protocol against one corrupted party. We further experiment with such protocol on a pattern-matching task with its complexity.||URI:||https://hdl.handle.net/10356/162890||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Student Reports (FYP/IA/PA/PI)|
Files in This Item:
|FYP Oblivious NFA evaluation with Untrusted 3rd party.pdf|
|362.46 kB||Adobe PDF||View/Open|
Updated on Nov 26, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.