13603 search results - page 380 / 2721 » On the Complexity of Computing Treelength |
176
click to vote
ESORICS
2006
Springer
15 years 11 months ago
2006
Springer
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
225
click to vote
AAAI
2000
15 years 9 months ago
2000
Although one of the fundamental goals of AI is to understand and develop intelligent systems that have all of the capabilities of humans, there is little active research directly ...
203
click to vote
ECCC
2008
15 years 7 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
210
Voted
PKC
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
216
Voted
SDMW
2004
Springer
16 years 28 days ago
2004
Springer
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...