Sciweavers

ASIACRYPT
2008
Springer
13 years 10 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
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...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...
EUROCRYPT
2006
Springer
14 years 2 days ago
Efficient Binary Conversion for Paillier Encrypted Values
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
Berry Schoenmakers, Pim Tuyls