Sciweavers

102 search results - page 12 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
14 years 10 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro
ACSAC
2001
IEEE
15 years 1 months ago
Privacy-Preserving Cooperative Statistical Analysis
The growth of the Internet opens up tremendous opportunities for cooperative computation, where the answer depends on the private inputs of separate entities. Sometimes these comp...
Wenliang Du, Mikhail J. Atallah
EUROCRYPT
2009
Springer
15 years 10 months ago
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the rst pub...
Mihir Bellare, Dennis Hofheinz, Scott Yilek
EUROCRYPT
2010
Springer
15 years 2 months ago
Adaptively Secure Broadcast
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
Martin Hirt, Vassilis Zikas
83
Voted
ICDCN
2010
Springer
15 years 1 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan