39 search results - page 4 / 8 » General Composition and Universal Composability in Secure Mu... |
TCC
2005
Springer
13 years 11 months ago
2005
Springer
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
CRYPTO
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
CCS
2009
ACM
14 years 6 months ago
2009
ACM
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...
PROVSEC
2009
Springer
14 years 18 days ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...