Advances In Cryptology -- Crypto 2010: 30th Annual Cryptology Conference, Santa Barbara, Ca, Usa, August 15-19, 2010, Proceedings (lecture Notes In Computer Science)
معرفی کتاب «Advances In Cryptology -- Crypto 2010: 30th Annual Cryptology Conference, Santa Barbara, Ca, Usa, August 15-19, 2010, Proceedings (lecture Notes In Computer Science)» نوشتهٔ Zvika Brakerski, Shafi Goldwasser (auth.), Tal Rabin (eds.)، منتشرشده توسط نشر Springer-Verlag Berlin Heidelberg. این کتاب در 6 صفحه، فرمت pdf، زبان انگلیسی ارائه شده است.
Annotation This Book Constitutes The Refereed Proceedings Of The 30th Annual International Cryptology Conference, Crypto 2010, Held In Santa Barbara, Ca, Usa In August 2010, Co-located With Ches 2010, The Workshop On Cryptographic Hardware And Embedded Systems. The 39 Revised Full Papers Presented Were Carefully Reviewed And Selected From 203 Submissions. Addressing All Current Foundational, Theoretical And Research Aspects Of Cryptology, Cryptography, And Cryptanalysis As Well As Advanced Applications, The Papers Are Organized In Topical Sections On Leakage, Lattice, Homomorphic Encryption, Theory And Applications, Key Exchange, Oaep/rsa, Cca, Attacks, Composition, Computation Delegation And Obfuscation, Multiparty Computation, Pseudorandomness, And Quantum. Front Matter....Pages - Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability....Pages 1-20 Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks....Pages 21-40 Protecting Cryptographic Keys against Continual Leakage....Pages 41-58 Securing Computation against Continuous Leakage....Pages 59-79 An Efficient and Parallel Gaussian Sampler for Lattices....Pages 80-97 Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE....Pages 98-115 Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness....Pages 116-137 Additively Homomorphic Encryption with d -Operand Multiplications....Pages 138-154 i -Hop Homomorphic Encryption and Rerandomizable Yao Circuits....Pages 155-172 Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography....Pages 173-190 Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption....Pages 191-208 Structure-Preserving Signatures and Commitments to Group Elements....Pages 209-236 Efficient Indifferentiable Hashing into Ordinary Elliptic Curves....Pages 237-254 Credential Authenticated Identification and Key Exchange....Pages 255-276 Password-Authenticated Session-Key Generation on the Internet in the Plain Model....Pages 277-294 Instantiability of RSA-OAEP under Chosen-Plaintext Attack....Pages 295-313 Efficient Chosen-Ciphertext Security via Extractable Hash Proofs....Pages 314-332 Factorization of a 768-Bit RSA Modulus....Pages 333-350 Correcting Errors in RSA Private Keys....Pages 351-369 Improved Differential Attacks for ECHO and Grøstl....Pages 370-392 A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony....Pages 393-410 Universally Composable Incoercibility....Pages 411-428 Concurrent Non-Malleable Zero Knowledge Proofs....Pages 429-446 Equivalence of Uniform Key Agreement and Composition Insecurity....Pages 447-464 Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers....Pages 465-482 Improved Delegation of Computation Using Fully Homomorphic Encryption....Pages 483-501 Oblivious RAM Revisited....Pages 502-519 On Strong Simulation and Composable Point Obfuscation....Pages 520-537 Protocols for Multiparty Coin Toss with Dishonest Majority....Pages 538-557 Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost....Pages 558-576 Secure Multiparty Computation with Minimal Interaction....Pages 577-594 A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security....Pages 595-612 On Generalized Feistel Networks....Pages 613-630 Cryptographic Extraction and Key Derivation: The HKDF Scheme....Pages 631-648 Time Space Tradeoffs for Attacks against One-Way Functions and PRGs....Pages 649-665 Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks....Pages 666-684 Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries....Pages 685-706 On the Efficiency of Classical and Quantum Oblivious Transfer Reductions....Pages 707-723 Sampling in a Quantum Population, and Applications....Pages 724-741 Back Matter....Pages -
دانلود کتاب Advances In Cryptology -- Crypto 2010: 30th Annual Cryptology Conference, Santa Barbara, Ca, Usa, August 15-19, 2010, Proceedings (lecture Notes In Computer Science)