64 search results - page 5 / 13 » Generic Attacks on Feistel Schemes |
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
The one-way function tree (OFT) scheme proposed by Balenson et. al is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. ...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
ACNS
2008
Springer
13 years 11 months ago
2008
Springer
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
CRYPTO
2008
Springer
13 years 6 months ago
2008
Springer
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...