As an application, we obtain improved delegation schemes for Boolean formula with *semi-adaptive* soundness, where correctness of the computation is guaranteed even if the client's input is chosen adaptively depending on its public key. Previous delegation schemes for formula achieve one of adaptive soundness, constant communication complexity, or security under static assumptions; we show how to achieve semi-adaptive soundness and the last two simultaneously.
Category / Keywords: public-key cryptography / Attribute-Based Encryption; Semi-Adaptive Security; Delegation Original Publication (with major differences): SCN 2014 Date: received 16 Jun 2014, last revised 13 Sep 2014 Contact author: s080001 at e ntu edu sg; wee@di ens fr Available format(s): PDF | BibTeX Citation Version: 20140913:085946 (All versions of this report) Short URL: ia.cr/2014/465 Discussion forum: Show discussion | Start new discussion