000			02815nam a22003975i 4500
999			_c361574 _d361574 _x1
001			361574
003			ES-MaUEC
005			20230102121411.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210929s2021 sz | s |||| 0|eng d
020			_a9783030876296
024	7		_a10.1007/978-3-030-87629-6 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .A25 _b2021 EB
100	1		_aKoç, Çetin Kaya _9682250
245	1	0	_aPartially Homomorphic Encryption _cby Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger
250			_aFirst edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (X, 146 páginas)
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
505	0		_aIntroduction -- Mathematical Background -- Rivest-Shamir-Adleman Algorithm -- Goldwasser-Micali Algorithm -- ElGamal Algorithm -- Benaloh Algorithm -- Naccache-Stern Algorithm -- Okamoto-Uchiyama Algorithm -- Paillier Algorithm -- Damgård-Jurik Algorithm -- Boneh-Goh-Nissim Algorithm -- Sander-Young-Yung Algorithm -- Bibliography -- Index.
520	3		_aThis monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung. Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead. The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.
988			_aSpringer_Computer_2021
650		7	_2embne _aCriptografía (Informática) _9158201
700	1		_aÖzdemir, Funda _eautor
700	1		_aÖdemiş Özger, Zeynep _eautor
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-87629-6 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2022 _dz _eu _zSI