2012
DOI: 10.1109/tdsc.2012.48
|View full text |Cite
|
Sign up to set email alerts
|

A Trapdoor Hash Based Mechanism for Stream Authentication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(21 citation statements)
references
References 26 publications
0
21
0
Order By: Relevance
“…This is typically achieved by allowing collisions to expose only the ephemeral trapdoor key that is used for computing additional collisions under the same transaction identifier [8], [10], [9], leaving the permanent, longterm trapdoor key secure for future computations of collisions under a different transaction identifier. This property, although beneficial for chameleon signatures, is not desirable in other applications of trapdoor hashes, like sanitizable signatures [6], online-offline signatures [2], proxy signatures [5] and stream authentication [7]. Chen et al [18], and later Harn et al [12] presented multiple-collision trapdoor hashing schemes where revealing multiple collisions of the same hash value doesn't leak the ephemeral or the long-term trapdoor key, thus, preventing the computation of additional collisions.…”
Section: Ieee Conference On Communications and Network Securitymentioning
confidence: 99%
See 1 more Smart Citation
“…This is typically achieved by allowing collisions to expose only the ephemeral trapdoor key that is used for computing additional collisions under the same transaction identifier [8], [10], [9], leaving the permanent, longterm trapdoor key secure for future computations of collisions under a different transaction identifier. This property, although beneficial for chameleon signatures, is not desirable in other applications of trapdoor hashes, like sanitizable signatures [6], online-offline signatures [2], proxy signatures [5] and stream authentication [7]. Chen et al [18], and later Harn et al [12] presented multiple-collision trapdoor hashing schemes where revealing multiple collisions of the same hash value doesn't leak the ephemeral or the long-term trapdoor key, thus, preventing the computation of additional collisions.…”
Section: Ieee Conference On Communications and Network Securitymentioning
confidence: 99%
“…Shamir et al [2] employed trapdoor hash functions to develop a new paradigm, called hash-sign-switch, that can be used to convert any signature scheme into an online/offline signature scheme [3]. Trapdoor hashing schemes also find applications in the development of several novel signature schemes that include, threshold signatures [4], proxy signatures [5], sanitizable signatures [6], and stream authentication schemes [7].…”
Section: Introductionmentioning
confidence: 99%
“…Until now, many researchers have proposed several stream authentication mechanisms aiming at reducing both computation and communication overhead related with securing individual blocks in a stream [4,5,6,7,8,9,19]. Among several mechanisms, recently, S. Chandrasekhar et al [19] proposed an efficient stream authentication technique based on trapdoor hash function (THF), called DL-SA, for secure content delivery in CDNs.…”
Section: Introductionmentioning
confidence: 99%
“…Until now, many researchers have proposed several stream authentication mechanisms aiming at reducing both computation and communication overhead related with securing individual blocks in a stream [4,5,6,7,8,9,19]. Among several mechanisms, recently, S. Chandrasekhar et al [19] proposed an efficient stream authentication technique based on trapdoor hash function (THF), called DL-SA, for secure content delivery in CDNs. In fact, since DL-SA is a kind of online/offline signature scheme [11,12,13,14,15,16,17,18,19,20] using trapdoor hash function, the online signing can be efficiently processed by shifting computational burden to offline phase.…”
Section: Introductionmentioning
confidence: 99%
“…Packet-independent schemes [4][5] verify a packet immediately when receiving it, but they attach too much authenticating information which brings heavy communication overhead. Packet-dependent schemes such as [6] [7], require a receiver to buffer a certain amount of packets before authenticating them. These schemes cause authentication delay and suffer from pollution attack, but they require less extra bytes for authentication.…”
Section: Introductionmentioning
confidence: 99%