000 04445nam a22003855i 4500
001 301880
003 MX-SnUAN
005 20160429155726.0
007 cr nn 008mamaa
008 150903s2010 gw | o |||| 0|eng d
020 _a9783642130137
_99783642130137
024 7 _a10.1007/9783642130137
_2doi
035 _avtls000355033
039 9 _a201509030949
_bVLOAD
_c201405060344
_dVLOAD
_y201402191033
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aTK5105.5-5105.9
100 1 _aNguyen, Phong Q.
_eeditor.
_9337677
245 1 0 _aPublic Key Cryptography – PKC 2010 :
_b13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings /
_cedited by Phong Q. Nguyen, David Pointcheval.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _axiii, 519 páginas 34 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6056
500 _aSpringer eBooks
505 0 _aEncryption I -- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model -- Constant Size Ciphertexts in Threshold Attribute-Based Encryption -- Cryptanalysis -- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem -- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA -- Implicit Factoring with Shared Most Significant and Middle Bits -- Protocols I -- On the Feasibility of Consistent Computations -- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate -- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting -- Network Coding -- Secure Network Coding over the Integers -- Preventing Pollution Attacks in Multi-source Network Coding -- Tools -- Groth–Sahai Proofs Revisited -- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments -- Elliptic Curves -- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions -- Faster Pairing Computations on Curves with High-Degree Twists -- Efficient Arithmetic on Hessian Curves -- Lossy Trapdoor Functions -- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model -- More Constructions of Lossy and Correlation-Secure Trapdoor Functions -- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions -- Protocols II -- Efficient Set Operations in the Presence of Malicious Adversaries -- Text Search Protocols with Simulation Based Security -- Discrete Logarithm -- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ) -- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval -- Encryption II -- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation -- Security of Encryption Schemes in Weakened Random Oracle Models -- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes -- Signatures -- Unlinkability of Sanitizable Signatures -- Confidential Signatures and Deterministic Signcryption -- Identity-Based Aggregate and Multi-Signature Schemes Based on RSA -- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More.
520 _aThis book constitutes the refereed proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010, held in Paris, France, in May 2010. The 29 revised full papers presented were carefully reviewed and selected from 145 submissions. The papers are organized in topical sections on encryption; cryptanalysis; protocols; network coding; tools; elliptic curves; lossy trapdoor functions; discrete logarithm; and signatures.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aPointcheval, David.
_eeditor.
_9330419
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642130120
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-13013-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c301880
_d301880