Randomness in Distribution Protocols

Information and Computation

Volumn 131, Issue 2, 1996, Pages 111-139

  Blundo, Carlo ^a   De Santis, Alfredo ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008475502     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0095     Document Type: Article

References (43)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in "Proceedings of the 33rd Symposium on Foundations of Computer Science," pp. 14-23.
2. Bellare, M., Goldreich, O., and Sudan, M. (1995), Free bits, PCPs and non-approximability -Towards tight results, in "Proceedings of the 36th IEEE Symposium on Foundations of Computer Science," pp. 422-431.
3. Bellare, M., and Sudan, M. (1994), Improved non-approximability results, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing," pp. 184-193.
4. Ben-Or, M., Goldwasser, S., and Wigderson, A. (1988), Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing," pp. 1-10.
5. Blakley, G. R. (1979), Safeguarding cryptographic keys, in "Proceedings AFIPS 1979 National Computer Conference," pp. 313-317.
6. Blom, R. (1984), An optimal class of symmetric key generation systems, in "Proceedings of Eurocrypt 84, Advances in Cryptology," Lecture Notes in Computer Science, Vol. 209, pp. 335-338, Springer-Verlag, Berlin/New York.
7. Blakley, G. R., and Meadows, C. (1985), Security of ramp schemes, in "Proceedings of Crypto '84, Advances in Cryptology," Lecture Notes in Computer Science, Vol. 196, pp. 411-431, Springer-Verlag, Berlin/New York.
8. Blundo, C., De Santis, A., Gargano, L., and Vaccaro, U. (1996), On the information rate of secret sharing schemes, Theoret. Comput. Sci. 154, 283-306. A preliminary version appeared in "Proceedings of Crypto 92, Advances in Cryptology," Lecture Notes in Computer Science, Vol. 740, pp. 149-169, Springer-Verlag, Berlin/New York, 1993.
9. Blundo, C., De Santis, A., Gargano, L., and Vaccaro, U. (1996), On the information rate of secret sharing schemes, Theoret. Comput. Sci. 154, 283-306. A preliminary version appeared in "Proceedings of Crypto 92, Advances in Cryptology," Lecture Notes in Computer Science, Vol. 740, pp. 149-169, Springer-Verlag, Berlin/New York, 1993.
10. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. (1993), Perfectly secure key distrubution for dynamic conferences, in "Proceedings of Crypto 92, Advances in Cryptology," Lecture Notes in Computer Science, Vol. 740, pp. 478-493, Springer-Verlag, Berlin/ New York.
11. Blundo, C., De Santis, A., Stinson, D. R., and Vaccaro, U. (1995), Graph decomposition and secret sharing schemes, J. Cryptol. 8, 39-64. A preliminary version appeared in "Advances in Cryptology- Eurocrypt '92," Lecture Notes in Computer Science, Vol. 658, pp. 1-24, Springer-Verlag, Berlin/ New York, 1993.
12. Blundo, C., De Santis, A., Stinson, D. R., and Vaccaro, U. (1995), Graph decomposition and secret sharing schemes, J. Cryptol. 8, 39-64. A preliminary version appeared in "Advances in Cryptology-Eurocrypt '92," Lecture Notes in Computer Science, Vol. 658, pp. 1-24, Springer-Verlag, Berlin/ New York, 1993.
13. Blundo, C., De Santis, A., and Vaccaro, U. (1994), Randomness in distribution protocols, in "21st International Colloquium on Automata, Languages and Programming (ICALP '94)," Lecture Notes in Computer Science, Vol. 820, pp. 568-579, Springer-Verlag, Berlin/New York.
14. Blundo, C., De Santis, A., and Vaccaro, U. (1995), "On Secret Sharing Schemes," Technical Report, University of Salerno.
15. Blundo, C., De Santis, A., and Vaccaro, U. (1993), Efficient sharing of many secrets, in "Proceedings of STACS '93," Lecture Notes in Computer Science, Vol. 665, pp. 692-703, Springer-Verlag, Berlin/ New York.
16. Blundo, C., Giorgio Gaggia A., and Stinson, D. R. (1995), On the dealer's randomness required in secret sharing schemes, Design Codes Cryptography, to appear. A preliminary version appeared in "Advances in Cryptology - EUROCRYPT '94," Lecture Notes in Computer Science, Vol. 950, pp. 35-46, Springer-Verlag, Berlin/New York.
17. Blundo, C., Giorgio Gaggia A., and Stinson, D. R. (1995), On the dealer's randomness required in secret sharing schemes, Design Codes Cryptography, to appear. A preliminary version appeared in "Advances in Cryptology - EUROCRYPT '94," Lecture Notes in Computer Science, Vol. 950, pp. 35-46, Springer-Verlag, Berlin/New York.
18. Brickell, E. F., and Davenport, D. M. (1991), On the classification of ideal secret sharing schemes, J. Cryptol. 4, 123-124.
19. Brickell, E. F., and Stinson, D. R. (1992), Improved bounds on the information rate of perfect secret sharing schemes, J. Cryptol. 5, 153-166.
20. Capocelli, R. M., De Santis, A., Gargano, L., and Vaccaro, U. (1993), On the size of shares for secret sharing schemes, J. Cryptol. 6, 157-169.
21. Carpentieri, M., De Santis, A., and Vaccaro, U. (1994), Size of shares and probability of cheating in threshold schemes, in "Advances in Cryptology - EUROCRYPT '93," Lecture Notes in Computer Science, Vol. 765, pp. 118-125, Springer-Verlag, Berlin/New York.
22. Cover, T. M., and Thomas, J. A. (1991), "Elements of Information Theory," Wiley, New York.
23. Feige, U., and Kilian, J. (1994), Two prover protocols - Low error at affordable rates, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing," pp. 172-183.
24. Franklin, M., and Yung, M. (1992), Communication complexity of secure computation, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing," pp. 699-710.
25. Goldreich, O., Micali, S., and Wigderson, A. (1987), How to play any mental game, in "Proceedings of the 19th Annual ACM Symposium on Theory of Computing," pp. 218-229.
26. Gong, L., and Wheeler, D. J. (1990), A matrix key-distribution scheme, J. Cryptol. 2, 51-59.
27. 1-ε, in "Proceedings of the 37th IEEE Symposium on Foundations of Computer Science," pp. 627-636.
28. Impagliazzo, R., and Zuckerman, D. (1989), How to recycle random bits, in "Proceedings of the 21st Annual ACM Symposium on Theory of Computing," pp. 248-255.
29. Karnin, E. D., Greene, J. W., and Hellman, M. E. (1983), On secret sharing systems, IEEE Trans. Inform. Theory 29, 35-41.
30. Knuth, D. E. (1968), "The Art of Computer Programming, Fundamental Algorithms," Addison-Wesley, Reading, MA.
31. Knuth, D. E., and Yao, A. C. (1976), The complexity of nonuniform random number generations, in "Algorithms and Complexity," pp. 357-428, Academic Press, San Diego.
32. Krizanc, D., Peleg, D., and Upfal, E. (1988), A time-randomness tradeoff for oblivious routing, in "Proceedings of the 20th Annual ACM Symposium on Theory of Computing," pp. 93-102.
33. Matsumoto, T., and Imai, H. (1987), On the key predistribution system: A practical solution to the key distribution problem, in "Advances in Cryptology: Proceedings of Crypto 87," Lecture Notes in Computer Science, Vol. 239, pp. 185-193, Springer-Verlag, Berlin/New York.
34. McEliece, R. J., and Sarwate, D. (1981), On sharing secrets and Reed-Solomon codes, Comm. ACM 24, 583-584.
35. Preparata, F. P. (1989), Holographical dispersal and recovery of information, IEEE Trans. Inform. Theory 35, 1123-1124.
36. Rabin, M. O. (1989), Efficient dispersal of information for security, load balancing and fault tolerance, J. Assoc. Comput. Mach. 36, 335-348.
37. Rabin, M. O. (1990), The information dispersal algorithm and its applications, in "Sequences: Combinatorics, Compression, Security and Transmission," pp. 406-419, Springer-Verlag, Berlin/ New York.
38. Shamir, A. (1979), How to share a secret, Comm. ACM 22, 612-613.
39. Simmons, G. J. (1991), An introduction to shared secret and/or shared control schemes and their application, "Contemporary Cryptology," pp. 441-497, IEEE Press, New York.
40. Stinson, D. R. (1992), An explication of secret sharing schemes, Design Codes Cryptogr. 2, 357-390.
41. Stinson, D. R. (1994), Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory 40, 118-125.
42. Tompa, M., and Woll, H. (1988), How to share a secret with cheaters, J. Cryptol. 1, 133-139.
43. Zuckerman, D. (1991), Simulating BPP using a general weak random source, in "Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science," pp. 79-89.