Sciweavers

469 search results - page 27 / 94
» On Adversary Models and Compositional Security
Sort
View
AI
2010
Springer
13 years 4 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
TES
2005
Springer
14 years 1 months ago
Systematic Design of Web Service Transactions
The development of composite Web services is still not as simple as the original vision indicated. Currently, the designer of a composite service needs to consider many different ...
Benjamin A. Schmit, Schahram Dustdar
JOC
2008
86views more  JOC 2008»
13 years 7 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
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
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 10 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman