588 search results - page 35 / 118 » Reducibility and Completeness in Private Computations |
NDSS
2007
IEEE
14 years 5 months ago
2007
IEEE
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
ACMICEC
2007
ACM
14 years 3 months ago
2007
ACM
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
MSCS
2006
13 years 11 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
ASPLOS
2012
ACM
12 years 6 months ago
2012
ACM
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...