The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We suggest two new methodologies for the design of efficient secure protocols, that differ with respect to their underlying computational models. In one methodology we utilize the communication complexity tree (or branching for f and transform it into a secure protocol. In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter". The second methodology usesarXiv:cs/0109011v1 fatcat:fs2of35xenbyxhlpjabcmfwroe