On the security of p-party protocols
Characterizations of secure multi-party symmetric and nonsymmetric cascade protocols are given. A simple correspondence problem over an alphabet is shown linearly reducible to the security problem of symmetric name-stamp protocols. Also, the security problem of nonsymmetric protocols is shown linearly reducible to that of symmetric protocols.
scientific article; zbMATH DE number 4051500