4340 search results - page 223 / 868 » Formal Methods and Cryptography |
133
Voted
PKC
2005
Springer
15 years 10 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
143
click to vote
TCC
2005
Springer
15 years 10 months ago
2005
Springer
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of t...
140
click to vote
TCC
2005
Springer
15 years 10 months ago
2005
Springer
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
155
Voted
ESORICS
2004
Springer
15 years 10 months ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
168
Voted
FSE
2004
Springer
15 years 10 months ago
2004
Springer
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...