Sciweavers

521 search results - page 29 / 105
» Scalable Secure Multiparty Computation
Sort
View
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
ASIACRYPT
2007
Springer
14 years 2 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...
ESORICS
2008
Springer
13 years 9 months ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson
ACSAC
2010
IEEE
13 years 6 months ago
Always up-to-date: scalable offline patching of VM images in a compute cloud
Patching is a critical security service that keeps computer systems up to date and defends against security threats. Existing patching systems all require running systems. With th...
Wu Zhou, Peng Ning, Xiaolan Zhang, Glenn Ammons, R...
FOCS
2010
IEEE
13 years 6 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass