Sciweavers

1585 search results - page 16 / 317
» Automatically optimizing secure computation
Sort
View
IACR
2011
97views more  IACR 2011»
12 years 7 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
EUROCRYPT
2010
Springer
14 years 17 days ago
Partial Fairness in Secure Two-Party Computation
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
S. Dov Gordon, Jonathan Katz
ICS
2009
Tsinghua U.
14 years 2 months ago
Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUs
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...
Jiayuan Meng, Kevin Skadron
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
14 years 17 days ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
CCGRID
2005
IEEE
14 years 1 months ago
Q-SAC: toward QoS optimized service automatic composition
The emerging service grids bring together various distributed services to a ‘market’ for clients to request and enable the integration of services across distributed, heteroge...
Hanhua Chen, Hai Jin, Xiaoming Ning, Zhipeng Lu