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

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.

---

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.

---

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.
Content:
Front Matter....Pages -
Candidate Multilinear Maps from Ideal Lattices....Pages 1-17
Lossy Codes and a New Variant of the Learning-With-Errors Problem....Pages 18-34
A Toolkit for Ring-LWE Cryptography....Pages 35-54
Regularity of Lossy RSA on Subdomains and Its Applications....Pages 55-75
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions....Pages 76-92
How to Watermark Cryptographic Functions....Pages 93-110
Security Evaluations beyond Computing Power....Pages 111-125
Masking against Side-Channel Attacks: A Formal Security Proof....Pages 126-141
Leakage-Resilient Cryptography from Minimal Assumptions....Pages 142-159
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields....Pages 160-176
Fast Cryptography in Genus 2....Pages 177-193
Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem....Pages 194-210
Cryptanalysis of Full RIPEMD-128....Pages 211-227
New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis....Pages 228-244
Improving Local Collisions: New Attacks on Reduced SHA-256....Pages 245-261
Dynamic Proofs of Retrievability via Oblivious RAM....Pages 262-278
Message-Locked Encryption and Secure Deduplication....Pages 279-295
Keccak....Pages 296-312
Batch Fully Homomorphic Encryption over the Integers....Pages 313-314
Practical Homomorphic MACs for Arithmetic Circuits....Pages 315-335
Streaming Authenticated Data Structures....Pages 336-352
Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting....Pages 353-370
New Links between Differential and Linear Cryptanalysis....Pages 371-387
Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption....Pages 388-404
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions....Pages 405-425
Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures....Pages 426-443
Practical Signatures from Standard Assumptions....Pages 444-460
Locally Computable UOWHF with Linear Shrinkage....Pages 461-485
Amplification of Chosen-Ciphertext Security....Pages 486-502
Circular Chosen-Ciphertext Security with Compact Ciphertexts....Pages 503-519
MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions....Pages 520-536
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation....Pages 537-556
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction....Pages 557-574
Quantum-Secure Message Authentication Codes....Pages 575-591
One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games....Pages 592-608
Quadratic Span Programs and Succinct NIZKs without PCPs....Pages 609-625
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists....Pages 626-645
Resource-Restricted Indifferentiability....Pages 646-663
On Concurrently Secure Computation in the Multiple Ideal Query Model....Pages 664-683
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions....Pages 684-701
How to Garble RAM Programs?....Pages 702-718
Back Matter....Pages 719-734
....Pages -