9 search results - page 1 / 2 » Tackling Adaptive Corruptions in Multicast Encryption Protoc... |
TCC
2007
Springer
13 years 11 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...
ASIACRYPT
2009
Springer
13 years 11 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...
WWIC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. In order to offer secrecy for multicast applic...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
STOC
1996
ACM
13 years 9 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...