Skip to main content
SpringerLink
Log in

On the Undecidability of the Panopticon Detection Problem

  • Conference paper
  • First Online:
Cyber Security, Cryptology, and Machine Learning (CSCML 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13301))

  • 883 Accesses

Abstract

In this paper we provide a theoretical framework for studying the detectability status of Panopticons based on two theoretical definitions. We show, using Oracle Turing Machines, that detecting modern day, ICT-based, Panopticons is an undecidable problem.

The Research of P.E. Nastou has been co-financed by the European Regional Development Fund of the European Union and Greek national funds through the Operational Program Competitiveness, Entrepreneurship and Innovation, under the call RESEARCH - CREATE - INNOVATE (project code:T2EDK-01862). The work of the first, third and fourth coauthors was partially supported by the CyberSec4Europe project, funded by the European Union under the H2020 Programme Grant Agreement No. 830929.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bentham, J.: Panopticon or The Inspection House. Written as a Series of Letters in 1787

    Google Scholar 

  2. Cohen, F.: Computer viruses. Ph.D. thesis, University of Southern California (1985)

    Google Scholar 

  3. Cohen, F.: Computer viruses: theory and experiments. Comput. Secur. 6(1), 22–35 (1987)

    Article  Google Scholar 

  4. Foucault, M.: Discipline and Punish: The Birth of the Prison. Random House, New York (1977)

    Google Scholar 

  5. Hartmanis, J., Hopcroft, J.E.: Structure of undecidable problems in automata theory. In: Proceedings of 9th Annual IEEE Symposium on Switching and Automata Theory (SWAT 1968), pp. 327–333 (1968)

    Google Scholar 

  6. Hopcroft, J., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley series in Computer Science (1979)

    Google Scholar 

  7. Kleene, S.C., Post, E.L.: The upper semi-lattice of degrees of recursive unsolvability. Ann. Math. 59, 379–407 (1954)

    Article  MathSciNet  Google Scholar 

  8. A.M. Turing: On Computable Numbers, with an Application to the Entscheidungs problem. Proc. London Math. Soc. 2, 230–265 (1936–1937)

    Google Scholar 

  9. Turing, A.M.: Systems of logic based on ordinals. Proc. London Math. Soc. 45(Part 3), 161–228 (1939)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute and Press - “Diophantus”, University of Patras Campus, 26504, Patras, Greece

    Vasiliki Liagkou & Yannis C. Stamatiou

  2. Department of Computer Science, University of Liverpool, Liverpool, UK

    Paul Spirakis

  3. Computer Engineering and Informatics Department, University of Patras, 26504, Patras, Greece

    Paul Spirakis

  4. Department of Business Administration, University of Patras, 26504, Patras, Greece

    Yannis C. Stamatiou

  5. Department of Informatics and Telecommunications, University of Ioannina, 47100, Kostakioi, Arta, Greece

    Vasiliki Liagkou

  6. Department of Mathematics, Applied Mathematics and Mathematical Modeling Laboratory, University of the Aegean, Samos, Greece

    Panagiotis E. Nastou

  7. Center for Applied Optimization, University of Florida, Gainesville, USA

    Panagiotis E. Nastou

Authors
  1. Vasiliki Liagkou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panagiotis E. Nastou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannis C. Stamatiou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yannis C. Stamatiou .

Editor information

Editors and Affiliations

  1. Ben-Gurion University of the Negev, Be’er Sheva, Israel

    Shlomi Dolev

  2. University of Maryland, College Park, MD, USA

    Jonathan Katz

  3. Ben-Gurion University of the Negev, Be’er Sheva, Israel

    Amnon Meisels

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liagkou, V., Nastou, P.E., Spirakis, P., Stamatiou, Y.C. (2022). On the Undecidability of the Panopticon Detection Problem. In: Dolev, S., Katz, J., Meisels, A. (eds) Cyber Security, Cryptology, and Machine Learning. CSCML 2022. Lecture Notes in Computer Science, vol 13301. Springer, Cham. https://doi.org/10.1007/978-3-031-07689-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-07689-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-07688-6

  • Online ISBN: 978-3-031-07689-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation