Private Message Transmission Using Disjoint Paths

  • Hadi Ahmadi
  • Reihaneh Safavi-Naini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8479)


We consider private message transmission (PMT) between two communicants, Alice and Bob, in the presence of an eavesdropper, Eve. Alice and Bob have no shared keys and Eve is computationally unbounded. There is a total of n communicating paths, but not all may be simultaneously accessible to the parties. We let t a , t b , and t e denote the number of paths that are accessible to Alice, Bob and Eve respectively. We allow the parties to change their accessed paths at certain points in time during the PMT protocol. We study perfect (P)-PMT protocol families that guarantee absolute privacy and reliability of message transmission. For the sake of transmission rate improvement, we also investigate asymptotically-perfect (AP)-PMT protocol families that provide negligible error and leakage and behave the same as P-PMT families when message length tends to infinity.

We derive the necessary and sufficient conditions under which P-PMT and AP-PMT are possible and introduce explicit PMT schemes. Our results show AP-PMT protocols attain much higher information rates than P-PMT ones. Interestingly, AP-PMT may be possible even in poor conditions where t a  = t b  = 1 and t e  = n − 1. We study applications of our results to private communication over the real-life scenarios of multiple-frequency links and multiple-route networks. We show practical examples of such scenarios that can be abstracted by the multipath setting: Our results prove the possibility of keyless information-theoretic private message transmission at rates 17% and 20% for the two example scenarios, respectively. We discuss open question and future work.


Disjoint Path Message Transmission Secret Sharing Scheme Connectivity Condition Message Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Winradio ms-8323 multichannel telemetry receiver,
  2. 2.
    Ahmadi, H., Safavi-Naini, R.: Multipath private communication: An information theoretic approach. CoRR, abs/1401.3659 (2014)Google Scholar
  3. 3.
    Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521–536. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23(4), 493–507 (1952)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM (JACM) 40(1), 17–47 (1993)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. Journal of Number Theory 61(2), 248–273 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Leyden, J.: Worried openssl uses nsa-tainted crypto? this bug has got your back (2013),
  8. 8.
    Lichtblau, E., Risen, J.: Spy agency mined vast data trove, officials report. New York Times (2005)Google Scholar
  9. 9.
    Linder, F.: Cisco ios attack and defense the state of the art. Presented at the 25th Chaos Communication Congress (2008)Google Scholar
  10. 10.
    Löhning, M., Fettweis, G.: The effects of aperture jitter and clock jitter in wideband adcs. Computer Standards & Interfaces 29(1), 11–18 (2007)CrossRefGoogle Scholar
  11. 11.
    Patra, A., Choudhury, A., Pandu Rangan, C., Srinathan, K.: Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality. International Journal of Applied Cryptography 2(2), 159–197 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5), 1484–1509 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Strasser, M., Capkun, S., Popper, C., Cagalj, M.: Jamming-resistant key establishment using uncoordinated frequency hopping. In: IEEE Symposium on Security and Privacy (SP), pp. 64–78 (2008)Google Scholar
  15. 15.
    Wood, A.D., Stankovic, J.A.: Denial of service in sensor networks. Computer 35(10), 54–62 (2002)CrossRefGoogle Scholar
  16. 16.
    Ye, Z., Krishnamurthy, S.V., Tripathi, S.K.: A framework for reliable routing in mobile ad hoc networks. In: INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, vol. 1, pp. 270–280. IEEE (2003)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Hadi Ahmadi
    • 1
  • Reihaneh Safavi-Naini
    • 1
  1. 1.Department of Computer ScienceUniversity of CalgaryCanada

Personalised recommendations