We present a concretely efficient and simple extractable witness encryption scheme for KZG polynomial commitments. It allows to encrypt a message towards a triple \((\textsf{com}, \alpha , \beta )\) , where \(\textsf{com}\) is a KZG commitment for some polynomial f. Anyone with an opening for the commitment attesting \(f(\alpha ) = \beta \) can decrypt, but without knowledge of a valid opening the message is computationally hidden. Our construction is simple and highly efficient. The ciphertext is only a single group element. Encryption and decryption both require a single pairing evaluation and a constant number of group operations. Using our witness encryption scheme, we construct a simple and highly efficient laconic OT protocol, which significantly outperforms the state of the art in most important metrics.