125 search results - page 2 / 25 » Realizing Secure Multiparty Computation on Incomplete Networ... |
AINA
2011
IEEE
12 years 11 months ago
2011
IEEE
—The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security po...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
CRYPTO
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...