Advances in Cryptology - CRYPTO 2007 : 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings - pocketboek

EAN (ISBN-13): 9783540741428
ISBN (ISBN-10): 3540741429
Gebonden uitgave
pocket book
Verschijningsjaar: 2007
Uitgever: Springer Berlin Heidelberg
630 Bladzijden
Gewicht: 0,906 kg
Taal: eng/Englisch

Boek bevindt zich in het datenbestand sinds 2007-10-25T21:30:30+02:00 (Amsterdam)
Detailpagina laatst gewijzigd op 2024-02-22T18:55:26+01:00 (Amsterdam)
ISBN/EAN: 3540741429

ISBN - alternatieve schrijfwijzen:
3-540-74142-9, 978-3-540-74142-8
alternatieve schrijfwijzen en verwante zoekwoorden:
Auteur van het boek: menezes, alf, ham alfred, mene
Titel van het boek: annual, computer notes, santa, berlin, barbara, international conference computer science, advances cryptology, conference proceedings, usa, les crypto, advances computer security, august

---

Gegevens van de uitgever

Auteur: Alfred Menezes
Titel: Lecture Notes in Computer Science; Security and Cryptology; Advances in Cryptology - CRYPTO 2007 - 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings
Uitgeverij: Springer; Springer Berlin
634 Bladzijden
Verschijningsjaar: 2007-08-23
Berlin; Heidelberg; DE
Taal: Engels
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIV, 634 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Kodierungstheorie und Verschlüsselung (Kryptologie); Verstehen; Mathematik; Information; RSA; algebraic geometry; algorithms; authentication; broadcast encryption; calculus; collision resistance; complexity analysis; cryptography; cryptology; data security; database security; digital signatures; 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

Cryptanalysis I.- Practical Cryptanalysis of SFLASH.- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5.- Secure Searching.- How Should We Solve Search Problems Privately?.- Public Key Encryption That Allows PIR Queries.- Invited Talk.- Information Security Economics – and Beyond.- Theory I.- Cryptography with Constant Input Locality.- Universally-Composable Two-Party Computation in Two Rounds.- Indistinguishability Amplification.- Lattices.- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU.- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm.- Random Oracles.- Domain Extension of Public Random Functions: Beyond the Birthday Barrier.- Random Oracles and Auxiliary Input.- Hash Functions.- Security-Amplifying Combiners for Collision-Resistant Hash Functions.- Hash Functions and the (Amplified) Boomerang Attack.- Amplifying Collision Resistance: A Complexity-Theoretic Treatment.- Theory II.- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?.- Simulatable VRFs with Applications to Multi-theorem NIZK.- Cryptography in the Multi-string Model.- Quantum Cryptography.- Secure Identification and QKD in the Bounded-Quantum-Storage Model.- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications.- Cryptanalysis II.- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach.- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073.- Encryption.- Invertible Universal Hashing and the TET Encryption Mode.- Reducing Trust in the PKG in Identity Based Cryptosystems.- Pirate Evolution: How to Make the Most of Your Traitor Keys.- Protocol Analysis.- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.- A Generalization of DDHwith Applications to Protocol Analysis and Computational Soundness.- Chernoff-Type Direct Product Theorems.- Public-Key Encryption.- Rerandomizable RCCA Encryption.- Deterministic and Efficiently Searchable Encryption.- Secure Hybrid Encryption from Weakened Key Encapsulation.- Multi-party Computation.- Scalable and Unconditionally Secure Multiparty Computation.- On Secure Multi-party Computation in Black-Box Groups.- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.