Advances in Cryptology - CRYPTO 2008: 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008, Proceedings (Lecture Notes in Computer Science, 5157, Band 5157) - edizione con copertina flessibile

EAN (ISBN-13): 9783540851738
ISBN (ISBN-10): 3540851739
Copertina flessibile
Anno di pubblicazione: 2008
Editore: Wagner, David, Springer
594 Pagine
Peso: 0,921 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2008-10-22T18:13:44+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2023-12-13T14:05:13+01:00 (Zurich)
ISBN/EAN: 3540851739

ISBN - Stili di scrittura alternativi:
3-540-85173-9, 978-3-540-85173-8
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : david wagner
Titolo del libro: santa barbara, usa 2008, international conference computer science, advances cryptology proceedings crypto, august santa

---

Dati dell'editore

Autore: David Wagner
Titolo: Security and Cryptology; Lecture Notes in Computer Science; Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008, Proceedings
Editore: Springer; Springer Berlin
594 Pagine
Anno di pubblicazione: 2008-07-30
Berlin; Heidelberg; DE
Lingua: Inglese
77,04 € (DE)
79,20 € (AT)
103,70 CHF (CH)
Contact supplier
XIV, 594 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Kodierungstheorie und Verschlüsselung (Kryptologie); Verstehen; Informatik; algebraic geometry; algorithms; authentication; broadcast encryption; calculus; collision resistance; communication; communication complexity; complexity; complexity analysis; cryptographic protocols; cryptography; data encryption; privacy; security; Cryptology; IT Operations; Computer Communication Networks; Data and Information Security; Computers and Society; Discrete Mathematics in Computer Science; Kryptografie, Verschlüsselungstechnologie; Wirtschaftsmathematik und -informatik, IT-Management; Netzwerk-Hardware; Computersicherheit; Netzwerksicherheit; Digital- und Informationstechnologien: soziale und ethische Aspekte; Mathematik für Informatiker; Diskrete Mathematik; EA

Random Oracles.- The Random Oracle Model and the Ideal Cipher Model Are Equivalent.- Programmable Hash Functions and Their Applications.- Applications.- One-Time Programs.- Adaptive One-Way Functions and Applications.- Public-Key Crypto I.- Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys.- Improved Bounds on Security Reductions for Discrete Log Based Signatures.- Circular-Secure Encryption from Decision Diffie-Hellman.- Public-Key Locally-Decodable Codes.- Hash Functions I.- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms.- Cryptanalysis of the GOST Hash Function.- Preimages for Reduced SHA-0 and SHA-1.- Cryptanalysis I.- On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme.- Bug Attacks.- Multiparty Computation I.- Scalable Multiparty Computation with Nearly Optimal Work and Resilience.- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations.- Cryptanalysis II.- Cryptanalysis of MinRank.- New State Recovery Attack on RC4.- Public-Key Crypto II.- Dynamic Threshold Public-Key Encryption.- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles.- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles.- Communication Complexity in Algebraic Two-Party Protocols.- Hash Functions II.- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions.- Compression from Collisions, or Why CRHF Combiners Have a Long Output.- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers.- Distributed Private Data Analysis: Simultaneously Solving How and What.- New Efficient Attacks on Statistical Disclosure Control Mechanisms.- MultipartyComputation II.- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.- Collusion-Free Protocols in the Mediated Model.- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs.- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems.- A Framework for Efficient and Composable Oblivious Transfer.- Founding Cryptography on Oblivious Transfer – Efficiently.