| G Hossein, J Pieprzyk, G R Chaudhry and J Seberry, How to prevent cheating in Pinch's scheme, Electronic Letters, 33 (17) (1997), 14531454. |
.... of online secret sharing schemes which are derived from this model such as Cachin and Pinch s schemes [13, 48] We propose a modified version of the Pinch multiple secret sharing protocol, which identifies all cheaters, regardless of their number, improving on previous results by Ghodosi et al. [21]. A new scheme is then proposed for computationally secure online secret sharing, in which the shares of the participants can be reused. The security of the scheme is based on the intractability of factoring. This scheme has the advantage that it detects cheating and it enables the identification ....
....Section 2.4 presents Pinch s scheme [48] which is a modified version of the Cachin protocol in which the participants shares can be reused, thus overcoming these problems. It is based on the intractability of the Di#e Hellman problem [18] In section 2. 5, we review the work of Ghodosi et al. [21], who pointed out that Pinch s scheme is vulnerable to cheating. They then modified the Pinch scheme in such a way that cheating is prevented. 65 However Ghodosi et al. s modification to Pinch s scheme does not protect a minority of participants of the authorised set from a colluding majority, ....
[Article contains additional citation context not shown here]
H. Ghodosi, J. Pieprzyk, G.R. Chaudhry, and J. Seberry. "How to prevent cheating in Pinch's scheme". Electronics Letters, 33(17):1453--1454, 1997.
No context found.
G Hossein, J Pieprzyk, G R Chaudhry and J Seberry, How to prevent cheating in Pinch's scheme, Electronic Letters, 33 (17) (1997), 14531454.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC