Secure Information Transmission Based on Physical Principles

  • Dima Grigoriev
  • Vladimir Shpilrain
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7956)


We employ physical properties of the real world to design a protocol for secure information transmission where one of the parties is able to transmit secret information to another party over an insecure channel, without any prior secret arrangements between the parties. The distinctive feature of this protocol, compared to all known public-key cryptographic protocols, is that neither party uses a one-way function. In particular, our protocol is secure against (passive) computationally unbounded adversary.


Turing Machine Active Adversary Secret Share Scheme Secret Information Private Space 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bennett, C.H., Brassard, G.: Quantum Cryptography: Public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, p. 175 (1984)Google Scholar
  2. 2.
    Garey, M., Johnson, J.: Computers and Intractability, A Guide to NP-Completeness. W. H. Freeman (1979)Google Scholar
  3. 3.
    Grigoriev, D., Shpilrain, V.: Secrecy without one-way functions. Groups, Complexity, Cryptology 5 (2013)Google Scholar
  4. 4.
    Impagliazzo, R., Luby, M.: One-way functions are essential for information based cryptography. In: Proc. 30th IEEE Sympos. on Found. of Comput. Sci., pp. 230–235. IEEE, New York (1989)Google Scholar
  5. 5.
    Kahrobaei, D., Habeeb, M., Shpilrain, V.: A secret sharing scheme based on group presentations and the word problem. Contemp. Math., Amer. Math. Soc. 582, 143–150 (2012)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Shamir, A.: How to share a secret. Comm. ACM 22, 612–613 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Yao, A.C.: Protocols for secure computations (Extended Abstract). In: 23rd Annual Symposium on Foundations of Computer Science (Chicago, Ill., 1982), pp. 160–164. IEEE, New York (1982)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Dima Grigoriev
    • 1
  • Vladimir Shpilrain
    • 2
  1. 1.CNRS, MathématiquesUniversité de LilleVilleneuve d’AscqFrance
  2. 2.Department of MathematicsThe City College of New YorkNew YorkUSA

Personalised recommendations