Advances in Cryptology - EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013, Proceedings (Security and Cryptology) (2013)

個数:

Advances in Cryptology - EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013, Proceedings (Security and Cryptology) (2013)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 736 p.
  • 言語 ENG
  • 商品コード 9783642383472
  • DDC分類 005.82

Full Description

This book constitutes the proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2013, held in Athens, Greece, in May 2013.
The 41 full papers included in this volume were carefully reviewed and selected from 201 submissions. They deal with cryptanalysis of hash functions, side-channel attacks, number theory, lattices, public key encryption, digital signatures, homomorphic cryptography, quantum cryptography, storage, tools, and secure computation.

Contents

Candidate Multilinear Maps from Ideal Lattices.- Lossy Codes and a New Variant of the Learning-With-Errors Problem.- A Toolkit for Ring-LWE Cryptography.- Regularity of Lossy RSA on Subdomains and Its Applications.- Efficient Cryptosystems from 2k-th Power Residue Symbols.- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext
Distributions.- How to Watermark Cryptographic Functions.- Security Evaluations beyond Computing Power: How to Analyze Side-Channel Attacks You Cannot Mount?.- Masking against Side-Channel Attacks: A Formal Security Proof.- Leakage-Resilient Cryptography from Minimal Assumptions.- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields.- Fast Cryptography in Genus 2.- Graph-Theoretic Algorithms for the "Isomorphism of Polynomials"
Problem.- Cryptanalysis of Full RIPEMD-128.- New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis.- Improving Local Collisions: New Attacks on Reduced SHA-256.- Dynamic Proofs of Retrievability via Oblivious RAM .- Message-Locked Encryption and Secure Deduplication.- Batch Fully Homomorphic Encryption over the Integers.- Practical Homomorphic MACs for Arithmetic Circuits.- Streaming Authenticated Data Structures.- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting.- New Links between Differential and Linear Cryptanalysis.- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption.- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions.- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures.- Practical Signatures from Standard Assumptions.- Locally Computable UOWHF with Linear Shrinkage.- Amplification of Chosen-Ciphertext Security.- Circular Chosen-Ciphertext Security with Compact Ciphertexts.- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions.- How to Hide Circuits in MPC an Efficient Framework for PrivateFunction Evaluation.- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction.- Quantum-Secure Message Authentication Codes.- One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games.- Quadratic Span Programs and Succinct NIZKs without PCPs.- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists.- Resource-Restricted Indifferentiability.- On Concurrently Secure Computation in the Multiple Ideal Query Model.- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.- How to Garble RAM Programs?.

最近チェックした商品