Sciweavers

45 search results - page 4 / 9
» (Unconditional) Secure Multiparty Computation with Man-in-th...
Sort
View
ATAL
2005
Springer
15 years 3 months ago
Decentralized voting with unconditional privacy
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
Felix Brandt, Tuomas Sandholm
SASN
2004
ACM
15 years 2 months ago
Resilient aggregation in sensor networks
This paper studies security for data aggregation in sensor networks. Current aggregation schemes were designed without security in mind and there are easy attacks against them. We...
David Wagner
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
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...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
SAC
2006
ACM
15 years 3 months ago
Bootstrapping multi-party ad-hoc security
Increasingly pervasive computing throws up scenarios where users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where...
Sadie Creese, Michael Goldsmith, Bill Roscoe, Ming...