Computing functions of a shared secret

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 324-345

  Beimel, Amos ^a,b   Burmester, Mike ^c   Desmedt, Yvo ^d   Kushilevitz, Eyal ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF LONDON   (United Kingdom)

^d Florida State University   (United States)

Author keywords

Broadcast channel; Interaction; Private channels; Private computations; Secret sharing

Indexed keywords

EID: 0012096118     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195288819     Document Type: Article

References (38)

1. M. ABADI, J. FEIGENBAUM, AND J. KILIAN, On hiding information from an oracle, J. Comput. System Sci., 39 (1989), pp. 21-50.
2. M. AIGNER, Combinatorial Theory, Springer-Verlag, Berlin, 1979
3. D. BEAVER AND J. FEIGENBAUM, Hiding instances in multioracle queries, in STACS '90, Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, C. Choffrut and T. Lengauer, eds., Lecture Notes in Comput. Sci. 415, Springer-Verlag, New York, 1990, pp. 37-48.
4. A. BEIMEL AND B. CHOR, Universally ideal secret sharing schemes. IEEE Trans. Inform. Theory, 40 (1994), pp. 786-794.
5. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1988, pp. 1-10.
6. J. BENALOH. Secret sharing homomorphisms: Keeping shares of a secret secret, in Advances in Cryptoiogy - CRYPTO '86, A. M. Odlyzko, ed., Lecture Notes in Computer Sci. 263, Springer-Verlag, New York, 1987, pp. 251-260.
7. J. BENALOH AND J. LEICHTER, Generalized secret sharing and monotone functions, in Advances in Cryptoiogy - CRYPTO '88, S. Goldwasser, ed., Lecture Notes in Comput. Sci. 403, Springer-Verlag, New York, 1990, pp. 27-35.
8. G. R. BLAKLEY, Safeguarding cryptographic keys, in Proceedings of the 1979 AFIPS National Computer Conference, R. E. Merwin, J. T. Zanca, and M. Smith, AFIPS Conference Proceedings 48, AFIPS Press, Montvale, NJ, 1979, pp. 313-317.
9. G. R. BLAKLEY AND C. MEADOWS, The security of ramp schemes, in Advances in Cryptology - CRYPTO '84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Comput. Sci. 196, Springer-Verlag, New York, 1985, pp. 242-268.
10. C. BLUNDO, A. DE SANTIS, G. DI CRESCENZO, A. GIORGIO GAGGIA, AND U. VACCARO, Multisecret sharing schemes, in Advances in Cryptology - CRYPTO '94, Y. Desmedt, ed., Lecture Notes in Comput. Sci. 839, Springer-Verlag, New York, 1994, pp. 150-163.
11. C. BLUNDO, A. DE SANTIS, AND U. VACCARO, Efficient sharing of many secrets, in STACS '93, P. Enjalbert, A. Finkel, and K. W. Wagner, eds., Lecture Notes in Comput. Sci. 665, Springer-Verlag, New York, 1993, pp. 692-703.
12. E. F. BRICKELL, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput., 6 (1989), pp. 105-113.
13. E. F. BRICKELL AND D. M. DAVENPORT, On the classification of ideal secret sharing schemes, J. Cryptology, 4 (1991), pp. 123-134.
14. E. F. BRICKELL AND D. R. STINSON, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, 5 (1992), pp. 153-166.
15. D. CHAUM, C. CRÉPEAU, AND I. DAMGARD, Multiparty unconditionally secure protocols, in Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1988, pp. 11-19.
16. B. CHOR AND E. KUSHILEVITZ, A zero-one law for Boolean privacy, SIAM J. Discrete Math., 4 (1991), pp. 36-47.
17. A. DE SANTIS, Y DESMEDT, Y. FRANKEL, AND M. YUNG, How to share a function securely, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1994, pp. 522-533.
18. Y. DESMEDT, Threshold cryptosystems, in Advances in Cryptology - AUSCRYPT '92, J. Seberry and Y. Zheng, eds., Lecture Notes in Comput. Sci. 718, Springer-Verlag, New York, 1993, pp. 5-14.
19. Y. DESMEDT AND Y. FRANKEL, Shared generation of authenticators and signatures, in Advances in Cryptology - CRYPTO '91, J. Feigenbaum, ed., Lecture Notes in Comput. Sci. 576, Springer-Verlag, New York, 1992, pp. 457-469.
20. Y G. DESMEDT AND Y. FRANKEL, Homomorphic zero-knowledge threshold schemes over any finite abelian group, SIAM J. Discrete Math., 7 (1994), pp. 667-679.
21. M. K. FRANKLIN AND M. YUNG, Communication complexity of secure computation, in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, ACM, New York, 1992, pp. 699-710.
22. M. ITO, A. SAITO, AND T. NISHIZEKI, Secret sharing schemes realizing general access structure, in Proceedings of the IEEE Global Telecommunication Conference, Globecom '87, IEEE Press, Piscataway, NJ, 1987, pp. 99-102. Journal version: Multiple assignment scheme for sharing secret, J. Cryptology, 6 (1993), pp. 15-20.
23. M. ITO, A. SAITO, AND T. NISHIZEKI, Secret sharing schemes realizing general access structure, in Proceedings of the IEEE Global Telecommunication Conference, Globecom '87, IEEE Press, Piscataway, NJ, 1987, pp. 99-102. Journal version: Multiple assignment scheme for sharing secret, J. Cryptology, 6 (1993), pp. 15-20.
24. W. JACKSON, K. M. MARTIN, AND C. M. O'KEEFE, Multisecret threshold schemes, in Advances in Cryptology - CRYPTO '93, D. R. Stinson, ed., Lecture Notes in Comput. Sci. 773, Springer-Verlag, New York, 1994, pp. 126-135.
25. W. JACKSON, K. M. MARTIN, AND C. M. O'KEEFE, On sharing many secrets, in ASIACRYPT '94, J. Pieprzyk and R. Safavi-Naini, eds., Lecture Notes in Comput. Sci. 917, Springer-Verlag, New York, 1995, pp. 42-54.
26. W. JACKSON, K. M. MARTIN, AND C. M. O'KEEFE, Ideal secret sharing schemes with multiple secrets, J. Cryptology, 9 (1996), pp. 233-250.
27. E. D. KARNIN, J. W. GREENE, AND M. E. HELLMAN, On secret sharing systems, IEEE Trans. Inform. Theory, 29 (1983), pp. 35-41.
28. J. KILIAN AND N. NISAN, Private communication, 1990.
29. S. C. KOTHARI, Generalized linear threshold scheme, in Advances in Cryptology - CRYPTO '84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Comput. Sci. 196, Springer-Verlag, New York, 1985, pp. 231-241.
30. E. KUSHILEVITZ, Privacy and communication complexity, SIAM J. Discrete Math., 5 (1992), pp. 273-284.
31. R. J. MCELIECE AND D. V. SARWATE, On sharing secrets and Reed-Solomon codes, Comm. ACM, 24 (1981), pp. 583-584.
32. M. O. RABIN, Randomized Byzantine generals, in Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1983, pp. 403-409.
33. R. L. RIVEST, L. ADLEMAN, AND M. L. DERTOUZOS, On data banks and privacy homomorphisms, in Foundations of Secure Computation, R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, eds., Academic Press, New York, 1978, pp. 169-179.
34. P. D. SEYMOUR, On secret-sharing matroids, J. Combin. Theory Ser. B, 56 (1992), pp. 69-73.
35. A. SHAMIR, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
36. G. J. SIMMONS, An introduction to shared secret and/or shared control and their application, in Contemporary Cryptology, The Science of Information Integrity, G. J. Simmons, ed., IEEE Press, Piscataway, NJ, 1992, pp. 441-497.
37. G. J. SIMMONS, W. JACKSON, AND K. M. MARTIN, The geometry of shared secret schemes, Bull. Inst. Combin. Appl., 1 (1991), pp. 71-88.
38. D. R. STINSON, An explication of secret sharing schemes, Des. Codes Cryptogr., 2 (1992), pp. 357-390.