Theory of cryptography. 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings /: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings. Part I : (2016)

• Record Type: Book
• Other Titles: TCC 2016-B
• Further Information: Note: Martin Hirt, Adam Smith (eds.).
• Editors: Hirt, Martin; Smith, Adam (Adam Davison)
• Other Names: Theory of Cryptography Conference, 14th
• Contents: TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao's Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross & Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing.
• Publisher Details: Berlin, Germany : Springer
• Publication Date: 2016
• Extent: 1 online resource (xvi, 692 pages), illustrations
• Subjects: 005.8/2; Data encryption (Computer science) -- Congresses; Data encryption (Computer science); Computer Science; Data Encryption; Systems and Data Security; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Management of Computing and Information Systems; Computer Communication Networks; Electronic books; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783662536414; 3662536412; 3662536404; 9783662536407; 9783662536445; 3662536447
• Related ISBNs: 9783662536407; 3662536439; 9783662536438
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed October 28, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.