國立虎尾科技大學 |

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.
面頁冊數:	XIII, 115 p. 26 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Internet of Things. -
電子資源:	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. - 1st ed. 2022. - XIII, 115 p. 26 illus., 25 illus. in color.online resource. - 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:

1048478
Internet of Things.

LC Class. No.: TK5101-5105.9

Dewey Class. No.: 621.382

Perfect Secrecy in IoT = A Hybrid Combinatorial-Boolean Approach /
LDR:03727nam a22004095i 4500 001 1083647
003 DE-He213
005 20220927133901.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031131912 $9 978-3-031-13191-2
024 7 $a 10.1007/978-3-031-13191-2 $2 doi
035 $a 978-3-031-13191-2
050 4 $a TK5101-5105.9
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
072 7 $a TJK $2 thema
082 0 4 $a 621.382 $2 23
100 1 $a Zolfaghari, Behrouz. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389712
245 1 0 $a Perfect Secrecy in IoT $h [electronic resource] : $b A Hybrid Combinatorial-Boolean Approach / $c by Behrouz Zolfaghari, Khodakhast Bibak.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIII, 115 p. 26 illus., 25 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 2 4 $a Internet of Things. $3 1048478
650 2 4 $a Data and Information Security. $3 1365785
650 2 4 $a Cyber-Physical Systems. $3 1387591
650 1 4 $a Communications Engineering, Networks. $3 669809
650 0 $a Internet of things. $3 1023130
650 0 $a Data protection. $3 557764
650 0 $a Cooperating objects (Computer systems). $3 1387590
650 0 $a Telecommunication. $3 568341
700 1 $a Bibak, Khodakhast. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389713
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031131905
776 0 8 $i Printed edition: $z 9783031131929
776 0 8 $i Printed edition: $z 9783031131936
830 0 $a Signals and Communication Technology, $x 1860-4862 $3 1254245
856 4 0 $u https://doi.org/10.1007/978-3-031-13191-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)