610 search results - page 12 / 122 » Information-theoretically secure protocols and security unde... |
CSFW
1995
IEEE
15 years 1 months ago
1995
IEEE
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
80
Voted
CTRSA
2009
Springer
15 years 4 months ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
103
Voted
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CSFW
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement an algorithm for model checking specifications in the logic of knowledge for ...