Oblivious DFA evaluation on joint input and its applications
From MaRDI portal
Publication:2023228
DOI10.1016/j.ins.2020.03.065zbMath1459.68074OpenAlexW3015859839MaRDI QIDQ2023228
Zhenxiang Chen, Chuan Zhao, Bo Zhang, Shan Jing, Ming-Hao Zhao, Sheng-nan Zhao
Publication date: 3 May 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.03.065
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computer security (68M25)
Related Items (2)
Secure two-party input-size reduction: challenges, solutions and applications ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- A proof of security of Yao's protocol for two-party computation
- Analysis and design of stream ciphers
- Efficient and secure outsourced approximate pattern matching protocol
- An Efficient Protocol for Oblivious DFA Evaluation and Applications
- Text Search Protocols with Simulation Based Security
- Foundations of Cryptography
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - CRYPTO 2003
This page was built for publication: Oblivious DFA evaluation on joint input and its applications