352 search results - page 9 / 71 » Adaptively Secure Multi-Party Computation |
WORDS
2005
IEEE
14 years 17 days ago
2005
IEEE
A major advantage of service-based computing technology is the ability to enable rapid formation of large-scale distributed systems by composing massively available services to ac...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
STOC
2002
ACM
14 years 7 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...
ASIACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...