[1]DI PIETRO R, MANCINI L V, SORIENTE C, et al. Catch me (if you can): data survival in unattended sensor networks [C]// The Sixth Annual IEEE International Conference on Pervasive Computing and Communications. Washington, DC: IEEE Computer Society, 2008: 185-194.[2]MA D, SORIENTE C, TSUDIK G. New adversary and new threats: security in unattended sensor networks [J]. IEEE Network, 2009, 23(2):43-48.[3]VITALI D, SPOGNARDI A, MANCINI L V. Replication schemes in unattended wireless sensor networks [C]// The 4th IFIP International Conference on New Technologies, Mobility and Security. Washington, DC:IEEE Computer Society, 2011:1-5, 7-10.[4]VITALI D, SPOGNARDI A, VILLANI A, et al. MhRep: Multi-hop replication scheme for data survival in unattended wireless sensor networks [C]// SRDSW: the 30th IEEE Symposium on Reliable Distributed Systems Workshops. Washington, DC: IEEE Computer Society, 2011:42-51.[5]VO T M Y, TALIM J. Random distribution for data survival in unattended wireless sensor networks [C]// SENSORCOMM: the Fourth International Conference on Sensor Technologies and Applications.Washington, DC: IEEE Computer Society, 2010:468-471.[6]REN W, ZHAO J G, REN Y. MSS: A multi-level data placement scheme for data survival in wireless sensor networks[C]// The 5th International Conference on Wireless Communications, Networking and Mobile Computing. Washington, DC: IEEE Computer Society, 2009:1-4.〖HJ1.75mm〗[7]WANG Q, REN Q, LOU W J, et al. Dependable and secure sensor data storage with dynamic integrity assurance [C]// INFOCOM: The 28th Conference on Computer Communications. Washington, DC: IEEE Computer Society, 2009:954-962.[8]SHAMIR A. How to share a secret [J]. Communications of the ACM, 1979, 22(11): 612- 613.[9]LIU T, CHEN D J, ZHOU M Z. Pair-wise key update in wireless sensor networks based on reputation model [C]// 2011 International Conference on Electronics, Communications and Control. Washington, DC: IEEE Computer Society, 2011:1558-1561.[10]ZHOU L D, ZYGMUNT J H. Securing Ad Hoc networks [J]. IEEE Networks Special Issue on Network Security, 1999, 13(6):24-30.[11]BENALOH J C. Secret sharing homomorphisms: keeping shares of a secret secret [C]// CRYPTO'86:Proceedings on Advances in Cryptology. London: Springer-Verlag, 1986: 251-260.[12]ASMUTH C, BLOOM J. A modular approach to key safeguarding [J]. IEEE Transactions on Information Theory, 1983, 29(2): 208-210. |