Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

DOI10.1007/978-3-031-09234-3_30OpenAlexW4285129633MaRDI QIDQ2096633

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

finite automatasecure multi-party computationconditional disclosure of secretsmulti-client verifiable computation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``The simplest protocol for oblivious transfer revisited
• A proof of security of Yao's protocol for two-party computation
• Fast string correction with Levenshtein automata
• Towards breaking the exponential barrier for general secret sharing
• Conditional disclosure of secrets via non-linear reconstruction
• Optimal linear multiparty conditional disclosure of secrets protocols
• Computationally secure oblivious transfer
• Oblivious DFA evaluation on joint input and its applications
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
• Adaptively secure ABE for DFA from \(k\)-Lin and more
• Multi-clients verifiable computation via conditional disclosure of secrets
• Attribute based encryption for deterministic finite automata from DLIN
• Secret-sharing schemes for general and uniform access structures
• ABE for DFA from \(k\)-lin
• Attribute-based encryption (and more) for nondeterministic finite automata from LWE
• An Efficient Protocol for Oblivious DFA Evaluation and Applications
• The Simplest Protocol for Oblivious Transfer
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• Text Search Protocols with Simulation Based Security
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Multi-Client Non-interactive Verifiable Computation
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Multi-Client Verifiable Computation with Stronger Security Guarantees
• Advances in Cryptology - CRYPTO 2003

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