Personal and Ubiquitous Computing

, Volume 23, Issue 5–6, pp 723–738 | Cite as

Optimal secret sharing for wireless information security in the era of Internet of Things

  • Lei MiaoEmail author
  • Dingde Jiang
Original Article


Secret sharing is crucial to information security in wireless communications in the era of Internet of Things. In this paper, we study how to optimally share secrets between two and more users using the effect of wireless channel dynamics on the data link layer. For the two-user case, we formulate an optimization problem whose objective is to minimize the expectation of the probability that an eavesdropper receives all secret sharing packets. Our contributions are as follows: (i) we come up with the secret sharing mechanism that minimizes the aforementioned objective function and (ii) we perform analysis on our approach and derive the worst-case probability of the eavesdropper receiving all secret sharing packets. For the multi-user case, we focus on the scenario that three users within each other’s communication range try to establish a common secret. A novel multi-user secret sharing mechanism that allows all three users to contribute toward the common secret is developed and analyzed. Our approach has two nice properties: (i) it is able to reset itself in case of packet transmission error and (ii) its secret sharing efficiency is high when the probability of packet transmission success is not low. Our results are validated via simulations.


Network security Secret sharing Wireless networks Cryptography 


Funding information

The authors’ work is supported in part by a start-up funding provided by Middle Tennessee State University.


  1. 1.
    Miao L, Jiang D (2017) Optimal secret sharing for secure wireless communications in the era of internet of things. In: The 4th international conference on smart and sustainable city, Shanghai, ChinaGoogle Scholar
  2. 2.
    Barros J, Rodrigues MRD (July 2006) Secrecy capacity of wireless channels. In: IEEE international symposium on information theory, Seattle, WAGoogle Scholar
  3. 3.
    Maurer UM (1993) Secret key agreement by public discussion from common information. IEEE Trans Inf Theory 39:733–742MathSciNetCrossRefGoogle Scholar
  4. 4.
    Perron E, Diggavi S, Telatar E (2009) On cooperative wireless network secrecy. In: IEEE Infocom, Rio de Janeiro, BrazilGoogle Scholar
  5. 5.
    Balanis CA (1997) Antenna Theory: Analysis and Design, 2nd edn. Wiley, New YorkGoogle Scholar
  6. 6.
    Wilson R, Tse D, Scholtz RA (2007) Channel identification: Secret sharing using reciprocity in ultrawideband channels. IEEE Trans Inf Forensic Secur 2:364–375CrossRefGoogle Scholar
  7. 7.
    Mathur S, Trappe W, Mandayam N, Ye C, Reznik A (2008) Radio-telepathy: extracting a secret key from an unauthenticated wireless channel. In: Proceedings of the 14th ACM international conference on mobile computing and networking, San Francisco, CA, USAGoogle Scholar
  8. 8.
    Kiayias BA-SA, Mercado A, Yener B (2007) Robust key generation from signal envelopes in wireless networks. In: Proceedings of the 14th ACM conference on computer and communications security, Alexandria, VirginiaGoogle Scholar
  9. 9.
    Miao L (2015) Differential secret sharing in wireless networks. IEEE Wirel Commun Lett 4(2):213–216CrossRefGoogle Scholar
  10. 10.
    Zeng K, Wu D, Chan AJ, Mohapatra P (2010) Exploiting multiple-antenna diversity for shared secret key generation in wireless networks. In: Proceedings of IEEE INFOCOM, San Diego, pp 1–9Google Scholar
  11. 11.
    Liu H, Yang J, Wang Y, Chen Y (2012) Collaborative secret key extraction leveraging received signal strength in mobile wireless networks. In: Proceedings of IEEE INFOCOM, Orlando, pp 927–935Google Scholar
  12. 12.
    Sun J, Chen X, Zhang J, Zhang Y, Zhang J (2014) Synergy: A game-theoretical approach for cooperative key generation in wireless networks. In: Proceedings of IEEE INFOCOM, Toronto, pp 997–1005Google Scholar
  13. 13.
    Xiao S, Gong W, Towsley D Secure wireless communication with dynamic secrets. In: IEEE Infocom, San Diego, CAGoogle Scholar
  14. 14.
    Yao T, Fukui K, Nakashima J, Nakai T (2009) Initial common secret key sharing using random plaintexts for short-range wireless communications. IEEE Trans Consum Electron 55:2025–2033CrossRefGoogle Scholar
  15. 15.
    Safaka I, Fragouli C, Argyraki K, Diggavi S (2012) Creating shared secrets out of thin air. In: Proceedings of the 11th ACM Workshop on Hot Topics in Networks. ACM, pp 73–78Google Scholar
  16. 16.
    Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613MathSciNetCrossRefGoogle Scholar
  17. 17.
    Zou S, Liang Y, Lai L, Shamai S (2015) An information theoretic approach to secret sharing. IEEE Trans Inf Theory 61(6):3121–3136MathSciNetCrossRefGoogle Scholar
  18. 18.
    Huang W, Langberg M, Kliewer J, Bruck J (2016) Communication efficient secret sharing. IEEE Trans Inf Theory 62(12):7195–7206MathSciNetCrossRefGoogle Scholar
  19. 19.
    Killat M, Hartenstein H (2009) An empirical model for probability of packet reception in vehicular ad hoc networks. EURASIP J Wirel Commun Netw 2009(721301):12Google Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2019

Authors and Affiliations

  1. 1.Mechatronics EngineeringMiddle Tennessee State UniversityMurfreesboroUSA
  2. 2.School of Astronautics and AeronauticUniversity of Electronic Science and Technology of ChinaChengduChina

Personalised recommendations