Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Password authentication with insecure communication
Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Handbook of Applied Cryptography
Handbook of Applied Cryptography
SPINS: security protocols for sensor networks
Wireless Networks
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Security for Hash Chains in Ad Hoc Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Secure Broadcast Communication in Wired and Wireless Networks
Secure Broadcast Communication in Wired and Wireless Networks
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
On Universal Classes of Extremely Random Constant-Time Hash Functions
SIAM Journal on Computing
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Security and Communication Networks
6LoWPAN fragmentation attacks and mitigation mechanisms
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
Sensors and other constrained devices periodically transmit small information packets motivating the study of hash chains with small domains and ranges. Hash chain based protocols use deferred disclosure and it is often assumed their hash functions are one-way, thus essentially unbreakable. However, if a deterministic hash function's domain and range are both very small, then the hash function can't be one-way. This paper proposes a solution to this challenge general hash chains. General hash chains have the following properties: repeated hash elements don't indicate cycles; subsequent hash elements don't have exponentially diminishing ranges.