Sciweavers

250 search results - page 10 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
15 years 3 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
15 years 1 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
CNSR
2007
IEEE
336views Communications» more  CNSR 2007»
15 years 3 months ago
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
Md. Ashiqur Rahman, Sajid Hussain
EUROCRYPT
2008
Springer
15 years 1 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
CCS
2008
ACM
15 years 1 months ago
FairplayMP: a system for secure multi-party computation
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
Assaf Ben-David, Noam Nisan, Benny Pinkas