Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Counting Method for Multi-party Computation over Non-abelian Groups

Youming Qiao, Christophe Tartary

Published Jan 1, 2008• 0 citations
Publisher
DOI
10.1007/978-3-540-89641-8_12

Related papers

Graph Design for Secure Multiparty Computation over Non-Abelian Groups

Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary

Lecture notes in computer science•Jan 1, 2008•5 citations

Graph Coloring Applied to Secure Computation in Non-Abelian Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld +4 more

Journal of Cryptology•Sep 6, 2011•11 citations

Multi-party Computation Over Finite Cyclic Groups with Friends and Foes

Hikaru Tsuchida, Takashi Nishide

Lecture notes in computer science•Oct 19, 2026•0 citations

On Secure Multi-party Computation in Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld +1 more

Springer eBooks•Aug 9, 2007•14 citations

Bell inequalities from group actions: Three parties and non-Abelian groups

V. Uğur Güney, Mark S. Hillery

In a previous publication, we showed how group actions can be used to generate Bell inequalities. The group action yields a set of measurement probabilities whose sum is the basic element in the inequality. The sum has an upper bound if the probabilities are a result of a local, realistic theory, but this bound can be violated if the probabilities come from quantum mechanics. In our previous paper, we considered the case of only two parties making the measurements and single-generator groups. Here we show that the method can be extended to three parties, and it can also be extended to non-Abelian groups. We discuss the resulting inequalities in terms of nonlocal games.

arXiv:1505.06346•Physical Review A•May 19, 2015•9 citations

Efficient Multi-party Computation over Rings

Ronald Cramer, Serge Fehr, Yuval Ishai +1 more

Lecture notes in computer science•Jan 1, 2003•63 citations
In a previous publication, we showed how group actions can be used to generate Bell inequalities. The group action yields a set of measurement probabilities whose sum is the basic element in the inequality. The sum has an upper bound if the probabilities are a result of a local, realistic theory, but this bound can be violated if the probabilities come from quantum mechanics. In our previous paper, we considered the case of only two parties making the measurements and single-generator groups. Here we show that the method can be extended to three parties, and it can also be extended to non-Abelian groups. We discuss the resulting inequalities in terms of nonlocal games.