The construction is built upon Waters' bilinear pairing-based functional encryption scheme over regular languages. The main technical novelty is in handling stack contents and $\lambda$-transitions (i.e., transitions that do not advance the input pointer) of the automata. This is reflected both in the construction and the security arguments. The scheme is shown to be selectively secure based on the decision $\ell$-expanded bilinear Diffie-Hellman exponent assumption introduced by Waters.
Category / Keywords: public-key cryptography / functional encryption, recursive languages, pushdown automata Date: received 20 Feb 2013, last revised 12 Mar 2013, withdrawn 20 Mar 2013 Contact author: somindu_r at isical ac in Available format(s): (-- withdrawn --) Version: 20130320:112515 (All versions of this report) Short URL: ia.cr/2013/090 Discussion forum: Show discussion | Start new discussion