Algorithms to hash a list of values ​​and then check if the value is in that list

I am working on a set of services and a client JAR file that is intended to be the only means of invoking these services. The JAR client will be used by multiple applications (all internal). However, we would like some services to be allowed for some client applications and not others.

I'm playing around with different approaches to achieve this, but one approach is to give each application a "context" value to pass at runtime. This value will represent the list of services allowed for this client application, and the service can quickly figure out if it is on that list.

Each service will have its own id value, probably hard-coded in the Java class as a variable static final

. For each client application, I would compile a list of allowed services, perhaps using a Groovy script or a very simple web application. A bit of Reflection based code will collect all of these ID values ​​and generate a hash representing all of them.

I would pass the hash of this context to the owners of the client applications, along with the client JAR, and they will return it during the service call. The service will use the same (or related) hash algorithm to quickly check if its ID is contained in the hash. If so, the service continues. If not, that rules out. This approach obviously won't protect against intentional abuse, but these are all internal services and we only need to block the negligent abuse.

I'm not sure which hashing algorithm to use (or if "hashing" is even the right word for it). I could just collect all the allowed IDs as String

and later check if the given ID contains in that line. However, the meaning of "context" would then be huge and cumbersome. I'm sure there are standard mathematical approaches for hashing a list of values ​​and then checking if the given original value is in that list. There are probably some of them already neatly packaged and exposed in the Java world. Any suggestions are greatly appreciated!