469 search results - page 59 / 94 » On Adversary Models and Compositional Security |
ACISP
2009
Springer
14 years 2 months ago
2009
Springer
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...