TY - JOUR
T1 - Towards symmetric functional encryption for regular languages with predicate privacy
AU - Tseng, Fu Kuo
AU - Chen, Rong-Jaye
AU - Lin , Bao-Shuh
PY - 2014/1/1
Y1 - 2014/1/1
N2 - We present a symmetric-key predicate-only functional encryption system, SP-FE, which supports functionality for regular languages described by deterministic finite automata. In SP-FE, a data owner can encrypt a string of symbols as encrypted symbols for matching. Later, the data owner can generate predicate tokens of the transitions in a deterministic finite automaton (DFA). The server with these tokens can decrypt a sequence of encrypted symbols correctly and transfer from one state to another accordingly. If the final state belongs to the set of accept states, the server takes assigned operations or returns the corresponding encrypted data. We have proven SP-FE preserves both keyword privacy and predicate privacy through security analysis and security games. However, to achieve predicate privacy, we put bounds on the length of a keyword and the number of states of a DFA. Due to these restrictions, SP-FE can only capture finite languages. Finally, we present the performance analysis of SP-FE and mention possible future work.
AB - We present a symmetric-key predicate-only functional encryption system, SP-FE, which supports functionality for regular languages described by deterministic finite automata. In SP-FE, a data owner can encrypt a string of symbols as encrypted symbols for matching. Later, the data owner can generate predicate tokens of the transitions in a deterministic finite automaton (DFA). The server with these tokens can decrypt a sequence of encrypted symbols correctly and transfer from one state to another accordingly. If the final state belongs to the set of accept states, the server takes assigned operations or returns the corresponding encrypted data. We have proven SP-FE preserves both keyword privacy and predicate privacy through security analysis and security games. However, to achieve predicate privacy, we put bounds on the length of a keyword and the number of states of a DFA. Due to these restrictions, SP-FE can only capture finite languages. Finally, we present the performance analysis of SP-FE and mention possible future work.
KW - deterministic finite automaton
KW - predicate privacy
KW - predicate-only scheme
KW - regular language
KW - symmetric functional encryption
UR - http://www.scopus.com/inward/record.url?scp=84907325177&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-09843-2_20
DO - 10.1007/978-3-319-09843-2_20
M3 - Conference article
AN - SCOPUS:84907325177
SN - 0302-9743
VL - 8639 LNCS
SP - 266
EP - 275
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
T2 - 9th International Workshop on Security, IWSEC 2014
Y2 - 27 August 2014 through 29 August 2014
ER -