Sciweavers

422 search results - page 29 / 85
» Protocol Specialization
Sort
View
INFOCOM
1997
IEEE
15 years 6 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
GRC
2008
IEEE
15 years 3 months ago
Scalar-product based Secure Two-party Computation
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-...
104
Voted
TMC
2010
134views more  TMC 2010»
15 years 8 days ago
Enabling Efficient Peer-to-Peer Resource Sharing in Wireless Mesh Networks
—Wireless mesh networks are a promising area for the deployment of new wireless communication and networking technologies. In this paper, we address the problem of enabling effec...
Claudia Canali, Maria Elena Renda, Paolo Santi, Si...
PODC
2009
ACM
16 years 2 months ago
Vertical paxos and primary-backup replication
We introduce a class of Paxos algorithms called Vertical Paxos, in which reconfiguration can occur in the middle of reaching agreement on an individual state-machine command. Vert...
Leslie Lamport, Dahlia Malkhi, Lidong Zhou
EUROCRYPT
2003
Springer
15 years 7 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell