5 search results - page 1 / 1 » Graph Design for Secure Multiparty Computation over Non-Abel... |
ASIACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
CANS
2008
Springer
13 years 11 months ago
2008
Springer
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, . . . , x...
CRYPTO
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
CRYPTO
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
EUROCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...