24 search results - page 5 / 5 » Short Signatures from Weaker Assumptions |
ASIACRYPT
2009
Springer
14 years 4 days ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
CCS
2009
ACM
14 years 6 months ago
2009
ACM
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
IJNSEC
2008
13 years 5 months ago
2008
In this paper, we investigate the issues in the analysis and design of provably secure message authentication codes (MACs) Nested MAC (NMAC) and Hash based MAC (HMAC) proposed by ...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...