Sciweavers

111 search results - page 12 / 23
» Characterization of Secure Multiparty Computation Without Br...
Sort
View
CORR
2008
Springer
73views Education» more  CORR 2008»
14 years 9 months ago
Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper
We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. Characterizing the secrecy ca...
Ersen Ekrem, Sennur Ulukus
ASIACRYPT
2007
Springer
15 years 1 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
WPES
2004
ACM
15 years 3 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
CCS
2008
ACM
14 years 11 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig