51 search results - page 10 / 11 » Using Steganography to Improve Hash Functions' Collision Res... |
IACR
2011
12 years 8 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
ANCS
2009
ACM
13 years 6 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
CTRSA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
ICPP
1995
IEEE
14 years 3 days ago
1995
IEEE
— Skewed-associative caches use several hash functions to reduce collisions in caches without increasing the associativity. This technique can increase the hit ratio of a cache w...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...