Abstract
Secret sharing is simply a special form of key distribution.
This work performed at Sandia National Laboratories supported by the U. S. Department of Energy under contract no. DE-AC04-76DP00789.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.W.P. Hirschfeld, Finite Projective Spaces of Three Dimensions, Oxford Mathematical Monographs, Oxford University Press, New York, 1985.
J.W.P. Hirschfeld, Projective Geometries Over Finite Fields, Oxford Mathematical Monographs, Oxford University Press, New York, 1979.
D.M.Y. Sommerville, An Introduction to the Geometry of N Dimensions, Dover Publications, Inc., New York, 1958.
C. A. Asmuth and G. R. Blakley, “Pooling, Splitting and Reconstituting Information to Overcome Total Failure of Some Channels of Communication,” Proc. IEEE Computer Soc. 1982 Symp. on Security and Privacy, Oakland, CA, Apr. 26–28, 1982, pp. 156–169.
C. Asmuth and J. Bloom, “A Modular Approach to Key Safeguarding,” IEEE Trans. Info. Theory, Vol. IT-29, No. 2, Mar. 1983, pp. 208–210.
J. Benaloh and J. Leichter, “Generalized Secret Sharing and Monotone Functions,” Crypto’88, Santa Barbara, CA, Aug. 21–25, 1988, Advances in Cryptology, to appear.
J. C. Benaloh, “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret,” Crypto’86, Santa Barbara, CA, Aug. 11–15, 1986, Advances in Cryptology, Vol. 263, Ed. by A. M. Odlyzko, Springer-Verlag, Berlin, 1986, pp. 251–260.
L. Berardi, M. DeFonso and F. Eugeni, “Thereshold Schemes Based on Criss-Cross Block Designs,” Private Communication.
L. Berardi and F. Eugeni, “Geometric Structures, Cryptography and Security Systems Requiring a Quorum,” Proc. 1987 ATTI del Primo Simposio Nazionale su Stato e Prospettive della Ricerca Crittografica in Italia, Rome, Italy, Oct. 30–31, 1987, pp. 127–133.
A. Beutelspacher and K. Vedder, “Geometric Structures as Threshold Schemes,” Proc. 1987 IMA Conference on Cryptography and Coding Theory, Cirencester, England, Oxford University Press, to appear.
A. Beutelspacher, “Enciphered Geometry: Some Applications of Geometry to Cryptography,” Proceedings of Combinatorics’86, Annals of Discrete Mathematics, 37, North-Holland, 1988, pp. 59–68.
A. Beutelspacher, “How to say ‘No’,” Eurocrypt’89, Apr. 11–13, 1989, Houthalen, Belgium, Advances in Cryptology, Springer-Verlag, Berlin, to appear.
G. R. Blakley and R. D. Dixon, “Smallest Possible Message Expansion in Threshold Schemes,” Crypto’86, Santa Barbara, CA, Aug. 11–15, 1988, Advances in Cryptology, Vol. 263, Ed. by A. M. Odlyzko, Springer-Verlag, Berlin, 1986, pp. 266–274.
G. R. Blakley and C. Meadows, “Security of Ramp Schemes,” Crypto’84, Santa Barbara, CA, Aug. 19–22, 1984, Advances in Cryptology, Vol. 196, Ed. by G. R. Blakley and D. Chaum, Springer-Verlag, Berlin, 1985, pp. 411–431.
G. R. Blakley and L. Swanson, “Security Proofs for Information Protection Systems,” Proc. IEEE Computer Soc. 1981 Symp. on Security and Privacy, Oakland, CA, Apr. 27–29, 1981, pp. 75–88.
G. R. Blakley, “One-time Pads are Key Safeguarding Schemes, Not Cryptosystems: Fast Key Safeguarding Schemes (Threshold Schemes) Exist,” Proc. IEEE Computer Soc. 1980 Symp. on Security and Privacy, Oakland, CA, Apr. 14–16, 1980, pp. 108–113.
G. R. Blakley, “Safeguarding Cryptographic Keys,” Proc. AFIPS 1979 Nat. Computer Conf., Vol. 48, New York, NY, June 1979, pp. 313–317.
J. R. Bloom, “A Note on Superfast Threshold Schemes,” preprint, Texas A&M Univ., Dept. of Mathematics, 1981.
J. R. Bloom, “Threshold Schemes and Error Correcting Codes,” Am. Math. Soc., Vol. 2, 1981, pp. 230.
J. Box, D. Chaum and G. Purdy, “A Voting Scheme,” Crypto’88, Santa Barbara, CA, Aug. 21–25, 1988, Advances in Cryptology, to appear.
E. F. Brickell and D. R. Stinson, “The Detection of Cheaters in Threshold Schemes,” 18th Annual Conference on Numerical Mathematics and Computing, Sept. 29–Oct. 1, 1988, Winnipeg, Manitoba, Canada, Congressus Numerantium, Vol. 68–69, to appear 1989.
E. G. Brickell, “Some Ideal Secret Sharing Schemes,” 3rd Carbondale Combinatorics Conference, Oct. 31, 1988, Carbondale, IL, J. Combinatorial Mathematics and Combinatorial Computing, to appear.
D. Chaum, Claude Crepeau and I. Damgard, “Multiparty Unconditionally Secure Protocols,” 4th SIAM Conference on Discrete Mathematics, San Francisco, CA, June 13–16, 1988, abstract appearing in SIAM Final Program Abstracts: Minisymposia, #M-28/3:20pm, pp. A8.
D. Chaum, “How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems,” Crypto’84, Santa Barbara, CA, Aug. 19–22, 1984, Advances in Cryptology, Vol. 196, Ed. by G. R. Blakley and D. Chaum, Springer-Verlag, Berlin, 1984, pp. 481–485.
D. Chaum, “Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups,” Memo. No. UCB/ERL/M79/10, Univ. of Calif, Berkeley, ERL 1979; also, Ph.D. dissertation in Computer Science, Univ. of Calif., Berkeley, 1982.
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,” Proc. 26th IEEE Symp. Found. Comp. Sci., Portland, OR, Oct. 1985, pp. 383–395.
G. I. Davida, R. A. DeMillo and R. J. Lipton, “Protecting Shared Cryptographic Keys,” Proc. IEEE Computer Soc. 1980 Symp. on Security and Privacy, Oakland, CA, Apr. 14–16, 1980, pp. 100–102.
M. De Soete and K. Vedder, “Some New Classes of Geometric Threshold Schemes,” Eurocrypt’88, May 25–27, 1988, Davos, Switzerland, Advances in Cryptology, Vol. 330, Ed. by C. G. Günther, Springer-Verlag, Berlin, pp. 57–76.
A. Ecker, “Tactical Configurations and Threshold Schemes,” preprint (available from author).
Paul Feldman, “A Practical Scheme for Non-iteractive Verifiable Secret Sharing,” Proc. 28th Annual Symp. on Foundations of Comp. Sci., Los Angeles, CA, Oct. 12–14, 1987, IEEE Computing Soc. Press, Washington, D.C., 1987, pp. 427–437.
S. Harari, “Secret Sharing Systems,” Secure Digital Communications, Ed. by G. Longo, Springer-Verlag, Wien, 1983, pp. 105–110.
M. Ito, A. Saito and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure,” (in English) Proc. IEEE Global Telecommunications Conf., Globecom’87, Tokyo, Japan, 1987, IEEE Communications Soc. Press, Washington, D.C., 1987, pp. 99–102. Also to appear in Trans. IEICE Japan, Vol. J71-A, No. 8, 1988 (in Japanese).
M. Ito, A. Saito and T. Nishizeki, “Multiple Assignment Scheme for Sharing Secret,” preprint (available from T. Nishizeki).
E. D. Karnin, J. W. Greene and M. E. Hellman, “On Secret Sharing Systems,” IEEE International Symposium on Information Theory, Session B3 (Cryptography), Santa Monica, CA, Feb. 9–12, 1981, IEEE Trans. Info. Theory, Vol. IT-29, No. 1, Jan. 1983, pp. 35–41.
S. C. Kothari, “Generalized Linear Threshold Scheme,” Crypto’84, Santa Barbara, CA, Aug. 19–22, 1984, Advances in Cryptology, Vol. 196, Ed. by G. R. Blakley and D. Chaum, Springer-Verlag, Berlin, 1985, pp. 231–241.
K. Koyama, “Cryptographic Key Sharing Methods for Multi-groups and Security Analysis,” Trans. IECE Japan, Vol. E66, No. 1, 1983, pp. 13–20.
C. Matsui, K. Tokowa, M. Kasahara and T. Namekawa, “Notes on (K,N) Threshold Scheme,” Proc. Joho Riron To Sondo Ooyo Kenkyukai, VII-th Symposium, Kinugawa, Japan, Nov. 5–7, 1984, pp. 158–163 (in Japanese); The VII-th Symposium on Information Theory and Its Applications, English translation available from G. J. Simmons.
R. J. McEliece and D. V. Sarwate, “On Sharing Secrets and Reed-Solomon Codes,” Com. ACM, Vol. 24, No. 9, Sept. 1981, pp. 583–584.
C. Meadows, “Some Threshold Schemes Without Central Key Distributors,” Crypto’88, Santa Barbara, CA, Aug. 21–25, 1988, Advances in Cryptology, to appear.
M. Merritt, “Key Reconstruction,” Crypto’82, Santa Barbara, CA, Aug. 23–25, 1982, Advances in Cryptology, Ed. by D. Chaum, R. L. Rivest and A. T. Sherman, Plenum Press, New York, 1983, pp. 321–322.
M. Mignotte, “How to Share a Secret,” Workshop on Cryptography, Burg Feuerstein, Germany, Mar. 29–Apr. 2, 1982, Cryptography, Vol. 149, Ed. by T. Beth, Springer-Verlag, Berlin, 1983, pp. 371–375.
R. von Randow, “The Bank Safe Problem,” Discrete Applied Mathematics, 4, 1982, pp. 335–337.
P. J. Schellenberg and D. R. Stinson, “Threshold Schemes from Combinatorial Designs,” submitted to the Journal of Combinatorial Mathematics and Combinatorial Computing.
A. Shamir, “How to Share a Secret,” Massachusetts Inst. of Tech. Tech. Rpt. MIT/LCS/TM-134, May 1979. (See also Comm. ACM, Vol. 22, No. 11, Nov. 1979, pp. 612–613.)
G. J. Simmons, “How to (Really) Share a Secret,” Crypto’88, Santa Barbara, CA, Aug. 21–25, 1988, Advances in Cryptology, to appear.
G. J. Simmons, “Robust Shared Secret Schemes or ‘How to be Sure You Have the Right Answer Even Though You Don’t Know the Question’,” 18th Annual Conference on Numerical Mathematics and Computing, Sept. 29–Oct. 1, 1988, Winnipeg, Manitoba, Canada, Congressus Numerantium, Vol. 68–69, to appear 1989.
G. J. Simmons, “Sharply Focused Sets of Lines on a Conic in PG(2, q),” 20th Southeastern International Confeence on Combinatorics, Graph Theory & Computing, Feb. 20–24, 1989, Boca Raton, FL, Congressus Numerantium, to appear 1989.
D. R. Stinson and S. A. Vanstone, “A Combinatorial Approach to Threshold Schemes,” Crypto’87, Santa Barbara, CA, Aug. 16–20, 1987, Advances in Cryptology, Ed. By Carl Pomerance, Springer-Verlag, Berlin, 1988, pp. 330–339.
D. R. Stinson and S. A. Vanstone, “A Combinatorial Approach to Threshold Schemes,” SIAM J. Disc. Math, Vol. 1, No. 2, May 1988, pp. 230–236. (This is an expanded version of the paper appearing in Advances in Cryptology: Proceedings of Crypto’87, Vol. 293, Ed. By Carl Pomerance, Springer-Verlag, Berlin, 1988.)
M. Tompa and H. Woll, “How to Share a Secret with Cheaters,” Crypto’86, Santa Barbara, CA, Aug. 19–21, 1986, Advances in Cryptology, Vol. 263, Ed. by A. M. Odlyzko, Springer-Verlag, Berlin, 1986, pp. 261–265; also Journal of Cryptology, Vol. 1, No. 2, 1988, pp. 133–138.
H. Unterwalcher, “A Department Threshold Scheme Based on Algebraic Equations,” Contributions to General Algebra, 6, Dedicated to the memory of Wilfried Nöbauer, Verlag B. G. Teubner, Stuttgart (GFR), to appear Dec. 1988.
H. Unterwalcher, “Threshold Schemes Based on Systems of Equations,” Österr. Akad. d. Wiss, Math.-Natur. K1, Sitzungsber. II, Vol. 197, 1988, to appear.
H. Yamamoto, “On Secret Sharing Schemes Using (k, L, n) Threshold Scheme,” Trans. IECE Japan, Vol. J68-A, No. 9, 1985, pp. 945–952, (in Japanese); also published as “Secret Sharing System Using (k, L, n) Threshold Scheme,” Electronics and Communications in Japan, Part 1, Vol. 69, No. 9, 1986, pp. 46–54.
H. Yamamoto, “On Secret Sharing Communication Systems with Two or Three Channels,” IEEE Trans. Info. Theory, Vol. IT-32, No. 3, May 1986.
H. Yamamoto, “Coding Theorem for Secret Sharing Communication Systems with Two Noisy Channels,” IEEE Trans. Info. Theory, to appear.
T. Uehara, T. Nishizeki, E. Okamoto and K. Nakamura, “Secret Sharing Systems with Matroidal Schemes,” Trans. IECE Japan, Vol. J69-A, No. 9, 1986, pp. 1124–1132, (in Japanese; English translation available from G. J. Simmons) presented at the 1st China-USA International Conference on Graph Theory and its Applications, Jinan, China, June 1986. English summary by Takao Nishizeki available as Tech. Rept. TRECIS8601, Dept. of Elect. Communs., Tohoku University, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simmons, G.J. (1990). Prepositioned Shared Secret and/or Shared Control Schemes. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_44
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive