1923 search results - page 25 / 385 » Modeling Complexity in Secure Distributed Computing |
CN
2007
13 years 8 months ago
2007
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in t...
MDM
2007
Springer
14 years 2 months ago
2007
Springer
Smart environments and wearables will make the storage and subsequent sharing of digitized multimedia diaries and meeting protocols – whom we meet, or what we say or do – chea...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...