Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

DOI10.1007/978-3-031-09234-3_30MaRDI QIDQ2096633zbMATH OpenOpenAlexFDO

Authors Kittiphop Phalakarn, Nuttapong Attrapadung, Kanta Matsuura

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09234-3_30

zbMATH Keywords

conditional disclosure of secretsfinite automatamulti-client verifiable computationsecure multi-party computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Cryptography (94A60)

Recommendations

• An efficient protocol for oblivious DFA evaluation and applications
• Oblivious DFA evaluation on joint input and its applications
• Automata evaluation and text search protocols with simulation-based security
• Obfuscating finite automata
• Text search protocols with simulation based security

Cites work

• ``The simplest protocol for oblivious transfer revisited
• A proof of security of Yao's protocol for two-party computation
• ABE for DFA from k-lin
• Adaptively secure ABE for DFA from \(k\)-Lin and more
• Advances in Cryptology - CRYPTO 2003
• An efficient protocol for oblivious DFA evaluation and applications
• Attribute based encryption for deterministic finite automata from DLIN
• Attribute-based encryption (and more) for nondeterministic finite automata from LWE
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Communication complexity of conditional disclosure of secrets and attribute-based encryption
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
• Computationally secure oblivious transfer
• Conditional disclosure of secrets via non-linear reconstruction
• Fast string correction with Levenshtein automata
• General secure multi-party computation from any linear secret-sharing scheme
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1775399 (Why is no real title available?)
• scientific article; zbMATH DE number 2086718 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Multi-client non-interactive verifiable computation
• Multi-client verifiable computation with stronger security guarantees
• Multi-clients verifiable computation via conditional disclosure of secrets
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Oblivious DFA evaluation on joint input and its applications
• Optimal linear multiparty conditional disclosure of secrets protocols
• Secret-sharing schemes for general and uniform access structures
• Text search protocols with simulation based security
• The simplest protocol for oblivious transfer
• Towards breaking the exponential barrier for general secret sharing

Cited in

(3)

• Oblivious DFA evaluation on joint input and its applications
• An efficient protocol for oblivious DFA evaluation and applications
• Verification protocol for stable matching from conditional disclosure of secrets

This page was built for publication: Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096633)