Witness encryption was originally proposed by Garg, Gentry, Sahai and Waters. It provides a means to encrypt to an instance, $x$, of an NP language and to decrypt by a witness $w$ that $x$ is in the language. Encoding CNF-SAT in the existing witness encryption schemes generate poly(n*k) group elements in the ciphertext where n is the number of variables and k is the number of clauses of the CNF formula. We design a new witness encryption for CNF-SAT which achieves ciphertext size of 2n+2k group elements. Our witness encryption is based on an intuitive reduction from SAT to Subset-Sum problem. Our scheme uses the framework of multilinear maps, but it is independent of the implementation details of multilinear maps.
Category / Keywords: time-release crypto, bitcoin mining, proof-of-work, witness encryption, SAT, Subset-Sum, multilinear maps Date: received 20 May 2015 Contact author: lovelykitoun at gmail com Available format(s): PDF | BibTeX Citation Version: 20150521:074549 (All versions of this report) Short URL: ia.cr/2015/482 Discussion forum: Show discussion | Start new discussion