Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

Ronald Cramer, Serge Fehr. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings. Volume 2442 of Lecture Notes in Computer Science, pages 272-287, Springer, 2002. [doi]

@inproceedings{CramerF02,
  title = {Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups},
  author = {Ronald Cramer and Serge Fehr},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2442/24420272.htm},
  researchr = {https://researchr.org/publication/CramerF02},
  cites = {0},
  citedby = {0},
  pages = {272-287},
  booktitle = {Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings},
  editor = {Moti Yung},
  volume = {2442},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44050-X},
}