Sciweavers

121
Voted
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
13 years 1 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 10 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li