Cryptology ePrint Archive: Report 2018/273

Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More

Prabhanjan Ananth and Xiong Fan and Elaine Shi

Abstract: Attribute based encryption (ABE) is an advanced encryption system with a built-in mechanism to generate keys associated with functions which in turn provide restricted access to encrypted data. Most of the known candidates of attribute based encryption model the functions as circuits. This results in significant efficiency bottlenecks, especially in the setting where the function associated with the ABE key is represented by a random access machine (RAM) and a database, with the runtime of the RAM program being sublinear in the database size. In this work we study the notion of attribute based encryption for random access machines (RAMs), introduced in the work of Goldwasser, Kalai, Popa, Vaikuntanathan and Zeldovich (Crypto 2013). We present a construction of attribute based encryption for RAMs satisfying sublinear decryption complexity assuming learning with errors; this is the first construction based on standard assumptions. Previously, Goldwasser et al. achieved this result based on non-falsifiable knowledge assumptions. We also consider a dual notion of ABE for RAMs, where the database is in the ciphertext and we show how to achieve this dual notion, albeit with large attribute keys, also based on learning with errors.

Category / Keywords: public-key cryptography / attribute-based encryption, RAMs, LWE

Original Publication (in the same form): IACR-ASIACRYPT-2019

Date: received 15 Mar 2018, last revised 3 Aug 2020

Contact author: xfan at cs cornell edu

Available format(s): PDF | BibTeX Citation

Version: 20200804:034742 (All versions of this report)

Short URL: ia.cr/2018/273


[ Cryptology ePrint archive ]