Advances in Cryptology -- CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings (Lecture Notes in Computer Science, 6223, Band 6223) - Livres de poche

EAN (ISBN-13): 9783642146220
ISBN (ISBN-10): 3642146228
Version reliée
Livre de poche
Date de parution: 2010
Editeur: Springer Berlin
744 Pages
Poids: 1,064 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2009-09-07T09:34:27+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-04-01T08:01:18+02:00 (Zurich)
ISBN/EAN: 9783642146220

ISBN - Autres types d'écriture:
3-642-14622-8, 978-3-642-14622-0
Autres types d'écriture et termes associés:
Auteur du livre: tal, rabin lea, craig charles, charles barbara, ieee computer society
Titre du livre: crypto 2010, advances cryptology, barbara, les crypto, advances computer security, lecture notes computer science, august santa

---

Données de l'éditeur

Auteur: Tal Rabin
Titre: Lecture Notes in Computer Science; Security and Cryptology; Advances in Cryptology -- CRYPTO 2010 - 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings
Editeur: Springer; Springer Berlin
744 Pages
Date de parution: 2010-07-30
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 744 p. 63 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Kodierungstheorie und Verschlüsselung (Kryptologie); Verstehen; Informatik; AES; Hashing; Internet; Permutation; algebraic geometry; authentication; block ciphers; collision resistance; complexity; cryptography; embedded systems; security; trust; 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

Leakage.- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability.- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks.- Protecting Cryptographic Keys against Continual Leakage.- Securing Computation against Continuous Leakage.- Lattice.- An Efficient and Parallel Gaussian Sampler for Lattices.- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE.- Homomorphic Encryption.- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness.- Additively Homomorphic Encryption with d-Operand Multiplications.- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.- Theory and Applications.- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption.- Structure-Preserving Signatures and Commitments to Group Elements.- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves.- Key Exchange, OAEP/RSA, CCA.- Credential Authenticated Identification and Key Exchange.- Password-Authenticated Session-Key Generation on the Internet in the Plain Model.- Instantiability of RSA-OAEP under Chosen-Plaintext Attack.- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs.- Attacks.- Factorization of a 768-Bit RSA Modulus.- Correcting Errors in RSA Private Keys.- Improved Differential Attacks for ECHO and Grøstl.- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony.- Composition.- Universally Composable Incoercibility.- Concurrent Non-Malleable Zero Knowledge Proofs.- Equivalence of Uniform Key Agreement and Composition Insecurity.- Computation Delegation and Obfuscation.- Non-interactive Verifiable Computing:Outsourcing Computation to Untrusted Workers.- Improved Delegation of Computation Using Fully Homomorphic Encryption.- Oblivious RAM Revisited.- On Strong Simulation and Composable Point Obfuscation.- Multiparty Computation.- Protocols for Multiparty Coin Toss with Dishonest Majority.- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost.- Secure Multiparty Computation with Minimal Interaction.- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security.- Pseudorandomness.- On Generalized Feistel Networks.- Cryptographic Extraction and Key Derivation: The HKDF Scheme.- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs.- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks.- Quantum.- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries.- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions.- Sampling in a Quantum Population, and Applications.
Up-to-date research in cryptology