Perfect Secrecy in IoT
Springer International Publishing (Verlag)
978-3-031-13190-5 (ISBN)
Perfectly-secure cryptography is a branch of information-theoretic cryptography. A perfectly-secure cryptosystem guarantees that the malicious third party cannot guess anything regarding the plain text or the key, even in the case of full access to the cipher text. Despite this advantage, there are only a few real-world implementations of perfect secrecy due to some well-known limitations. Any simple, straightforward modeling can pave the way for further advancements in the implementation, especially in environments with time and resource constraints such as IoT. This book takes one step towards this goal via presenting a hybrid combinatorial-Boolean model for perfectly-secure cryptography in IoT.
In this book, we first present an introduction to information-theoretic cryptography as well as perfect secrecy and its real-world implementations. Then we take a systematic approach to highlight information-theoretic cryptography as a convergence point for existing trends in research on cryptography in IoT. Then we investigate combinatorial and Boolean cryptography and show how they are seen almost everywhere in the ecosystem and the life cycle of information-theoretic IoT cryptography. We finally model perfect secrecy in IoT using Boolean functions, and map the Boolean functions to simple, well-studied combinatorial designs like Latin squares.
This book is organized in two parts. The first part studies information-theoretic cryptography and the promise it holds for cryptography in IoT. The second part separately discusses combinatorial and Boolean cryptography, and then presents the hybrid combinatorial-Boolean model for perfect secrecy in IoT.
Behrouz Zolfaghari has received his Ph.D in Computer Engineering from Amirkabir University, Tehran, Iran. He has done a postdoc at IIT (Indian Institute of Technology) Guwahati, India.He is currently doing another postdoc in the University of Guelph, Canada. His research areas includes VLSI Design, High-Performance Computing, Information-Theoretic Cryptography,Hardware-Oriented Cryptography, AI-assisted Cryptographyand Secure AI.Khodakhast Bibak is an Assistant Professor at the Department of Computer Science and Software Engineering at Miami University. Previously, he was a Postdoctoral Research Associate (September 2017 - August 2018) in the Coordinated Science Laboratory at the University of Illinois at Urbana-Champaign. Before this, Khodakhast was a Postdoctoral Research Fellow (May-August 2017) at the Department of Computer Science, University of Victoria, from where he also received his PhD (April 2017). He earned a Master of Mathematics degree (April 2013) at the Department of Combinatorics and Optimization, University of Waterloo, where he was also a member of the Centre for Applied Cryptographic Research (CACR). Khodakhast's research interests are Cybersecurity, Applied Cryptography, Quantum Information Science (QIS), Artificial Intelligence, and the related areas.
Introduction.- A Review on Perfect Secrecy.- Perfect Secrecy and Boolean Functions with Applications in Resource-Constrained IoT Environments.- Cryptography in IoT.- Resilient functions.- Modeling a General Cryptographic Algorithm.- Latin Squares and Cryptography.- Perfectly-Secure Encryption Modeled Using Latin Squares.- Conclusion.
| Erscheinungsdatum | 29.09.2022 |
|---|---|
| Reihe/Serie | Signals and Communication Technology |
| Zusatzinfo | XIII, 115 p. 26 illus., 25 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 367 g |
| Themenwelt | Informatik ► Netzwerke ► Sicherheit / Firewall |
| Technik ► Elektrotechnik / Energietechnik | |
| Technik ► Nachrichtentechnik | |
| Schlagworte | Boolean functions • Cryptographic Boolean Functions • information-theoretic cryptography • Perfectly-Secure Cryptography • perfect secrecy |
| ISBN-10 | 3-031-13190-8 / 3031131908 |
| ISBN-13 | 978-3-031-13190-5 / 9783031131905 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
