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 document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Sanjam Garg, Craig Gentry, Shai Halevi (auth.), Thomas Johansson, Phong Q. Nguyen (eds.)
Series: Lecture Notes in Computer Science 7881
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2013

Language: English
Pages: 736
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Systems and Data Security; Discrete Mathematics in Computer Science

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