Communication Complexity surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, the authors treat applications of these models, including computer networks, VLSI circuits, and data structures.

The two-volume set LNCS 9562 and LNCS 9563 constitutes the refereedproceedings of the 13th International Conference on Theory ofCryptography, TCC 2016, held in Tel Aviv, Israel, in January 2016.
The 45 revised full papers presented were carefully reviewed andselected from 112 submissions. The papers are organized in topicalsections on obfuscation, differential privacy, LWR and LPN, public key encryption, signatures, and VRF, complexity of cryptographic primitives, multiparty computation, zero knowledge and PCP, oblivious RAM, ABE and IBE, and codes and interactive proofs. The volume also...

The two-volume set LNCS 9562 and LNCS 9563 constitutes the refereedproceedings of the 13th International Conference on Theory ofCryptography, TCC 2016, held in Tel Aviv, Israel, in January 2016.
The 45 revised full papers presented were carefully reviewed andselected from 112 submissions. The papers are organized in topicalsections on obfuscation, differential privacy, LWR and LPN, public key encryption, signatures, and VRF, complexity of cryptographic primitives, multiparty computation, zero knowledge and PCP, oblivious RAM, ABE and IBE, and codes and interactive proofs. The volume also...