OPAC

検索結果一覧に戻る

Perfect Secrecy in IoT : A Hybrid Combinatorial-Boolean Approach / by Behrouz Zolfaghari, Khodakhast Bibak
(Signals and Communication Technology. ISSN:18604870)

データ種別	電子ブック
版	1st ed. 2022.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2022
大きさ	XIII, 115 p. 26 illus., 25 illus. in color : online resource
著者標目	*Zolfaghari, Behrouz author Bibak, Khodakhast author SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0001388	Computer Scinece R0 2005-6,2022-3				9783031131912

書誌詳細を非表示

一般注記	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 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. 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 HTTP:URL=https://doi.org/10.1007/978-3-031-13191-2
件　名	LCSH:Telecommunication LCSH:Cooperating objects (Computer systems) LCSH:Data protection LCSH:Internet of things FREE:Communications Engineering, Networks FREE:Cyber-Physical Systems FREE:Data and Information Security FREE:Internet of Things
分　類	LCC:TK5101-5105.9 DC23:621.382
書誌ID	EB00000776
ISBN	9783031131912