000			03887nam a22003855i 4500
001			394059
003			ES-MaUEC
005			20230102123050.0
007			cr nn 008mamaa
008			220927s2022 sz | s |||| 0|eng d
020			_a9783031131912
024	7		_a10.1007/978-3-031-13191-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC
100	1		_aZolfaghari, Behrouz _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut
245	1	0	_aPerfect Secrecy in IoT _bA Hybrid Combinatorial-Boolean Approach _cby Behrouz Zolfaghari, Khodakhast Bibak
250			_a1st edition 2022
264		1	_aCham _bSpringer International Publishing _c2022
300			_a1 recurso en línea (XIII, 115 páginas) _b26 ilustraciones, 25 ilustraciones a color
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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.
700	1		_aBibak, Khodakhast _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut
776	0	8	_iPrinted edition: _z9783031131905
776	0	8	_iPrinted edition: _z9783031131929
776	0	8	_iPrinted edition: _z9783031131936
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-13191-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
988			_aSpringer_Computer_2022
999			_c394059 _d394059