Sciweavers

686 search results - page 47 / 138
» Secure Two-Party Computation Is Practical
Sort
View
ESORICS
2010
Springer
13 years 10 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
TPDS
2008
106views more  TPDS 2008»
13 years 9 months ago
Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters
Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in the industry and academic organizations. However, ex...
Tao Xie 0004, Xiao Qin
CIS
2005
Springer
14 years 3 months ago
Survivability Computation of Networked Information Systems
Abstract. Survivability should be considered beyond security for networked information systems, which emphasizes the ability of continuing providing services timely in malicious en...
Xuegang Lin, Rongsheng Xu, Miaoliang Zhu
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 1 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 3 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano