On line multiple secret sharing
On line multiple secret sharing
- Author(s): R.G.E. Pinch
- DOI: 10.1049/el:19960692
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
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.
Thank you
Your recommendation has been sent to your librarian.
- Author(s): R.G.E. Pinch 1
-
-
View affiliations
-
Affiliations:
1: Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, United Kingdom
-
Affiliations:
1: Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, United Kingdom
- Source:
Volume 32, Issue 12,
6 June 1996,
p.
1087 – 1088
DOI: 10.1049/el:19960692 , Print ISSN 0013-5194, Online ISSN 1350-911X
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.
Inspec keywords: security of data; information theory; protocols
Other keywords:
Subjects: Protocols; Protocols; Data security; Information theory; Information theory
References
-
-
1)
- W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. Inf. Theory , 644 - 654
-
2)
- C. Cachin , C. Boyd . (1994) On-line secret sharing, Cryptography and coding.
-
3)
- L. Lamport . Password authentication with insecure communication. Commun. ACM. , 770 - 772
-
4)
- P.J. Smith , M.J.J. Lennon . LUC - a new public key system. IFIP Trans. (A) Comput. Sci. Tech. , 103 - 117
-
5)
- J.F. Bosar , S.A. Kurtz , M.W. Krentel . A discrete logarithm implementation of perfect zero-knowledge blobs. J. Cryptol. , 63 - 76
-
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)
- G. Brasssard . Modern cryptology: a tutorial. Lect. Notes Comput. Sci.
-
8)
- U.M. Maurer , Y.G. Desmedt . (1994) Towards the equivalence of breaking the Diffie-Hellman protocol and discretelogarithms, Advances in cryptography - Crypto '94.
-
9)
- V.S. Miller , H.C. Williams . (1986) Use of elliptic curves in cryptography, Advances in cryptology - Crypto '85.
-
10)
- A.J. Menezes . (1993) Elliptic curve public key cryptosystems.
-
11)
- 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.
-
1)
Related content
