Matchmaking encryption (ME) is a generalization of attribute-based encryption in which both the sender and the receiver (each with their own attributes) can specify access policies for the other party. While prior work has clarified privacy and authenticity for ME, achieving adaptive privacy has typically required non-standard assumptions such as indistinguishability obfuscation (iO) or intricate selective-to-adaptive upgrades under strong assumptions, leading to impractical parameters. Moreover, the match condition is known to imply iO. In this work, we focus on the “mismatch” condition and give a simple construction of adaptively secure ME from witness encryption (WE), a weaker assumption than iO. The resulting scheme reduces reliance on strong assumptions while preserving the core functionality of ME, advancing the feasibility of practical ME under weaker assumptions than previously known schemes.