Witness encryption lets a sender encrypt a message to an NP statement so that anyone holding a valid witness can decrypt, while those without a witness learn nothing. A new paper on arXiv reports an unconditional construction in the classical generic cyclic group model, a standard abstraction used to study group-based cryptography.
According to the abstract, the construction works for every constant c > 0. For SAT instances of size n, encryption runs in time poly(n). The abstract is truncated before listing the remaining properties, so details such as ciphertext size and decryption cost are not available from the announcement.
Because the result is unconditional, it does not rely on unproven hardness assumptions within the generic group model. The paper is the only source for this summary, so there are no conflicting reports to compare.