Cryptographic protocols can enforce privacy in distributed computation of functions [Goldwasser'96] and are a competitor of the distributed constructive search techniques. [Goldreich'87,Chaum'87,Chaum'88,Ben-or'88] show how cryptographic protocols can be compiled from protocols/functions for honest agents. For some combinations of concepts of security and types of attacks, cryptographic protocols obtained this way can be safe. We discuss their application to constraint satisfaction (and optimization) problems. A first version of this report, with some notation problems, appears in the PhD thesis report [Silaghi'02].