http://iet.metastore.ingenta.com
1887

On line multiple secret sharing

On line multiple secret sharing

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A protocol for computationally secure ‘on line’ secret-sharing is presented, based on the intractability of the Diffie-Hellman problem, in which the participants' shares can be reused.

References

    1. 1)
      • C. Cachin , C. Boyd . (1994) On-line secret sharing, Cryptography and coding.
    2. 2)
      • Goldreich, O., Micali, S., Widgerson, A.: `How to play any mental game or a completeness theorem forprotocols with honest majority', Proceedings, 19th Annual Symposium on Theory of Computing (STOC), 1987, p. 218–229.
    3. 3)
      • L. Lamport . Password authentication with insecure communication. Commun. ACM. , 770 - 772
    4. 4)
      • U.M. Maurer , Y.G. Desmedt . (1994) Towards the equivalence of breaking the Diffie-Hellman protocol and discretelogarithms, Advances in cryptography - Crypto '94.
    5. 5)
      • W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. Inf. Theory , 644 - 654
    6. 6)
      • D. Chaum , I.B. Damgård , J. van de Graaf , C. Pomerance . (1988) Multiparty computations ensuring privacy of each party's inputand correctness of the result, Advances in cryptography - Crypto '87.
    7. 7)
      • J.F. Bosar , S.A. Kurtz , M.W. Krentel . A discrete logarithm implementation of perfect zero-knowledge blobs. J. Cryptol. , 63 - 76
    8. 8)
      • G. Brasssard . Modern cryptology: a tutorial. Lect. Notes Comput. Sci.
    9. 9)
      • P.J. Smith , M.J.J. Lennon . LUC - a new public key system. IFIP Trans. (A) Comput. Sci. Tech. , 103 - 117
    10. 10)
      • V.S. Miller , H.C. Williams . (1986) Use of elliptic curves in cryptography, Advances in cryptology - Crypto '85.
    11. 11)
      • A.J. Menezes . (1993) Elliptic curve public key cryptosystems.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19960692
Loading

Related content

content/journals/10.1049/el_19960692
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address