132 search results - page 10 / 27 » Some Bounds and a Construction for Secure Broadcast Encrypti... |
CRYPTO
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
ASIACRYPT
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
EUROCRYPT
2003
Springer
14 years 28 days ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
ACNS
2008
Springer
14 years 2 months ago
2008
Springer
In this paper, we present an analysis of the CCM mode of operations and of a slight variant. CCM is a simple and efficient encryption scheme which combines a CBC-MAC authentication...
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...