Cantitate/Preț
Produs
Total produse
Vezi coșul
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I de Martin Hirt

Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I: Lecture Notes in Computer Science, cartea 9985

Editat de Martin Hirt, Adam Smith
en Limba Engleză Paperback – 23 oct 2016
The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016.
The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 38988 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 25 oct 2016 38988 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 23 oct 2016 39614 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 39614 lei

Nou

Puncte Express: 594
Preț estimativ în valută:
7011€ • 8222$ • 6147£

Carte tipărită la comandă

Livrare economică 26 ianuarie-09 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662536407
ISBN-10: 3662536404
Pagini: 708
Ilustrații: XVI, 692 p. 85 illus.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

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.
 

Caracteristici

Includes supplementary material: sn.pub/extras