The two-volume set LNCS 9014 and LNCS 9015 constitutes the refereed proceedings of the 12th International Conference on Theory of Cryptography, TCC 2015, held in Warsaw, Poland in March 2015.
The 52 revised full papers presented were carefully reviewed and
selected from 137 submissions. The papers are organized in topical
sections on foundations, symmetric key, multiparty computation,
concurrent and resettable security, non-malleable codes and tampering, privacy amplification, encryption an key exchange, pseudorandom functions and applications, proofs and verifiable computation, differential privacy, functional encryption, obfuscation.
Author(s): Yevgeniy Dodis, Jesper Buus Nielsen (eds.)
Series: Lecture Notes in Computer Science 9015
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2015
Language: English
Pages: 700
Tags: Data Encryption; Systems and Data Security; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science
Front Matter....Pages -
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions....Pages 1-30
Key-Homomorphic Constrained Pseudorandom Functions....Pages 31-60
Aggregate Pseudorandom Functions and Connections to Learning....Pages 61-89
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs....Pages 90-120
Verifiable Random Functions from Weaker Assumptions....Pages 121-143
Multi-Client Verifiable Computation with Stronger Security Guarantees....Pages 144-168
Public Verification of Private Effort....Pages 169-198
Primary-Secondary-Resolver Membership Proof Systems....Pages 199-228
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence....Pages 229-246
Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability....Pages 247-276
Outlier Privacy....Pages 277-305
Function-Private Functional Encryption in the Private-Key Setting....Pages 306-324
Functional Encryption for Randomized Functionalities....Pages 325-351
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions....Pages 352-377
Separations in Circular Security for Arbitrary Length Key Cycles....Pages 378-400
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation....Pages 401-427
Random-Oracle Uninstantiability from Indistinguishability Obfuscation....Pages 428-455
On Obfuscation with Random Oracles....Pages 456-467
Obfuscation of Probabilistic Circuits and Applications....Pages 468-497
Graph-Induced Multilinear Maps from Lattices....Pages 498-527
Obfuscating Circuits via Composite-Order Graded Encoding....Pages 528-556
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation....Pages 557-585
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds....Pages 586-613
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation....Pages 614-637
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP....Pages 638-667
Public-Coin Differing-Inputs Obfuscation and Its Applications....Pages 668-697
Back Matter....Pages -
