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:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2022
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/162890 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |