An Efficient Protocol for Oblivious DFA Evaluation and Applications

Mohassel, Payman; Niksefat, Salman; Sadeghian, Saeed; Sadeghiyan, Babak

doi:10.1007/978-3-642-27954-6_25

Cited by 43 publications

(42 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, the protocol in [13] works only for exact matching and does not address more general problems, including singlecharacter wildcards and substring matching, which are the main focus of our work. Other protocols that address secure exact matching (and not wildcard or substring matching) are [12,20,21,22,23,11]; of these, only [22] obtains (full) security in the malicious setting. We note that [23] is more efficient than [13], but only in the random oracle model; here, we are interested in standard security models.…”

Section: Comparison To Previous Workmentioning

confidence: 99%

5PM: Secure Pattern Matching

Baron

Defrawy

Minkovich

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we consider the problem of secure pattern matching that allows singlecharacter wildcards and substring matching in the malicious (stand-alone) setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general and includes non-binary alphabets, non-binary Hamming distance and non-binary substring matching.5PM is the first secure expressive pattern matching protocol designed to optimize round complexity by carefully specifying the entire protocol round by round. In the malicious model, 5PM requires O((m + n)k 2 ) bandwidth and O(m + n) encryptions, where m is the pattern length and n is the text length. Further, 5PM can hide pattern size with no asymptotic additional costs in either computation or bandwidth. Finally, 5PM requires only two rounds of communication in the honest-but-curious model and eight rounds in the malicious model. Our techniques reduce pattern matching and generalized Hamming distance problems to a novel linear algebra formulation that allows for generic solutions based on any additively homomorphic encryption. We believe our efficient algebraic techniques are of independent interest.

show abstract

Section: Comparison To Previous Workmentioning

confidence: 99%

5PM: Secure Pattern Matching

Baron

Defrawy

Minkovich

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We adjust our scheme so that this output depends on x i ⊕ y i . Then, we use a technique inspired by [28,Third Variant] to count the number of bits such that x i ⊕ y i = 1, i.e. to compute the Hamming distance.…”

Section: The Basic Schemementioning

confidence: 99%

“…The following proof is partially inspired from the proofs of [28]. Indeed, our scheme can be viewed as a reduction of the third variant of their Oblivious Automata Evaluation, with only one state per line of the matrix, but where the lines of the matrix are not identical.…”

Section: The Basic Schemementioning

confidence: 99%

SHADE: Secure HAmming DistancE Computation from Oblivious Transfer

Bringer¹,

Chabanne²,

Patey³

2013

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that are either based on garbled circuits or on homomorphic encryption. Our second scheme achieves full security against malicious adversaries and is based on Committed Oblivious Transfer. These protocols have direct applications to secure biometric identification.

show abstract

“…In addition to the general-purpose constructions described above, several works in the past have proposed two-party protocols for various classes of functions that (sometimes implicitly) relied on special-purpose garbled circuits. Some examples are [14,6,2], which construct efficient two-party protocols for evaluating ordered binary decision diagrams (OBDDS); and [15] which gives an efficient protocol for evaluating DFAs. All these protocols can be viewed as a combination of a special-purpose garbling scheme with OT, just as Yao's general-purpose two-party protocol is a combination of a general-purpose garbling scheme with OT.…”

Section: Related Workmentioning

confidence: 99%

Garbled Circuits via Structured Encryption

Kamara

Wei

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The garbled circuit technique transforms a circuit in such a way that it can be evaluated on encrypted inputs. Garbled circuits were originally introduced by Yao (FOCS '86) for the purpose of secure two-party computation but have since found many applications. In this work, we consider the problem of designing special-purpose garbled circuits, which are garbled circuits that handle only a specific class of functionalities. Special-purpose constructions are usually smaller than general-purpose ones and lead to more efficient two-party protocols. We propose a design framework for constructing special-purpose garbled circuits based on structured encryption schemes, which are encryption schemes that encrypt data structures in such a way that they can be queried through the use of a token. Using our framework, we show how to design more efficient garbled circuits for several graph-based functionalities (with applications to online social network analysis), Boolean circuits, deterministic finite automata, and branching programs.

show abstract

An Efficient Protocol for Oblivious DFA Evaluation and Applications

Cited by 43 publications

References 14 publications

5PM: Secure Pattern Matching

5PM: Secure Pattern Matching

SHADE: Secure HAmming DistancE Computation from Oblivious Transfer

Garbled Circuits via Structured Encryption

Contact Info

Product

Resources

About