Abstract: The existing predicate encryption schemes supporting comparison queries do not consider the rank position of attribute values, and most of the schemes are unable to support attribute hiding. Aiming at these problems, we propose a multi k-bit threshold predicate encryption scheme with attribute-hiding. It developed a new encoding for multiple comparisons between Kth-ranked attribute values and thresholds which could convert to the multi-inner product problem. Based on dual-pairing vector space, the scheme leveraged an inner product encryption technique and constructed a random number equation to realize the multi-inner product problem. The blind method of attributes was constructed to achieve attribute-hiding. Security analysis and theoretical comparisons show that the proposed scheme can resist selective plaintext attacks under the standard model, and has good storage performance compared with existing schemes.