Sciweavers

310 search results - page 54 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
ICNP
2009
IEEE
14 years 7 months ago
DirCast: A Practical and Efficient Wi-Fi Multicast System
Abstract--IP multicast applications such as live lecture broadcasts are being increasingly used in enterprise and campus networks. In many cases, end hosts access these multicast s...
Ranveer Chandra, Sandeep Karanth, Thomas Moscibrod...
CCS
2008
ACM
14 years 11 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
15 years 10 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
45
Voted
SAC
2006
ACM
15 years 3 months ago
A chat interface for human-agent interaction in MAST
In this paper we introduce a group-messaging interface that allows humans to efficiently interact with a group of agents through a hierarchical and customizable text protocol. Our...
Marco M. Carvalho, Matteo Rebeschini, James Horsle...