東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances to homomorphic and searchab...

Nita, Stefania Loredana.

FindBook

Google Book

Amazon

博客來

Advances to homomorphic and searchable encryption

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances to homomorphic and searchable encryption/ by Stefania Loredana Nita, Marius Iulian Mihailescu.
作者:	Nita, Stefania Loredana.
其他作者:	Mihailescu, Marius Iulian.
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	xii, 136 p. :ill. (some col.), digital ;24 cm.
內容註:	1. Introduction -- 2. Background and Preliminaries -- 3. Homomorphic Encryption -- 4. Searchable Encryption.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) -
電子資源:	https://doi.org/10.1007/978-3-031-43214-9
ISBN:	9783031432149

Advances to homomorphic and searchable encryption
Nita, Stefania Loredana.

Advances to homomorphic and searchable encryption[electronic resource] /by Stefania Loredana Nita, Marius Iulian Mihailescu. - Cham :Springer Nature Switzerland :2023. - xii, 136 p. :ill. (some col.), digital ;24 cm.

1. Introduction -- 2. Background and Preliminaries -- 3. Homomorphic Encryption -- 4. Searchable Encryption.

This book presents the current state of the literature on the fields of homomorphic and searchable encryption, from both theoretical and practical points of view. Homomorphic and searchable encryption are still relatively novel and rapidly evolving areas and face practical constraints in the contexts of large-scale cloud computing and big data. Both encryption methods can be quantum-resistant if they use the right mathematical techniques. In fact, many fully homomorphic encryption schemes already use quantum-resistant techniques, such as lattices or characteristics of polynomials - which is what motivated the authors to present them in detail. On the one hand, the book highlights the characteristics of each type of encryption, including methods, security elements, security requirements, and the main types of attacks that can occur. On the other, it includes practical cases and addresses aspects like performance, limitations, etc. As cloud computing and big data already represent the future in terms of storing, managing, analyzing, and processing data, these processes need to be made as secure as possible, and homomorphic and searchable encryption hold huge potential to secure both the data involved and the processes through which it passes. This book is intended for graduates, professionals and researchers alike. Homomorphic and searchable encryption involve advanced mathematical techniques; accordingly, readers should have a basic background in number theory, abstract algebra, lattice theory, and polynomial algebra.

ISBN: 9783031432149

Standard No.: 10.1007/978-3-031-43214-9doiSubjects--Topical Terms:

579162
Data encryption (Computer science)

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.824

Advances to homomorphic and searchable encryption
LDR:02712nmm a2200349 a 4500 001 2334478
003 DE-He213
005 20230926102922.0
006 m d
007 cr nn 008maaau
008 240402s2023 sz s 0 eng d
020 $a 9783031432149 $q (electronic bk.)
020 $a 9783031432132 $q (paper)
024 7 $a 10.1007/978-3-031-43214-9 $2 doi
035 $a 978-3-031-43214-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25
072 7 $a UR $2 bicssc
072 7 $a UTN $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a UR $2 thema
072 7 $a UTN $2 thema
082 0 4 $a 005.824 $2 23
090 $a QA76.9.A25 $b N728 2023
100 1 $a Nita, Stefania Loredana. $3 3259304
245 1 0 $a Advances to homomorphic and searchable encryption $h [electronic resource] / $c by Stefania Loredana Nita, Marius Iulian Mihailescu.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xii, 136 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a 1. Introduction -- 2. Background and Preliminaries -- 3. Homomorphic Encryption -- 4. Searchable Encryption.
520 $a This book presents the current state of the literature on the fields of homomorphic and searchable encryption, from both theoretical and practical points of view. Homomorphic and searchable encryption are still relatively novel and rapidly evolving areas and face practical constraints in the contexts of large-scale cloud computing and big data. Both encryption methods can be quantum-resistant if they use the right mathematical techniques. In fact, many fully homomorphic encryption schemes already use quantum-resistant techniques, such as lattices or characteristics of polynomials - which is what motivated the authors to present them in detail. On the one hand, the book highlights the characteristics of each type of encryption, including methods, security elements, security requirements, and the main types of attacks that can occur. On the other, it includes practical cases and addresses aspects like performance, limitations, etc. As cloud computing and big data already represent the future in terms of storing, managing, analyzing, and processing data, these processes need to be made as secure as possible, and homomorphic and searchable encryption hold huge potential to secure both the data involved and the processes through which it passes. This book is intended for graduates, professionals and researchers alike. Homomorphic and searchable encryption involve advanced mathematical techniques; accordingly, readers should have a basic background in number theory, abstract algebra, lattice theory, and polynomial algebra.
650 0 $a Data encryption (Computer science) $3 579162
650 1 4 $a Data and Information Security. $3 3538510
650 2 4 $a Quantum Communications and Cryptography. $3 3595689
650 2 4 $a Data Science. $3 3538937
650 2 4 $a Cryptology. $3 3382308
650 2 4 $a Security Science and Technology. $3 1531662
700 1 $a Mihailescu, Marius Iulian. $3 3488196
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-031-43214-9
950 $a Computer Science (SpringerNature-11645)