Sciweavers

321 search results - page 12 / 65
» Secure Multiparty Computation of Approximations
Sort
View
FOCS
2003
IEEE
14 years 3 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
ASIACRYPT
2008
Springer
14 years 12 days 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...
WADS
2001
Springer
105views Algorithms» more  WADS 2001»
14 years 2 months ago
Secure Multi-party Computational Geometry
Mikhail J. Atallah, Wenliang Du
ASIACRYPT
2000
Springer
14 years 2 months ago
Efficient Secure Multi-party Computation
Martin Hirt, Ueli M. Maurer, Bartosz Przydatek