000 04413nam a22005775i 4500
001 978-3-031-13191-2
003 DE-He213
005 20240423125044.0
007 cr nn 008mamaa
008 220927s2022 sz | s |||| 0|eng d
020 _a9783031131912
_9978-3-031-13191-2
024 7 _a10.1007/978-3-031-13191-2
_2doi
050 4 _aTK5101-5105.9
072 7 _aTJK
_2bicssc
072 7 _aTEC041000
_2bisacsh
072 7 _aTJK
_2thema
082 0 4 _a621.382
_223
100 1 _aZolfaghari, Behrouz.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aPerfect Secrecy in IoT
_h[electronic resource] :
_bA Hybrid Combinatorial-Boolean Approach /
_cby Behrouz Zolfaghari, Khodakhast Bibak.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIII, 115 p. 26 illus., 25 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSignals and Communication Technology,
_x1860-4870
505 0 _aIntroduction -- 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.
520 _aPerfectly-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. It presents the first scheme for secret-algorithm perfectly-secure cryptography; It provides novel research on modeling perfect secrecy using resilient Boolean functions; It maps resilient Boolean functions to well-studied combinatorial constructs called Latin squares.
650 0 _aTelecommunication.
650 0 _aCooperating objects (Computer systems).
650 0 _aData protection.
650 0 _aInternet of things.
650 1 4 _aCommunications Engineering, Networks.
650 2 4 _aCyber-Physical Systems.
650 2 4 _aData and Information Security.
650 2 4 _aInternet of Things.
700 1 _aBibak, Khodakhast.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031131905
776 0 8 _iPrinted edition:
_z9783031131929
776 0 8 _iPrinted edition:
_z9783031131936
830 0 _aSignals and Communication Technology,
_x1860-4870
856 4 0 _uhttps://doi.org/10.1007/978-3-031-13191-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c173728
_d173728