東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Perfect secrecy in IoT = a hybrid co...

Zolfaghari, Behrouz.

FindBook

Google Book

Amazon

博客來

Perfect secrecy in IoT = a hybrid combinatorial-boolean approach /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Perfect secrecy in IoT/ by Behrouz Zolfaghari, Khodakhast Bibak.
其他題名:	a hybrid combinatorial-boolean approach /
作者:	Zolfaghari, Behrouz.
其他作者:	Bibak, Khodakhast.
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xiii, 115 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Internet of things - Security measures. -
電子資源:	https://doi.org/10.1007/978-3-031-13191-2
ISBN:	9783031131912

Perfect secrecy in IoT = a hybrid combinatorial-boolean approach /
Zolfaghari, Behrouz.

Perfect secrecy in IoTa hybrid combinatorial-boolean approach /[electronic resource] :by Behrouz Zolfaghari, Khodakhast Bibak. - Cham :Springer International Publishing :2022. - xiii, 115 p. :ill., digital ;24 cm. - Signals and communication technology,1860-4870. - Signals and communication technology..

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.

ISBN: 9783031131912

Standard No.: 10.1007/978-3-031-13191-2doiSubjects--Topical Terms:

3217048
Internet of things
--Security measures.

LC Class. No.: TK5105.8857 / .Z65 2022

Dewey Class. No.: 004.678

Perfect secrecy in IoT = a hybrid combinatorial-boolean approach /
LDR:03360nmm a2200337 a 4500 001 2303891
003 DE-He213
005 20220927133901.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031131912 $q (electronic bk.)
020 $a 9783031131905 $q (paper)
024 7 $a 10.1007/978-3-031-13191-2 $2 doi
035 $a 978-3-031-13191-2
040 $a GP $c GP
041 0 $a eng
050 4 $a TK5105.8857 $b .Z65 2022
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
072 7 $a TJK $2 thema
082 0 4 $a 004.678 $2 23
090 $a TK5105.8857 $b .Z86 2022
100 1 $a Zolfaghari, Behrouz. $3 3605579
245 1 0 $a Perfect secrecy in IoT $h [electronic resource] : $b a hybrid combinatorial-boolean approach / $c by Behrouz Zolfaghari, Khodakhast Bibak.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xiii, 115 p. : $b ill., digital ; $c 24 cm.
490 1 $a Signals and communication technology, $x 1860-4870
505 0 $a 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.
520 $a 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.
650 0 $a Internet of things $x Security measures. $3 3217048
650 1 4 $a Communications Engineering, Networks. $3 891094
650 2 4 $a Cyber-Physical Systems. $3 3591993
650 2 4 $a Data and Information Security. $3 3538510
650 2 4 $a Internet of Things. $3 3538511
700 1 $a Bibak, Khodakhast. $3 3605580
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Signals and communication technology. $3 1565543
856 4 0 $u https://doi.org/10.1007/978-3-031-13191-2
950 $a Computer Science (SpringerNature-11645)