Sciweavers

5484 search results - page 30 / 1097
» Almost-Everywhere Secure Computation
Sort
View
ATAL
2009
Springer
15 years 6 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
CCS
2006
ACM
15 years 3 months ago
Secure information sharing enabled by Trusted Computing and PEI models
The central goal of secure information sharing is to "share but protect" where the motivation to "protect" is to safeguard the sensitive content from unauthori...
Ravi S. Sandhu, Kumar Ranganathan, Xinwen Zhang
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
13 years 11 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
PODC
2011
ACM
14 years 2 months ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina