120 search results - page 3 / 24 » Functional Encryption for Regular Languages |
MST
2007
13 years 4 months ago
2007
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
MLG
2007
Springer
13 years 11 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
IEICET
2006
13 years 5 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
MA
1999
Springer
13 years 9 months ago
1999
Springer
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...