000			03113nam a22003855i 4500
999			_c398436 _d398436
001			398436
003			ES-MaUEC
005			20240420124931.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			230926s2023 sz | fo |||| 0|eng d
020			_a9783031432149
024	7		_a10.1007/978-3-031-43214-9 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .A25 _b2023 EB
100	1		_aNita, Stefania Loredana _eautor _4http://id.loc.gov/vocabulary/relators/aut _9690068
245	1	0	_aAdvances to Homomorphic and Searchable Encryption _cby Stefania Loredana Nita, Marius Iulian Mihailescu
250			_a1st ed 2023
264		1	_aCham _bSpringer Nature Switzerland _c2023
300			_a1 recurso en línea
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_a1. Introduction -- 2. Background and Preliminaries -- 3. Homomorphic Encryption -- 4. Searchable Encryption.
520			_aThis 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.
988			_aSpringer_Computer_2023
650		7	_2embne _9158200 _aSeguridad informática
700	1		_9690011 _aMihailescu, Marius Iulian _eautor
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-43214-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2024 _dz _ean _zSI