References

  1. C. Asmuth & J. Bloom (1983): A modular approach to key safeguarding. IEEE Transactions on Information Theory 29(2), pp. 208–211, doi:10.1109/TIT.1983.1056651.
  2. A. Behnad & T. Eghlidos (2008): A new, publicly verifiable, secret sharing scheme. Sci. Iran. 15(2), pp. 246–251.
  3. G. R. Blakley (1979): Safeguarding cryptographic keys. Managing Requirements Knowledge, International Workshop on 0, pp. 313, doi:10.1109/AFIPS.1979.98.
  4. F. Boudot & J. Traoré (1999): Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. In: Proceedings of the Second International Conference, ICICS’99, 0302-9743. Springer-Verlag, Berlin, Heidelberg, pp. 87–102, doi:10.1007/978-3-540-47942-0_8.
  5. B. Chor, S. Goldwasser, S. Micali & B. Awerbuch (1985): Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, SFCS '85. IEEE Computer Society, Washington, DC, USA, pp. 383–395, doi:10.1109/SFCS.1985.64.
  6. P. Feldman (1987): A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, SFCS '87. IEEE Computer Society, Washington, DC, USA, pp. 427–438, doi:10.1109/SFCS.1987.4.
  7. A. Fiat & A. Shamir (1986): How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings, Lecture Notes in Computer Science 263. Springer, pp. 186–194, doi:10.1007/3-540-47721-7_12.
  8. E. Fujisaki & T. Okamoto (1998): A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Proceedings of the annual international conference on Theory and application of cryptographic techniques, EUROCRYPT'98. Springer-Verlag, Berlin, Heidelberg, pp. 32–46, doi:10.1007/BFb0054115.
  9. S. Heidarvand & J. L. Villar (2009): Selected Areas in Cryptography, chapter Public Verifiability from Pairings in Secret Sharing Schemes. Springer-Verlag, Berlin, Heidelberg, pp. 294–308, doi:10.1007/978-3-642-04159-4_19.
  10. M. P. Jhanwar (2011): A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme. In: ISPEC'11, pp. 273–287.
  11. E. D. Karnin, J. W. Greene & M. E. Hellman (1983): On secret sharing systems. IEEE Transactions on Information Theory 29(1), pp. 35–41, doi:10.1109/TIT.1983.1056621.
  12. P. Paillier (1999): Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: EUROCRYPT, pp. 223–238, doi:10.1007/3-540-48910-X_16.
  13. T. Pedersen (1992): Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '91. Springer-Verlag, London, UK, UK, pp. 129–140, doi:10.1007/3-540-46766-1_9.
  14. A. Ruiz & J. L. Villar (2005): Publicly Verfiable Secret Sharing from Paillier's Cryptosystem. In: WEWoRC, pp. 98–108. Available at http://subs.emis.de/LNI/Proceedings/Proceedings74/article3801.html.
  15. B. Schoenmakers (1999): A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic. In: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '99. Springer-Verlag, London, UK, UK, pp. 148–164, doi:10.1007/3-540-48405-1_10.
  16. A. Shamir (1979): How to share a secret. Commun. ACM 22(11), pp. 612–613, doi:10.1145/359168.359176.
  17. A. Ben Shil, K. Blibech & R. Robbana (2012): Un nouveau schéma de partage de secrets publiquement vérifiable. In: Proceedings of the 7th Conference on Network and Information Systems Security (SAR-SSI).
  18. M. Stadler (1996): Publicly verifiable secret sharing. In: Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques, EUROCRYPT'96. Springer-Verlag, Berlin, Heidelberg, pp. 190–199, doi:10.1007/3-540-68339-9_17.
  19. T. Y. Wu & Y. M. Tseng (2011): A pairing-based publicly verifiable secret sharing scheme. Journal of Systems Science and Complexity 24(1), pp. 186–194, doi:10.1007/s11424-011-8408-6.
  20. A. Young & M. Yung (2001): A PVSS as Hard as Discrete Log and Shareholder Separability. In: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography, PKC '01. Springer-Verlag, London, UK, UK, pp. 287–299, doi:10.1007/3-540-44586-2_21.
  21. J. Yu, F. Kong & R. Hao (2007): Publicly Verifiable Secret Sharing with Enrollment Ability. In: SNPD (3), pp. 194–199, doi:10.1109/SNPD.2007.435.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org