Details

Subject(s)

• Data encryption (Computer science) [Browse]
• Computer security [Browse]

Series

• CRC focus series. [More in this series]
• CRC Focus

Summary note

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

Source of description

Description based on print version record.

Contents

• Cover
• Half Title
• Title Page
• Copyright Page
• Dedication
• Contents
• Preface
• Acknowledgements
• Author bio
• 1. Introduction to number theory and abstract algebra
• 1.1. Number Theory
• 1.1.1. Divisibility
• 1.1.1.1 Divisibility properties
• 1.1.2. Prime Numbers
• 1.1.2.1. Fundamental theorem of arithmetic
• 1.1.2.2 Prime number properties
• 1.1.3. Greatest Common Divisor (gcd)
• 1.1.3.1 Euclid's theorem
• 1.1.3.2 Extended Euclidean algorithm
• 1.1.4. Congruence
• 1.1.4.1 Congruence relation properties
• 1.1.4.2 Reduced residue system modulo m
• 1.1.4.3 Inverse modulo m
• 1.1.4.4 Euler's phi function (totient function)
• 1.1.4.5 Fermat's theorem
• 1.1.4.6 Euler's generalization of Fermat's theorem
• 1.1.5. Congruence Solutions
• 1.1.6. Quadratic Residues
• 1.1.6.1. Euler's criterion
• 1.1.7. Legendre Symbol
• 1.1.7.1. Law of quadratic reciprocity
• 1.1.7.2. Jacobi symbol
• 1.2. Abstract Algebra
• 1.2.1. Semigroup
• 1.2.2. Monoid
• 1.2.3. Group
• 1.2.3.1. Symmetric finite group
• 1.2.3.2. Group isomorphism
• 1.2.3.3. Subgroup
• 1.2.3.4. Intersection of subgroups
• 1.2.3.5. Cyclic groups
• 1.2.4. Ring
• 1.2.5. Field
• 1.2.5.1. Finite fields
• 1.2.5.2. Prime fields and their arithmetic
• 1.2.5.3. Extension fields and their arithmetic
• 1.2.5.4. Characteristic of a field
• 1.3. Application To Cryptography
• 1.4. Chapter Summary
• References
• 2. Introduction to cryptography
• 2.1. Introduction To Cryptography
• 2.2. Classification Of Ciphers
• 2.2.1. Based On The Type Of Operations
• 2.2.1.1. Substitution cipher
• 2.2.1.2. Transposition cipher
• 2.2.2. Based On Data Processing
• 2.2.2.1. Stream cipher
• 2.2.2.2. Block cipher
• 2.2.3. Based On The Type Of Key
• 2.3. Types Of Cryptographic Techniques
• 2.3.1. Public-key Cryptography
• 2.3.1.1. Security models.
• 2.3.1.2. Security goals of a public-key cryptosystem
• 2.3.1.3. Security attacks on a public-key cryptosystem
• 2.3.1.4. ElGamal cryptosystem
• 2.4. Generalizations In Public-key Cryptography
• 2.4.1. Identity-based Encryption (ibe)
• 2.4.2. Attribute-based Encryption (abe)
• 2.5. Chapter Summary
• 3. Searchable encryption and data management
• 3.1. Need For Searchable Encryption
• 3.2. General Model
• 3.3. Broad Categorization Of Searchable Encryption Schemes
• 3.3.1. Symmetric Searchable Encryption
• 3.3.2. Searchable Encryption In Public-key Setting
• 3.3.2.1. Bilinear map
• 3.3.2.2. The first pioneering SE scheme in a public-key setting
• 3.4. Chapter Summary
• 4. Introduction to provable security and its application in searchable encryption
• 4.1. Security Definition
• 4.1.1. Probabilistic And Game-based Security Definition
• 4.2. Reduction Proofs
• 4.2.1. Example Of Reduction Proof
• 4.3. Common Security Definitions In Searchable Encryption
• 4.4. Security/complexity Assumptions And Proof Strategies
• 4.4.1. Random Oracle Model And Standard Model
• 4.5. Chapter Summary
• 5. Searchable encryption in a public-key setting
• 5.1. System Definition And System Model
• 5.1.1. System Definition
• 5.1.2. System Model
• 5.1.3. Flow Of Information Between Different Parties Involved In An Se System
• 5.2. Broad Categories Of Searchable Encryption In A Public-key Setting
• 5.2.1. Ibe-based Se Schemes
• 5.2.1.1. PEKS revisited
• 5.2.1.2. PEFKS
• 5.2.2. Abe-based Se Schemes
• 5.2.2.1. VABKS
• 5.2.2.2. Attribute-based keyword search
• 5.2.2.3. A key-policy attribute-based temporary keyword search
• 5.2.2.4. Attribute-based searchable encryption for user level revocation
• 5.2.2.5. Multi-authority attribute-based keyword search over encrypted cloud data.
• 5.2.2.6. Searchable encryption for mobile healthcare networks
• 5.2.2.7. Attribute-based searchable encryption for non-monotonic access structure
• 5.3. Chapter Summary
• 6. Design and development tools and inter-domain application
• 6.1. Language And Library Options
• 6.1.1. Toolkits For Symmetric Searchable Encryption Schemes
• 6.1.2. Pairing Libraries For Searchable Encryption In A Public-key Setting
• 6.2. Data Sets
• 6.3. Inter-domain Applications
• 6.4. Chapter Summary
• 7. Searchable encryption applications, challenges and future research directions
• 7.1. Searchable Encryption Applications
• 7.2. Research Challenges
• 7.3. Directions For Future Work
• 7.4. Chapter Summary
• Index.

Show 116 more Contents items

ISBN

9780367619671

Statement on responsible collection description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...