Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
type: Item
instance of: scholarly article
title: Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
DOI: 10.1007/978-3-031-09234-3_30
author: Kittiphop Phalakarn
author: Nuttapong Attrapadung
author: Kanta Matsuura
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614782
zbMATH Keywords: finite automata
zbMATH Keywords: conditional disclosure of secrets
zbMATH Keywords: multi-client verifiable computation
zbMATH Keywords: secure multi-party computation
MaRDI profile type: Publication
full work available at URL: 978-3-031-09234-3 30
OpenAlex ID: W4285129633
cites work: Attribute-based encryption (and more) for nondeterministic finite automata from LWE
cites work: Attribute based encryption for deterministic finite automata from DLIN
cites work: Q2778845
cites work: Secret-sharing schemes for general and uniform access structures
cites work: Better secret sharing via robust conditional disclosure of secrets
cites work: Optimal linear multiparty conditional disclosure of secrets protocols
cites work: Multi-clients verifiable computation via conditional disclosure of secrets
cites work: Multi-Client Non-interactive Verifiable Computation
cites work: The Simplest Protocol for Oblivious Transfer
cites work: Q3374918
cites work: Q4737257
cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
cites work: ``The simplest protocol for oblivious transfer'' revisited
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Text Search Protocols with Simulation Based Security
cites work: Q4542532
cites work: Q3729902
cites work: ABE for DFA from \(k\)-lin
cites work: Adaptively secure ABE for DFA from \(k\)-Lin and more
cites work: Multi-Client Verifiable Computation with Stronger Security Guarantees
cites work: Q5750403
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Breaking the circuit-size barrier in secret sharing
cites work: Conditional disclosure of secrets via non-linear reconstruction
cites work: Towards breaking the exponential barrier for general secret sharing
cites work: An Efficient Protocol for Oblivious DFA Evaluation and Applications
cites work: Computationally secure oblivious transfer
cites work: Fast string correction with Levenshtein automata
cites work: Oblivious DFA evaluation on joint input and its applications
description: scientific article; zbMATH DE number 7614782