Advances in Cryptology – CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I

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"

The two volume-set, LNCS 8042 and LNCS 8043, constitutes the refereed proceedings of the 33rd Annual International Cryptology Conference, CRYPTO 2013, held in Santa Barbara, CA, USA, in August 2013. The 61 revised full papers presented in LNCS 8042 and LNCS 8043 were carefully reviewed and selected from numerous submissions. Two abstracts of the invited talks are also included in the proceedings. The papers are organized in topical sections on lattices and FHE; foundations of hardness; cryptanalysis; MPC - new directions; leakage resilience; symmetric encryption and PRFs; key exchange; multi linear maps; ideal ciphers; implementation-oriented protocols; number-theoretic hardness; MPC - foundations; codes and secret sharing; signatures and authentication; quantum security; new primitives; and functional encryption.

Author(s): Jacob Alperin-Sheriff, Chris Peikert (auth.), Ran Canetti, Juan A. Garay (eds.)
Series: Lecture Notes in Computer Science 8042 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2013

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

Front Matter....Pages -
Practical Bootstrapping in Quasilinear Time....Pages 1-20
Hardness of SIS and LWE with Small Parameters....Pages 21-39
Lattice Signatures and Bimodal Gaussians....Pages 40-56
Learning with Rounding, Revisited....Pages 57-74
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based....Pages 75-92
On Fair Exchange, Fair Coins and Fair Sampling....Pages 259-276
Limits on the Power of Cryptographic Cheap Talk....Pages 277-297
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols....Pages 298-315
Secure Computation against Adaptive Auxiliary Information....Pages 316-334
Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions....Pages 335-352
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries....Pages 353-373
A Uniform Min-Max Theorem with Applications in Cryptography....Pages 93-110
Limits of Provable Security for Homomorphic Encryption....Pages 111-128
Counter-Cryptanalysis....Pages 129-146
Fuming Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and Access Control System....Pages 147-164
Real Time Cryptanalysis of Bluetooth Encryption with Condition Masking....Pages 165-182
Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128 ....Pages 183-203
Bounds in Shallows and in Miseries....Pages 204-221
Sieve-in-the-Middle: Improved MITM Attacks....Pages 222-240
Construction of Differential Characteristics in ARX Designs Application to Skein....Pages 241-258
Message-Locked Encryption for Lock-Dependent Messages....Pages 374-391
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries....Pages 392-409
Key Homomorphic PRFs and Their Applications....Pages 410-428
On the Security of the TLS Protocol: A Systematic Analysis....Pages 429-448
New Techniques for SPHFs and Efficient One-Round PAKE Protocols....Pages 449-475
Practical Multilinear Maps over the Integers....Pages 476-493
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures....Pages 494-512
Programmable Hash Functions in the Multilinear Setting....Pages 513-530
On the Indifferentiability of Key-Alternating Ciphers....Pages 531-550
Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers....Pages 551-570
Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions....Pages 571-588
Back Matter....Pages -