000			03917nam a22004215i 4500
999			_c368288 _d368288 _x1
001			368288
003			ES-MaUEC
005			20240201134308.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220226s2022 sz | s |||| 0|eng d
020			_a9783030971212
024	7		_a10.1007/978-3-030-97121-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .A25 _b2022 EB
245	0	0	_aPublic-Key Cryptography - PKC 2022 : _b25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I _cedited by Goichiro Hanaoka, Junji Shikata, Yohei Watanabe
250			_aFirst edition 2022
264		1	_aCham _bSpringer International Publising _c2022
300			_a1 recurso en línea (XIV, 648 páginas) _b58 ilustraciones, 26 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aSecurity and Cryptology _v13177
505	0		_aCryptanalysis -- Multitarget decryption failure attacks and their application to Saber and Kyber -- Post-quantum Security of Plain OAEP Transform -- On the security of OSIDH -- Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes -- Syndrome Decoding Estimator -- On the Isogeny Problem with Torsion Point Information -- MPC and Secret Sharing -- Reusable Two-Round MPC from LPN -- On the Bottleneck Complexity of MPC with Correlated Randomness -- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN -- Fast Batched DPSS and its Applications -- CNF-FSS and its Applications -- Cryptographic Protocols -- Effcient Verifiable Partially-Decryptable Commitments from Lattices and Applications -- Making Private Function Evaluation Safer, Faster, and Simpler -- Two-Round Oblivious Linear Evaluation from Learning with Errors -- Improved Constructions of Anonymous Credentials From StructurePreserving Signatures on Equivalence Classes -- Traceable PRFs: Full Collusion Resistance and Active Security -- Tools -- Radical Isogenies on Montgomery Curves -- Towards a Simpler Lattice Gadget Toolkit -- SNARKs and NIZKs -- Polynomial IOPs for Linear Algebra Relations -- A Unified Framework for Non-Universal SNARKs -- ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines -- Rational Modular Encoding in the DCR Setting: Non-Interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model.
520			_aThe two-volume proceedings set LNCS 13177 and 13178 constitutes the proceedings of the 25th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2022, which took place virtually during March 7-11, 2022. The conference was originally planned to take place in Yokohama, Japan, but had to change to an online format due to the COVID-19 pandemic. The 40 papers included in these proceedings were carefully reviewed and selected from 137 submissions. They focus on all aspects of public-key cryptography, covering cryptanalysis; MPC and secret sharing; cryptographic protocols; tools; SNARKs and NIZKs; key exchange; theory; encryption; and signatures.
988			_aSpringer_Computer_2022
650		7	_2embne _9158201 _aCriptografía (Informática) _vCongresos y asambleas
700	1		_aHanaoka, Goichiro _eeditor literario
700	1		_aShikata, Junji _eeditor literario
700	1		_aWatanabe, Yohei _eeditor literario
773	0		_tSpringer Nature eBook
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-97121-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE _n0
998			_b03/2022 _dz _eu _zSI