| Addressing the shortcomings of one-way chains |
| Full text |
Pdf
(342 KB)
|
| Source
|
ASIAN ACM Symposium on Information, Computer and Communications Security
archive
Proceedings of the 2006 ACM Symposium on Information, computer and communications security
table of contents
Taipei, Taiwan
SESSION: Cryptosystem and analysis
table of contents
Pages: 289 - 296
Year of Publication: 2006
ISBN:1-59593-272-0
|
|
Authors
|
|
Roberto Di Pietro
|
Università degli Studi di Roma - La Sapienza, Via Salaria, Roma, Italy
|
|
Luigi V. Mancini
|
Università degli Studi di Roma - La Sapienza, Via Salaria, Roma, Italy
|
|
Antonio Durante
|
Università degli Studi di Roma - La Sapienza, Via Salaria, Roma, Italy
|
|
Vishwas Patil
|
Università degli Studi di Roma - La Sapienza, Via Salaria, Roma, Italy
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 67, Citation Count: 0
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
G. Ateniese, D. H. Chou, B. de Medeiros, and G. Tsudik. Sanitizable signatures. ESORICS: Proceedings of the 10th European Symposium on Research in Computer Security, Springer--Verlag, LNCS(3679):159--177, 2005.
|
| |
3
|
G. Ateniese and B. de Medeiros. Identity-based chameleon hash and applications. FC: Financial Cryptography, 8th International Conference, Springer--Verlag, LNCS(3110):164--180, 2004.
|
| |
4
|
G. Ateniese and B. de Medeiros. On the key exposure problem in chameleon hashes. SCN: Security in Communication Networks, 4th International Conference, Springer--Verlag, LNCS(3352):165--179, 2004.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
X. Chen, F. Zhang, and K. Kim. Chameleon hashing without key exposure. ISC: Information Security, 7th International Conference, Springer--Verlag, LNCS(3225):87--98, 2004.
|
| |
10
|
R. Di Pietro, A. Durante, and L. V. Mancini. A reliable key authentication schema for secure multicast communications. In SRDS: 22nd Symposium on Reliable Distributed Systems, pages 231--240. IEEE Computer Society, 2003.
|
 |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
N. M. Haller. The S/KEY one-time password system. NDSS: Proceedings of the ISOC Symposium on Network and Distributed System Security, pages 151--157, 1994.
|
| |
15
|
H. Krawczyk and T. Rabin. Chameleon hashing and signatures. NDSS: Proceedings of the ISOC Symposium on Network and Distributed System Security, pages 143--154, 2000.
|
 |
16
|
|
| |
17
|
A. Pannetrat and R. Molva. Efficient multicast packet authentication. NDSS: Proceedings of the ISOC Symposium on Network and Distributed System Security, 2003.
|
| |
18
|
|
| |
19
|
A. Perrig, R. Canetti, D. X. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. NDSS: Proceedings of the ISOC Symposium on Network and Distributed System Security, 2001.
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
 |
23
|
Yang Richard Yang , X. Steve Li , X. Brian Zhang , Simon S. Lam, Reliable group rekeying: a performance analysis, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.27-38, August 2001, San Diego, California, United States
|
|