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

15 years 4 months ago

Download itcs.tsinghua.edu.cn

In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , xn) := x1

Youming Qiao, Christophe Tartary

Real-time Traffic

CANS 2008 | Counting Method | Cryptology | Desmedt Et | Random Coloring |

claim paper

» Computing LSeries of Hyperelliptic Curves

» Size matters word count as a measure of quality on wikipedia

» Word usage and posting behaviors modeling blogs with unobtrusive data collection methods

» A diskbased parallel implementation for direct condensation of large permutation modules

» Pathfinder an online collaboration environment for citizen scientists

» Eigentrend trend analysis in the blogosphere based on singular value decompositions

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	CANS
Authors	Youming Qiao, Christophe Tartary

Comments (0)

Sciweavers

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

CANS 2008 | Counting Method | Cryptology | Desmedt Et | Random Coloring |

Explore & Download

Productivity Tools

Sciweavers