Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
- 666 Downloads
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.
Keywordssymmetric functional encryption deterministic finite automaton regular language predicate-only scheme predicate privacy
Unable to display preview. Download preview PDF.
- 2.Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: Proceedings of the 2007 IEEE Symposium on Security and Privacy, SP 2007, pp. 321–334. IEEE Computer Society, Washington, DC (2007)Google Scholar
- 3.Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 89–98. ACM, New York (2006)Google Scholar
- 13.Tseng, F.K., Chen, R.J., Lin, B.S.P.: Towards symmetric functional encryption for regular languages with predicate privacy. Cryptology ePrint Archive, Report 2014/407 (2014), http://eprint.iacr.org/