Update cookies preferences

E-book: Secure Searchable Encryption and Data Management [Taylor & Francis e-book]

, (Director, International Center for AI & CCRI)
  • Format: 100 pages, 9 Tables, black and white; 10 Illustrations, black and white
  • Pub. Date: 16-Mar-2021
  • Publisher: CRC Press
  • ISBN-13: 9781003107316
Other books in subject:
  • Taylor & Francis e-book
  • Price: 68,31 €*
  • * this price gives unlimited concurrent access for unlimited time
  • Regular price: 97,59 €
  • Save 30%
Secure Searchable Encryption and Data ManagementLarger Image
  • Format: 100 pages, 9 Tables, black and white; 10 Illustrations, black and white
  • Pub. Date: 16-Mar-2021
  • Publisher: CRC Press
  • ISBN-13: 9781003107316
Other books in subject:
Taylor & Francis e-booksMore info about Taylor & Francis e-books
Companion website: https://www.taylorfrancis.com/books/9781003107316

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.

Preface xi
Acknowledgements xiii
Author bio xv
1 Introduction to number theory and abstract algebra
1(20)
1.1 Number theory
1(10)
1.1.1 Divisibility
1(1)
1.1.1.1 Divisibility properties
2(1)
1.1.2 Prime numbers
2(1)
1.1.2.1 Fundamental theorem of arithmetic
2(1)
1.1.2.2 Prime number properties
3(1)
1.1.3 Greatest common divisor (GCD)
3(1)
1.1.3.1 Euclid's theorem
4(1)
1.1.3.2 Extended Euclidean algorithm
4(1)
1.1.4 Congruence
5(1)
1.1.4.1 Congruence relation properties
5(1)
1.1.4.2 Reduced residue system modulo m
6(1)
1.1.4.3 Inverse modulo m
6(1)
1.1.4.4 Euler's phi function (totient function)
7(1)
1.1.4.5 Fermat's theorem
7(1)
1.1.4.6 Euler's generalization of Fermat's theorem
7(1)
1.1.5 Congruence solutions
7(1)
1.1.6 Quadratic residues
8(1)
1.1.6.1 Euler's criterion
9(1)
1.1.7 Legendre symbol
9(1)
1.1.7.1 Law of quadratic reciprocity
10(1)
1.1.7.2 Jacobi symbol
10(1)
1.2 Abstract algebra
11(7)
1.2.1 Semigroup
12(1)
1.2.2 Monoid
12(1)
1.2.3 Group
12(1)
1.2.3.1 Symmetric finite group
13(1)
1.2.3.2 Group isomorphism
14(1)
1.2.3.3 Subgroup
14(1)
1.2.3.4 Intersection of subgroups
15(1)
1.2.3.5 Cyclic groups
15(1)
1.2.4 Ring
15(1)
1.2.5 Field
15(1)
1.2.5.1 Finite fields
15(1)
1.2.5.2 Prime fields and their arithmetic
16(1)
1.2.5.3 Extension fields and their arithmetic
16(1)
1.2.5.4 Characteristic of a field
17(1)
1.3 Application to cryptography
18(1)
1.4
Chapter summary
18(1)
References
18(3)
2 Introduction to cryptography
21(16)
2.1 Introduction to cryptography
21(1)
2.2 Classification of ciphers
22(3)
2.2.1 Based on the type of operations
22(1)
2.2.1.1 Substitution cipher
22(1)
2.2.1.2 Transposition cipher
23(1)
2.2.2 Based on data processing
23(1)
2.2.2.1 Stream cipher
23(1)
2.2.2.2 Block cipher
24(1)
2.2.3 Based on the type of key
25(1)
2.3 Types of cryptographic techniques
25(5)
2.3.1 Public-key cryptography
26(1)
2.3.1.1 Security models
27(1)
2.3.1.2 Security goals of a public-key cryptosystem
27(1)
2.3.1.3 Security attacks on a public-key cryptosystem
28(1)
2.3.1.4 ElGamal cryptosystem
29(1)
2.4 Generalizations in public-key cryptography
30(4)
2.4.1 Identity-based encryption (1BE)
30(1)
2.4.2 Attribute-based encryption (ABE)
31(3)
2.5
Chapter summary
34(1)
References
34(3)
3 Searchable encryption and data management
37(16)
3.1 Need for searchable encryption
37(1)
3.2 General model
38(1)
3.3 Broad categorization of searchable encryption schemes
39(10)
3.3.1 Symmetric searchable encryption
40(1)
3.3.2 Searchable encryption in public-key setting
41(1)
3.3.2.1 Bilinear map
41(1)
3.3.2.2 The first pioneering SE scheme in a public-key setting
42(7)
3.4
Chapter summary
49(1)
References
50(3)
4 Introduction to provable security and its application in searchable encryption
53(16)
4.1 Security definition
53(3)
4.1.1 Probabilistic and game-based security definition
54(2)
4.2 Reduction proofs
56(5)
4.2.1 Example of reduction proof
59(2)
4.3 Common security definitions in searchable encryption
61(2)
4.4 Security/complexity assumptions and proof strategies
63(3)
4.4.1 Random oracle model and standard model
66(1)
4.5
Chapter summary
66(1)
References
66(3)
5 Searchable encryption in a public-key setting
69(18)
5.1 System definition and system model
69(7)
5.1.1 System definition
70(2)
5.1.2 System model
72(2)
5.1.3 Flow of information between different parties involved in an SE system
74(2)
5.2 Broad categories of searchable encryption in a public-key setting
76(8)
5.2.1 IBE-based SE schemes
76(1)
5.2.1.1 PEKS revisited
77(1)
5.2.1.2 PEFKS
78(1)
5.2.2 ABE-based SE schemes
78(1)
5.2.2.1 VABKS
79(1)
5.2.2.2 Attribute-based keyword search
80(1)
5.2.2.3 A key-policy attribute-based temporary keyword search
80(1)
5.2.2.4 Attribute-based searchable encryption for user level revocation
80(1)
5.2.2.5 Multi-authority attribute-based keyword search over encrypted cloud data
81(1)
5.2.2.6 Searchable encryption for mobile healthcare networks
81(1)
5.2.2.7 Attribute-based searchable encryption*-for non-monotonic access structure
81(3)
5.3
Chapter summary
84(1)
References
84(3)
6 Design and development tools and inter-domain application
87(6)
6.1 Language and library options
87(2)
6.1.1 Toolkits for symmetric searchable encryption schemes
87(1)
6.1.2 Pairing libraries for searchable encryption in a public-key setting
88(1)
6.2 Data sets
89(1)
6.3 Inter-domain applications
90(1)
6.4
Chapter summary
91(1)
References
91(2)
7 Searchable encryption applications, challenges and future research directions
93(6)
7.1 Searchable encryption applications
93(1)
7.2 Research challenges
94(1)
7.3 Directions for future work
95(2)
7.4
Chapter summary
97(1)
References
97(2)
Index 99
Brij B. Gupta received PhD degree from Indian Institute of Technology Roorkee, India in the area of Information and Cyber Security. In 2009, he was selected for Canadian

