Sciweavers

1923 search results - page 3 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
AAAI
2010
13 years 10 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
SDM
2007
SIAM
190views Data Mining» more  SDM 2007»
13 years 9 months ago
AC-Framework for Privacy-Preserving Collaboration
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. Increasing security concerns have led to a surge in w...
Wei Jiang, Chris Clifton
ATAL
2009
Springer
14 years 3 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, ...
ICCS
2005
Springer
14 years 1 months ago
Computational Complexity and Distributed Execution in Water Quality Management
Abstract. Modeling is considered an inherent part of design, operation and optimization of Water Quality Systems. Models are used for running so-called Virtual Experiments, such as...
Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Pe...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 28 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård