4340 search results - page 223 / 868 » Formal Methods and Cryptography |
155
click to vote
PKC
2005
Springer
16 years 1 days 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...
168
click to vote
TCC
2005
Springer
16 years 19 hour 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...
163
click to vote
TCC
2005
Springer
16 years 19 hour 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 ...
180
click to vote
ESORICS
2004
Springer
15 years 12 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...
200
click to vote
FSE
2004
Springer
15 years 12 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...