TEST - Catálogo BURRF
   

Information theoretic security : 8th international conference, icits 2015, lugano, switzerland, may 2-5, 2015. Proceedings / edited by Anja Lehmann, Stefan Wolf.

Colaborador(es): Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 9063Editor: Cham : Springer International Publishing : Springer, 2015Descripción: xiv, 297 páginas : 29 ilustracionesTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783319174709
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA76.9.A25
Recursos en línea:
Contenidos:
Practical Sharing of Quantum Secrets over Untrusted Channels -- Generalizing Efficient Multiparty Computation -- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity -- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits -- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy -- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation -- Metric Pseudoentropy: Characterizations, Transformations and Applications -- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy -- Gambling, Computational Information and Encryption Security -- Query-Complexity Amplification for Random Oracles -- The Chaining Lemma and Its Application -- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens -- Limited View Adversary Codes: Bounds, Constructions and Applications -- Locally Decodable Codes for Edit Distance -- The Multivariate Hidden Number Problem -- Lattice Point Enumeration on Block Reduced Bases -- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

Practical Sharing of Quantum Secrets over Untrusted Channels -- Generalizing Efficient Multiparty Computation -- Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity -- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits -- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy -- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation -- Metric Pseudoentropy: Characterizations, Transformations and Applications -- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy -- Gambling, Computational Information and Encryption Security -- Query-Complexity Amplification for Random Oracles -- The Chaining Lemma and Its Application -- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens -- Limited View Adversary Codes: Bounds, Constructions and Applications -- Locally Decodable Codes for Edit Distance -- The Multivariate Hidden Number Problem -- Lattice Point Enumeration on Block Reduced Bases -- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

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