Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...