Sciweavers

45 search results - page 5 / 9
» (Unconditional) Secure Multiparty Computation with Man-in-th...
Sort
View
80
Voted
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 9 months ago
Oblivious-Transfer Amplification
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
Jürg Wullschleger
AINA
2011
IEEE
14 years 1 months ago
Auctions for Secure Multi-party Policy Negotiation in Ambient Intelligence
—The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security po...
Julian Schütte, Stephan Heuser
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
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...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
Motivated by the security of the nonlinear filter generator, the concept of correlation was previously extended to the conditional correlation, that studied the linear correlation...
Yi Lu 0002, Willi Meier, Serge Vaudenay
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...