Secure Searchable Encryption and Data Management | 1st edition

by Brij B. Gupta and Ms Mamta

Buy used book

Mint Not in stock 442 SEK
Fair Not in stock 372 SEK
Poor Not in stock 307 SEK

Not in stock. Monitor this book.

Buy new book

New book 598 SEK

Fakta

Publisher	Taylor & Francis Ltd
Language	English
Book type	Hardcover
Utgiven	2021-04-22
Edition	1
Pages	80
ISBN	9780367619671
Kategori(er)

Add to cart

Description

With the advent of IT revolution, the volume of data produced has increased exponentially and it is still showing an upward trend. This data may be abundant and enormous but it’s a precious resource and it should be managed properly. In the management of this precious resource, cloud technology is playing an important role. Storing data over the cloud rather than on local storage has many benefits, but apart from these benefits there are some privacy concerns in storing sensitive data over third-party servers; these concerns can be addressed by storing data in an encrypted form. However, encryption solves the problem of privacy but also engenders some other serious issues which includes infeasibility of the fundamental search operation and reduction in flexibility of sharing the data with other users, amongst others. To address these issues, the concept of searchable encryption was introduced. This book provides every necessary detail required to develop the secure searchable encryption scheme using both symmetric and asymmetric cryptographic primitives along with the appropriate security models which ensures the minimum security requirements for real-world application.

So far, we have reused

books.

Sweden's friendliest and environmental friendliest bookshop with the lowest priced textbooks.

This is our ambition, and we do what it takes to get there. We are here to help students to save and earn money on their textbooks while we at the same time save the environment. We were started in 2005 by two students and have since strived to constantly make it easier to buy and sell used textbooks for as many as possible.

Opening Hours