A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
A discrete logarithm implementation of perfect zero-knowledge blobs
Journal of Cryptology
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Password authentication with insecure communication
Communications of the ACM
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Secure Electronic Commerce: Building the Infrastructure for Digital Signatures and Encryption
Secure Electronic Commerce: Building the Infrastructure for Digital Signatures and Encryption
Efficient Multicast Packet Authentication Using Signature Amortization
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Security and privacy issues of handheld and wearable wireless devices
Communications of the ACM - Why CS students need math
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the key exposure problem in chameleon hashes
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
| Hi-index | 0.00 |
One-way hash chains have been the preferred choice, over the symmetric and asymmetric key cryptography, in security setups where efficiency mattered; despite the ephemeral confidentiality and authentication they assure. Known constructions of one-way chains (for example, SHA-1 based), only ensure the forward secrecy and have limitations over their length i.e., a priori knowledge of chain's length is necessary before constructing it. In this paper, we will see how our approach, based on chameleon functions, leads to the generation of practically unbounded one-way chains with constant storage and computational requirements. We provide the construction and advantages of our proposal with the help of a secure group communication setup. We also provide the implementation details of our construction and argue its suitability for security setups, where one cannot a priori determine the longevity of the setup.