Score:1

MPC arithmetic circuit file and benchmark

in flag

For doing MPC over Boolean circuits (typically XOR, AND, INV gates over field of size 2), Boolean circuit files can be found online for a range of interesting functions (e.g. AES, SHA-256). These circuit files can then be used in different implementations in order to compare performance.

For arithmetic circuits (ADD, MUL gates over larger rings), is there such a thing as an arithmetic circuit file? Are there by now accepted functions/circuits which one can use as a benchmark to compare different MPC protocol implementations over arithmetic circuits?

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.