Theory of Cryptography [electronic resource] : Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings / edited by Shai Halevi, Tal Rabin.

Por: Halevi, Shai [editor.]Colaborador(es): Rabin, Tal [editor.]Tipo de material: TextoTextoSeries Lecture Notes in Computer Science, 3876Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Descripción: XII, 620 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540327325Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Operating systems (Computers) | Data encryption (Computer science) | Computer software | Computational complexity | Information Systems | Computer Science | Data Encryption | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Operating Systems | Management of Computing and Information Systems | Computers and SocietyFormatos físicos adicionales: Sin títuloClasificación CDD: 005.82 Clasificación LoC: Libro electrónicoRecursos en línea: de clik aquí para ver el libro electrónico
Contenidos:
Springer eBooks
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Zero-Knowledge -- Concurrent Zero Knowledge Without Complexity Assumptions -- Interactive Zero-Knowledge with Restricted Random Oracles -- Non-interactive Zero-Knowledge from Homomorphic Encryption -- Primitives -- Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles -- Efficient Blind and Partially Blind Signatures Without Random Oracles -- Key Exchange Using Passwords and Long Keys -- Mercurial Commitments: Minimal Assumptions and Efficient Constructions -- Assumptions and Models -- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices -- On Error Correction in the Exponent -- On the Relation Between the Ideal Cipher and the Random Oracle Models -- The Bounded-Retrieval Model -- Intrusion-Resilience Via the Bounded-Storage Model -- Perfectly Secure Password Protocols in the Bounded Retrieval Model -- Privacy -- Polylogarithmic Private Approximations and Efficient Matching -- Calibrating Noise to Sensitivity in Private Data Analysis -- Secret Sharing and Multi-party Computation (I) -- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation -- Efficient Multi-party Computation with Dispute Control -- Round-Optimal and Efficient Verifiable Secret Sharing -- Universally-Composible Security -- Generalized Environmental Security from Number Theoretic Assumptions -- Games and the Impossibility of Realizable Ideal Functionality -- Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols -- Resource Fairness and Composability of Cryptographic Protocols -- One-Way Functions and Friends -- Finding Pessiland -- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness -- On the Complexity of Parallel Hardness Amplification for One-Way Functions -- Secret Sharing and Multi-party Computation (II) -- On Matroids and Non-ideal Secret Sharing -- Secure Computation with Partial Message Loss -- Communication Efficient Secure Linear Algebra -- Threshold and Proactive Pseudo-Random Permutations -- Pseudo-Random Functions and Encryption -- PRF Domain Extension Using DAGs -- Chosen-Ciphertext Security from Tag-Based Encryption -- Separating Sources for Encryption and Secret Sharing.

ZDB-2-SCS

ZDB-2-LNC

No hay comentarios en este titulo.

para colocar un comentario.