On the power of computational secret sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2904, Issue , 2003, Pages 162-176

  Vinod, V ^a   Narayanan, Arvind ^b   Srinathan, K ^b   Rangan, C Pandu ^b   Kim, Kwangjo ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Access structures; Computationally bounded players; Monotone P; Secret sharing

Indexed keywords

ALGEBRA; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY;

ACCESS STRUCTURE; COMPUTATIONALLY BOUNDED PLAYERS; PUBLIC INFORMATION; SECRET SHARING; SECRET SHARING SCHEMES; SEMI-TRUSTED THIRD PARTIES;

STRUCTURAL OPTIMIZATION;

EID: 0346895377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24582-7_12     Document Type: Article

References (15)

1. P. Beguin and A. Cresti. General short computational secret sharing schemes. In Advances in Cryptology - EUROCRYPT '95, volume 921 of LNCS, pp. 194-208, 1995.
2. A. Beimel and Y. Ishai. On the Power of Non-Linear Secret Sharing, newblock In proceedings of 16th IEEE Structure in Complexity Theory , 2001.
3. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In proceedings of CRYPTO 88, volume 403 of LNCS, pp. 27-36. Springer-Verlag, 1988.
4. M. Bellare and S. Micali. Non-interactive oblivous transfer and applications. Advances in Cryptology - CRYPTO'89, pp. 547-557, 1989.
5. Cachin. On-line secret sharing. In IMA: IMA Conference on Cryptography and Coding, LNCS lately (earlier: Cryptography and Coding II, Clarendon Press, 1992), 1995.
6. M. K. Franklin and M. K. Reiter. Fair exchange with a semi-trusted third party. In ACM Conference on Computer and Communications Security, pp. 1-5, 1997.
7. Grigni and Sipser. Monotone Complexity. In PATBOOL: Boolean Function Complexity, London Mathematical Society Lecture Note Series 169, Cambridge University Press, 1992.
8. M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings of IEEE Globecom 87, pp. 99-102. IEEE, 1987.
9. M. Karchmer and A. Wigderson. On span programs. In Proceedings of the 8th Annual IEEE Structure in Complexity Theory, pp. 102-111, 1993.
10. H. Krawczyk. Secret sharing made short. In CRYPTO'93, LNCS, pp. 136-146, 1993.
11. M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. In SODA 01, pp. 448-457, 2001.
12. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981.
13. M. Rabin. Efficient dispersal of information for security, load-balancing and fault-tolerance. JACM, volume 36, pp. 335-348, 1989.
14. A. Razborov. A lower bound on the monotone network complexity of the logical permanent, (in russian). In Mat. Zametki, volume 37(6), pp. 887-900, 1985.
15. A. C. Yao. How to generate and exchange secrets. In Proc. of STOC, pp. 162-167, 1986.