Score:0

Tuples 2P secure multi-party computation against malicious adversaries algorithms

in flag
sw.

There are secure multi-party computation algorithms and implementations [1] for signing 2-party messages where the parties don't need to reveal their secrets.

Can this algorithms be used for signing tuples in the following sense? If we have 2-tuple (message1, message2) the computation results in the 2-tuple (sign(message1), sign(message2)) where the signing process is realized at the same time for message1 and message2 and we don't need to first sign message1 and then message2? As a result the two parties have two signatures at the same time.

Is this possible? Trivial? Difficult?

[1] https://github.com/rdragos/awesome-mpc

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.