TEST - Catálogo BURRF
   

Advances in Cryptology – CRYPTO 2012 : (Registro nro. 305137)

Detalles MARC
000 -CABECERA
campo de control de longitud fija 09658nam a22003855i 4500
001 - NÚMERO DE CONTROL
campo de control 305137
003 - IDENTIFICADOR DEL NÚMERO DE CONTROL
campo de control MX-SnUAN
005 - FECHA Y HORA DE LA ÚLTIMA TRANSACCIÓN
campo de control 20160429155937.0
007 - CAMPO FIJO DE DESCRIPCIÓN FÍSICA--INFORMACIÓN GENERAL
campo de control de longitud fija cr nn 008mamaa
008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL
campo de control de longitud fija 150903s2012 gw | o |||| 0|eng d
020 ## - NÚMERO INTERNACIONAL ESTÁNDAR DEL LIBRO
Número Internacional Estándar del Libro 9783642320095
-- 9783642320095
024 7# - IDENTIFICADOR DE OTROS ESTÁNDARES
Número estándar o código 10.1007/9783642320095
Fuente del número o código doi
035 ## - NÚMERO DE CONTROL DEL SISTEMA
Número de control de sistema vtls000359827
039 #9 - NIVEL DE CONTROL BIBLIOGRÁFICO Y DETALLES DE CODIFICACIÓN [OBSOLETO]
Nivel de reglas en descripción bibliográfica 201509030616
Nivel de esfuerzo utilizado para asignar no-encabezamientos de materia en puntos de acceso VLOAD
Nivel de esfuerzo utilizado en la asignación de encabezamientos de materia 201405070250
Nivel de esfuerzo utilizado para asignar clasificación VLOAD
-- 201402201419
-- staff
040 ## - FUENTE DE LA CATALOGACIÓN
Centro catalogador/agencia de origen MX-SnUAN
Lengua de catalogación spa
Centro/agencia transcriptor MX-SnUAN
Normas de descripción rda
050 #4 - CLASIFICACIÓN DE LA BIBLIOTECA DEL CONGRESO
Número de clasificación QA76.9.A25
100 1# - ENTRADA PRINCIPAL--NOMBRE DE PERSONA
Nombre de persona Safavi-Naini, Reihaneh.
Término indicativo de función/relación editor.
9 (RLIN) 330550
245 10 - MENCIÓN DE TÍTULO
Título Advances in Cryptology – CRYPTO 2012 :
Resto del título 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings /
Mención de responsabilidad, etc. edited by Reihaneh Safavi-Naini, Ran Canetti.
264 #1 - PRODUCCIÓN, PUBLICACIÓN, DISTRIBUCIÓN, FABRICACIÓN Y COPYRIGHT
Producción, publicación, distribución, fabricación y copyright Berlin, Heidelberg :
Nombre del de productor, editor, distribuidor, fabricante Springer Berlin Heidelberg :
-- Imprint: Springer,
Fecha de producción, publicación, distribución, fabricación o copyright 2012.
300 ## - DESCRIPCIÓN FÍSICA
Extensión xv, 888 páginas 103 ilustraciones
Otras características físicas recurso en línea.
336 ## - TIPO DE CONTENIDO
Término de tipo de contenido texto
Código de tipo de contenido txt
Fuente rdacontent
337 ## - TIPO DE MEDIO
Nombre/término del tipo de medio computadora
Código del tipo de medio c
Fuente rdamedia
338 ## - TIPO DE SOPORTE
Nombre/término del tipo de soporte recurso en línea
Código del tipo de soporte cr
Fuente rdacarrier
347 ## - CARACTERÍSTICAS DEL ARCHIVO DIGITAL
Tipo de archivo archivo de texto
Formato de codificación PDF
Fuente rda
490 0# - MENCIÓN DE SERIE
Mención de serie Lecture Notes in Computer Science,
Número Internacional Normalizado para Publicaciones Seriadas 0302-9743 ;
Designación de volumen o secuencia 7417
500 ## - NOTA GENERAL
Nota general Springer eBooks
505 0# - NOTA DE CONTENIDO CON FORMATO
Nota de contenido con formato Symmetric Cryptosystems -- An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.-  Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.-  Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.
520 ## - SUMARIO, ETC.
Sumario, etc. This book constitutes the refereed proceedings of the 32nd Annual International Cryptology Conference, CRYPTO 2012, held in Santa Barbara, CA, USA, in August 2012. The 48 revised full papers presented were carefully reviewed and selected from 225 submissions. The volume also contains the abstracts of two invited talks. The papers are organized in topical sections on symmetric cryptosystems, secure computation, attribute-based and functional encryption, proofs systems, protocols, hash functions, composable security, privacy, leakage and side-channels, signatures, implementation analysis, black-box separation, cryptanalysis, quantum cryptography, and key encapsulation and one-way functions.
590 ## - NOTA LOCAL (RLIN)
Nota local Para consulta fuera de la UANL se requiere clave de acceso remoto.
700 1# - PUNTO DE ACCESO ADICIONAL--NOMBRE DE PERSONA
Nombre de persona Canetti, Ran.
Término indicativo de función/relación editor.
9 (RLIN) 334477
710 2# - PUNTO DE ACCESO ADICIONAL--NOMBRE DE ENTIDAD CORPORATIVA
Nombre de entidad corporativa o nombre de jurisdicción como elemento de entrada SpringerLink (Servicio en línea)
9 (RLIN) 299170
776 08 - ENTRADA/ENLACE A UN FORMATO FÍSICO ADICIONAL
Información de relación/Frase instructiva de referencia Edición impresa:
Número Internacional Estándar del Libro 9783642320088
856 40 - LOCALIZACIÓN Y ACCESO ELECTRÓNICOS
Identificador Uniforme del Recurso <a href="http://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-32009-5">http://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-32009-5</a>
Nota pública Conectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 ## - ELEMENTOS DE PUNTO DE ACCESO ADICIONAL (KOHA)
Tipo de ítem Koha Recurso en línea

No hay ítems disponibles.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha