Data and Applications Security and Privacy XXVIII: 28th Annual IFIP WG 11.3 Working Conference, DBSec 2014, Vienna, Austria, July 14-16, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8566
Editat de Vijay Atluri, Günther Pernulen Limba Engleză Paperback – 24 iul 2014
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 338.16 lei
Preț vechi: 422.70 lei
-20% Nou
Puncte Express: 507
Preț estimativ în valută:
64.71€ • 67.15$ • 54.09£
64.71€ • 67.15$ • 54.09£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662439357
ISBN-10: 3662439352
Pagini: 412
Ilustrații: XVIII, 391 p. 97 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662439352
Pagini: 412
Ilustrații: XVIII, 391 p. 97 illus.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Integrity Assurance for Outsourced Databases without DBMS Modification.- Specification and Deployment of Integrated Security Policies for Outsourced Data.- Optimizing Integrity Checks for Join Queries in the Cloud.- Privacy-Enhancing Proxy Signatures from Non-interactive Anonymous Credentials.- Privacy-Preserving Multiple Keyword Search on Outsourced Data in the Clouds.- Secure and Privacy-Preserving Querying of Personal Health Records in the Cloud.- Data Leakage Quantification.- Toward Software Diversity in Heterogeneous Networked Systems.- FSquaDRA: Fast Detection of Repackaged Applications.- ‘Who, When, and Where?’ Location Proof Assertion for Mobile Devices.- Design Patterns for Multiple Stakeholders in Social Computing.- Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure.- ELITE: zEro Links Identity managemenT systEm.- Dynamic Workflow Adjustment with Security Constraints.- Consistent Query Plan Generation in Secure Cooperative Data Access.- Hunting the Unknown: White-Box Database Leakage Detection.- Incremental Analysis of Evolving Administrative Role Based Access Control Policies.- Mining Attribute-Based Access Control Policies from Logs.- Attribute-Aware Relationship-Based Access Control for Online Social Networks.- Randomly Partitioned Encryption for Cloud Databases.- Towards Secure Cloud Database with Fine-Grained Access Control.- Practical Private Information Retrieval from a Time-Varying, Multi-attribute, and Multiple-Occurrence Database.- LPM: Layered Policy Management for Software-Defined Networks.- On Minimizing the Size of Encrypted Databases.- Efficient and Enhanced Solutions for Content Sharing in DRM Systems.- A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters.