53 search results - page 10 / 11 » Hash Functions and MAC Algorithms Based on Block Ciphers |
FOCS
2007
IEEE
14 years 10 days ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
CRYPTO
2003
Springer
13 years 11 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
INFOCOM
2009
IEEE
14 years 19 days ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
CASES
2003
ACM
13 years 11 months ago
2003
ACM
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
FSE
2011
Springer
12 years 9 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...