Sciweavers

24 search results - page 3 / 5
» Quorum-Based Secure Multi-party Computation
Sort
View
SAC
2009
ACM
14 years 16 days ago
On the practical importance of communication complexity for secure multi-party computation protocols
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
Florian Kerschbaum, Daniel Dahlmeier, Axel Schr&ou...
NCA
2007
IEEE
14 years 1 days ago
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
Alysson Neves Bessani, Miguel Correia, Joni da Sil...
WPES
2003
ACM
13 years 11 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
CSE
2009
IEEE
13 years 9 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum