I'm solving a theoretical problem with two entities, each having one secret number. They need to find out whether these number equal without disclosing their number when they differ.
Easy solution is to encrypt both numbers and compare these encrypted messages. In this case, it is still, in theory, possible to compute/to guess the other secret number (even if is very improbable).
Is there any protocol that is 'totally safe' - meaning that an entity cannot guess the other secret number regardless of its computation power?