SEARCH

SEARCH BY CITATION

REFERENCES

  • 1
    Diffie W, Hellman ME. New direction in cryptography. IEEE Transaction on Information Theory 1976; 22(6):644654.
  • 2
    Blundo C, Santis AD, Herzberg A, Kutten S, Vaccaro U, Yung M. Perfectly-secure key distribution for dynamic conferences In. In Proceeding of CRYPTO 1992. Lecture Notes in Computer Science Vol. 740. Springer-Verlag: Berlin, 1993; 644654.
  • 3
    Blom R. An optimal class of symmetric key generation systems In. In Proceeding of EUROCRYPT 1984. Lecture Notes in Computer Science Vol. 209. Springer-Verlag: Berlin, 1984; 335338.
  • 4
    Liu D, Ning P. Establishing pairwise keys in distributed sensor networks. In Proceeding of ACM Conference on Computer and Communications Security, 2003; 5261.
  • 5
    Liu D, Ning P, Li R. Establishing pairwise keys in distributed sensor networks. ACM Transaction on Information and System Security 2005; 8(2):4177.
  • 6
    Cheng Y, Agrawal DP. An improved key distribution mechanism for large-scale hierarchical wireless sensor networks. Ad Hoc Networks 2007; 5(1):3548.
  • 7
    Song G, Zhuhong Q. A compromise-resilient group rekeying scheme for hierarchical wireless sensor networks. In Proceeding of Wireless Communications and Networking Conference, 2010; 16.
  • 8
    Haijun L, Chao W. An energy efficient dynamic key management scheme based on polynomial and cluster in wireless sensor networks. Journal of Convergence Information Technology 2011; 6(5):321328.
  • 9
    Chor B, Goldwasser S, Micali S, Awerbuch B. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proceeding of the 26th IEEE Symposium on Foundations of Computer Science, 1985; 383395.
  • 10
    Shamir A. How to share a secret. Communications of the ACM 1979; 22(11):612613.
  • 11
    Harn L, Lin C. Detection and identification of cheaters in (t,n) secret sharing scheme. Designs Codes and Cryptography 2009; 52(1):1524.
  • 12
    Ghodosi H. Comments on Harn-Lin's cheating detection scheme. Designs Codes and Cryptography 2011; 60(1):6366.
  • 13
    Backes M, Kate A, Patra A. Computational verifiable secret sharing revisited In. In Proceeding of ASIACRYPT 2011. Lecture Notes in Computer Science Vol. 7073. Springer-Verlag: Berlin, 2011; 590609.
  • 14
    D'Arco P, Stinson DR. On unconditionally secure robust distributed key distribution centers In. In Proceedings of ASIACRYPT 2002. Lecture Notes in Computer Science Vol. 2501. Springer-Verlag: Berlin, 2002; 181189.
  • 15
    Feldman P. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 1987; 427437.
  • 16
    Patra A, Choudhary A, Rabin T, Rangan CP. The round complexity of verifiable secret sharing revisited In. In Proceedings of CRYPTO 2009. Lecture Notes in Computer Science Vol. 5677. Springer-Verlag: Berlin, 2009; 487504.