For a given function of user data, a querier must recover with at least a prescribed probability, the value of the function based on a user-provided query response. Subject to this requirement, the user forms the query response so as to minimize the likelihood of the querier guessing a list of prescribed size to which the data value belongs based on the query response. We obtain a general converse upper bound for the maximum list privacy which is shown to be tight for the special case of a binary-valued function through an explicit achievability scheme for the query response.

翻译：对于用户数据的给定函数，查询者必须基于用户提供的查询响应，以至少规定概率恢复该函数的值。在此要求下，用户构造查询响应，以最小化查询者根据该响应猜出数据值所属的给定大小列表的可能性。我们得出了列表隐私最大值的通用逆向上界，并通过一种显式的查询响应可达方案，证明了该上界在二元值函数的特殊情形下是紧致的。