Web: http://arxiv.org/abs/2103.11240

Jan. 7, 2022, 2:20 a.m. | Rafael Dowsley, Caleb Horst, Anderson C. A. Nascimento

cs.CR updates on arXiv.org arxiv.org

We propose protocols for obliviously evaluating finite-state machines, i.e.,
the evaluation is shared between the provider of the finite-state machine and
the provider of the input string in such a manner that neither party learns the
other's input, and the states being visited are hidden from both. For alphabet
size $|\Sigma|$, number of states $|Q|$, and input length $n$, previous
solutions have either required a number of rounds linear in $n$ or
communication $\Omega(n|\Sigma||Q|\log|Q|)$. Our solutions require 2 rounds
with …

communication finite state machines oblivious state

More from arxiv.org / cs.CR updates on arXiv.org

Head of Information Security

@ Canny | Remote

Information Technology Specialist (INFOSEC)

@ U.S. Securities & Exchange Commission | Washington, D.C.

Information Security Manager - $90K-$180K - MANAG002176

@ Sound Transit | Seattle, WA

Sr. Software Security Architect

@ SAS | Remote

Senior Incident Responder

@ CipherTechs, Inc. | Remote

Data Security DevOps Engineer Senior/Intermediate

@ University of Michigan - ITS | Ann Arbor, MI