Encrypted retrieval ensures the secure retrieval over the encrypted data without sacrificing the confidentiality. Its applications in the database systems have brought this primitive under the spotlight. Once the malicious sender sends the wrong message, conventional encrypted retrieval is arduous to provide message-moderation and even abuse reporting arises when any receiver is allowed to fabricate and convince a malicious message. We introduce the idea of searchable message-moderation, a newly exquisite framework named CleanSE that enables the system to simultaneously provide encrypted retrieval and fallacious reporting resistance. In a nutshell, CleanSE is achieved via a securely technical combination of asymmetric message franking and searchable encryption. We design two CleanSE schemes. The first, called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Recon</i> , leverages designated verifier signatures to generate a report proof such as to prevent fallacious report and undeniability, and assists with designated-server searchable encryption to protect confidentiality and privacy. Our improved scheme is called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Reclean</i> . Compared with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Recon</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Reclean</i> adds an additional algorithm, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathsf {Clean}$ </tex-math></inline-formula> , to filter forged message and employs asymmetric message franking to provide stronger deniability and accountability. We implement and evaluate prototype of our CleanSE system to highlight its feasibility and practicality.