搜索结果: 1-3 共查到“数学 non-abelian groups”相关记录3条 . 查询时间(0.281 秒)
According to Comfort, Raczkowski and Trigos-Arrieta, a topological abelian group G is said to be determined if for each dense subgroup D of G the restriction mapping $r|_D: \hat G\longrightarrow \hat...
Counting Method for Multi-party Computation over Non-abelian Groups
Multiparty Passive Adversary Non-Abelian Groups Graph Coloring Neighbor-Avoiding Walk Random Walk
2012/12/3
In the Crypto’07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is fG(x1, . . . , xn) := x1 · . . . · xn whe...
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Multiparty Computation Passive Adversary Non-Abelian Groups Graph Coloring Percolation Theory
2012/12/3
Recently, Desmedt et al. studied the problem of achieving secure nparty computation over non-Abelian groups. They considered the passive adversary model and they assumed that the parties were only all...