Cryptology ePrint Archive: Report 2014/407

Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy

Fu-Kuo Tseng and Rong-Jaye Chen and Bao-Shuh Paul Lin

Abstract: 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 plaintext privacy and predicate privacy through security analysis and security games. However, to achieve predicate privacy, we put bounds on the length of a string 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.

Category / Keywords: public-key cryptography / symmetric functional encryption, deterministic finite automaton, regular language, predicate-only scheme, predicate privacy

Date: received 1 Jun 2014, last revised 3 Jun 2014

Contact author: fktseng at cs nctu edu tw

Available format(s): PDF | BibTeX Citation

Version: 20140603:111118 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]