Sciweavers

250 search results - page 29 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
PODC
2004
ACM
14 years 1 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
SCN
2004
Springer
112views Communications» more  SCN 2004»
14 years 1 months ago
Controlling Spam by Secure Internet Content Selection
Unsolicited and undesirable e-mail (spam) is a growing problem for Internet users and service providers. We present the Secure Internet Content Selection (SICS) protocol, an effic...
Amir Herzberg
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 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
FGCN
2008
IEEE
197views Communications» more  FGCN 2008»
14 years 2 months ago
Design and Implementation of Hybrid Broadcast Authentication Protocols in Wireless Sensor Networks
The proposed broadcast authentication protocols for wireless sensor networks can be divided into two categories: protocols based on digital signature and protocols based on improv...
Xin Zhao, Xiaodong Wang
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 9 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao