First page Back Continue Last page Overview Graphics
Multi-Party Distributed Protocols
Less simply, an N-party distributed transformation problem is:
- Given a 2N-ary formula, CF(x1, ..., xN, y1, ... , yN)
- Design a distributed protocol DP such that on each tuple of secret inputs (s1, ..., sN) the application of the protocol outputs a tuple of secret outputs (z1, ... , zN)