Sciweavers

125 search results - page 8 / 25
» Realizing Secure Multiparty Computation on Incomplete Networ...
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 8 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
PODC
2010
ACM
13 years 11 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
INFOCOM
2011
IEEE
12 years 11 months ago
Secure friend discovery in mobile social networks
– Mobile social networks extend social networks in the cyberspace into the real world by allowing mobile users to discover and interact with existing and potential friends who ha...
Wei Dong, Vacha Dave, Lili Qiu, Yin Zhang
IEEEARES
2006
IEEE
14 years 1 months ago
Bayesian Networks Implementation of the Dempster Shafer Theory to Model Reliability Uncertainty
In many reliability studies based on data, reliability engineers face incompleteness and incoherency problems in the data. Probabilistic tools badly handle these kinds of problems...
Christophe Simon, Philippe Weber
WIAS
2010
102views more  WIAS 2010»
13 years 6 months ago
Information security underlying transparent computing: Impacts, visions and challenges
The rapid development of computer network technologies and social informationalization has brought many new opportunities and challenges in information security. With improved info...
Yaoxue Zhang, Laurence Tianruo Yang, Yuezhi Zhou, ...