product iamge

Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, 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.

Download
Search on Amazon

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 9562 and LNCS 9563 constitutes the refereed

Author(s): Eyal Kushilevitz, Tal Malkin (eds.)
Series: Lecture Notes in Computer Science 9562
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2016

Language: English
Pages: XIV, 618
Tags: Data Encryption; Systems and Data Security; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computer Communication Networks

Front Matter....Pages I-XIV
Front Matter....Pages 1-1
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings....Pages 3-17
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models....Pages 18-48
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation....Pages 49-66
Indistinguishability Obfuscation: From Approximate to Exact....Pages 67-95
Output-Compressing Randomized Encodings and Applications....Pages 96-124
Functional Encryption for Turing Machines....Pages 125-153
Front Matter....Pages 155-155
The Complexity of Computing the Optimal Composition of Differential Privacy....Pages 157-175
Order-Revealing Encryption and the Hardness of Private Learning....Pages 176-206
Front Matter....Pages 207-207
On the Hardness of Learning with Rounding over Small Modulus....Pages 209-224
Two-Round Man-in-the-Middle Security from LPN....Pages 225-248
Front Matter....Pages 249-249
Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography....Pages 251-281
Standard Security Does Imply Security Against Selective Opening for Markov Distributions....Pages 282-305
Non-Malleable Encryption: Simpler, Shorter, Stronger....Pages 306-335
Verifiable Random Functions from Standard Assumptions....Pages 336-362
Front Matter....Pages 363-363
Homomorphic Evaluation Requires Depth....Pages 365-371
On Basing Private Information Retrieval on NP-Hardness....Pages 372-386
Front Matter....Pages 387-387
On the Correlation Intractability of Obfuscated Pseudorandom Functions....Pages 389-415
Reconfigurable Cryptography: A Flexible Approach to Long-Term Security....Pages 416-445
Multilinear Maps from Obfuscation....Pages 446-473
Perfect Structure on the Edge of Chaos....Pages 474-502
Front Matter....Pages 503-503
Cryptographic Assumptions: A Position Paper....Pages 505-522
Front Matter....Pages 523-523
Adaptive Security with Quasi-Optimal Rate....Pages 525-541
On the Complexity of Additively Homomorphic UC Commitments....Pages 542-565
Simplified Universal Composability Framework....Pages 566-595
Characterization of Secure Multiparty Computation Without Broadcast....Pages 596-616
Back Matter....Pages 617-618