搜索结果: 1-9 共查到“finite automata”相关记录9条 . 查询时间(0.073 秒)
Attribute Based Encryption for Deterministic Finite Automata from DLIN
Attribute-based encryption deterministic finite automata decisional linear assumption
2019/6/5
Waters [Crypto, 2012] provided the first attribute based encryption scheme ABE for Deterministic Finite Automata (DFA) from a parametrized or ``q-type'' assumption over bilinear maps. Obtaining a cons...
Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE
Non-determinisitic Finite Automata Attribute based Encrytion Predicate Encryption
2019/6/4
Constructing Attribute Based Encryption (ABE) [SW05] for uniform models of computation from standard assumptions, is an important problem, about which very little is known. The only known ABE schemes ...
Homomorphic Encryption for Finite Automata
Finite Automata Inhomogeneous NTRU Homomorphic Encryption
2019/3/1
We describe a somewhat homomorphic GSW-like encryption scheme, natively encrypting matrices rather than just single elements. This scheme offers much better performance than existing homomorphic encry...
Multitiered Nonlinear Morphology Using Multitape Finite Automata: A Case Study on Syriac and Arabic
Multitape Finite Automata Syriac and Arabic
2015/8/25
This paper presents a computational model for nonlinear morphology with illustrations from
Syriac and Arabic. The model is a multitiered one in that it allows for multiple lexical representations cor...
Universally composable privacy preserving finite automata execution with low online and offline complexity
secure multiparty computation arithmetic black box
2014/3/6
In this paper, we propose efficient protocols to obliviously execute non-deterministic and deterministic finite automata (NFA and DFA) in the arithmetic black box (ABB) model. In contrast to previous ...
A Simulation of Oblivious Multi-Head One-Way Finite Automata by Real-Time Cellular Automata
Simulation of Oblivious Multi-Head One-Way Finite Automata Real-Time Cellular Automata
2010/12/28
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and ...
On the Secure Obfuscation of Deterministic Finite Automata(Extended Abstract)
Obfuscation deterministic finite automata state machines
2009/6/4
In this paper, we show how to construct secure obfuscation for Deterministic Finite Au-
tomata, assuming non-uniformly strong one-way functions exist. We revisit the software protec-
tion approaches...
On the Structure of Binary Feedforward Inverse Finite Automata with Delay 3
有限自动机 半输入存储 前馈逆 可逆性 finite automata semi-input memory feedforward inverses invertibility
2008/3/12
The structure of feedforward inverses is a fundamental problem in the invertibility theory of finite automata. The characterization of the structure of feedforward inverses with delay steps (3 is a lo...
The class of languages recognizable by 1-way quantum finite automata is not closed under union
class of languages recognizable 1-way quantum finite automata
2010/10/13
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known,that deterministic and probabilistic finite automata do not have e.g....