Oblivious NFA evaluation with an untrusted third party
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 matc...
Saved in:
Main Author: | Zhou, Haoran |
---|---|
Other Authors: | Tay Kian Boon |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162890 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Secure data access on untrusted storage
by: Mediana
Published: (2015) -
Fault tolerant secure K-means clustering data mining on semi-honest parties
by: Qian, Xiaofeng
Published: (2010) -
Privacy-preserving knowledge graph merging
by: Rajendran, Reenashini
Published: (2022) -
Privacy preserving data analytics in financial inclusion and crowd computing
by: Lim, Cheng Lock
Published: (2022) -
Privacy-preserving SQL queries for encrypted databases
by: Tan, Chun Wen
Published: (2020)