Commonwealth Scholarship awarded by Government of Canada. He published more than 250research papers in International Journals and Conferences of high repute including IEEE, Elsevier, ACM, Springer, Wiley, Taylor & Francis, Inderscience, etc. He has visited several countries, i.e. Canada, Japan, Malaysia, Australia, China, Hong-Kong, Italy, Spain etc to present his research work. His biography was selected and published in the 30th Edition of Marquis Who's Who in the World, 2012. Dr. Gupta also received Young Faculty research fellowship award from Ministry of Electronics and Information Technology, Government of India in 2017. He is also working as principal investigator of various R&D projects. He is serving as associate editor of IEEE Access, IEEE TII, Associate editor of IJICS, Inderscience and Executive editor of IJITCA, Inderscience, respectively. He is also serving as reviewer for Journals of IEEE, Springer, Wiley, Taylor & Francis, etc. He is also serving as guest editor of various reputed Journals. He was also visiting researcher with University of Murcia (UMU), Spain, Deakin University, Australia and Yamaguchi University, Japan in 2018, 2017 and 2015, respectively. At present, Dr. Gupta is working as Assistant Professor in the Department of Computer Engineering, National Institute of Technology Kurukshetra India. His research interest includes Information security, Cyber Security, Cloud Computing, Web security, Intrusion detection and Phishing.

Ms Mamta is a Research Scholar at National Institute of Technology Kurukshetra, India
Permanent link: https://www.kriso.ee/db/9781003107316_pe.html
Keywords: