InhaltsangabeCandidate 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 RIPEMD128. New Collision Attacks on SHA1 Based on Optimal Joint LocalCollision Analysis. Improving Local Collisions: New Attacks on Reduced SHA256. Dynamic Proofs of Retrievability via Oblivious RAM. MessageLocked 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 ReducedRound AES in the SingleKey Setting. New Links between Differential and Linear Cryptanalysis. Towards KeyLength Extension with Optimal Security: Cascade Encryption and Xorcascade Encryption. IdealCipher (Ir)reducibility for BlockcipherBased Hash Functions. Limitations of the Metareduction Technique: The Case of Schnorr Signatures. Practical Signatures from Standard Assumptions. Locally Computable UOWHF with Linear Shrinkage. Amplification of ChosenCiphertext Security. Circular ChosenCiphertext Security with Compact Ciphertexts. MiniLEGO: Efficient Secure TwoParty Computation from General Assumptions. How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation. Multiparty Computation of Polynomials and Branching Programs without Simultaneous Interaction. QuantumSecure Message Authentication Codes. OneSided DeviceIndependent QKD and PositionBased Cryptography from Monogamy Games. Quadratic Span Programs and Succinct NIZKs without PCPs. ZeroKnowledge Argument for Polynomial Evaluation with Application to Blacklists. ResourceRestricted 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?.