80 search results - page 11 / 16 » General Secure Multi-party Computation from any Linear Secre... |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
MOBIHOC
2009
ACM
16 years 4 days ago
2009
ACM
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
174
click to vote
GIS
2009
ACM
16 years 20 days ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
113
click to vote
JOC
2007
14 years 11 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
CCS
2008
ACM
15 years 1 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...