Buy Advances to Homomorphic and Searchable Encryption by Stefania Loredana Nita
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology Books > Computer security > Advances to Homomorphic and Searchable Encryption
Advances to Homomorphic and Searchable Encryption

Advances to Homomorphic and Searchable Encryption


     0     
5
4
3
2
1



Available


X
About the Book

This book presents the current state of the literature on the fields of homomorphic and searchable encryption, from both theoretical and practical points of view. Homomorphic and searchable encryption are still relatively novel and rapidly evolving areas and face practical constraints in the contexts of large-scale cloud computing and big data.

Both encryption methods can be quantum-resistant if they use the right mathematical techniques. In fact, many fully homomorphic encryption schemes already use quantum-resistant techniques, such as lattices or characteristics of polynomials - which is what motivated the authors to present them in detail.

On the one hand, the book highlights the characteristics of each type of encryption, including methods, security elements, security requirements, and the main types of attacks that can occur. On the other, it includes practical cases and addresses aspects like performance, limitations, etc.

As cloud computing andbig data already represent the future in terms of storing, managing, analyzing, and processing data, these processes need to be made as secure as possible, and homomorphic and searchable encryption hold huge potential to secure both the data involved and the processes through which it passes.

This book is intended for graduates, professionals and researchers alike. Homomorphic and searchable encryption involve advanced mathematical techniques; accordingly, readers should have a basic background in number theory, abstract algebra, lattice theory, and polynomial algebra.



Table of Contents:
1. Introduction.- 2. Background and Preliminaries.- 3. Homomorphic Encryption.- 4. Searchable Encryption.

About the Author :
Stefania Loredana Nita, Ph.D., is Senior Lecturer at the Faculty of Information Systems and Cybernetic Security of "Ferdinand I" Military Technical Academy, Bucharest, Romania, where she teaches courses on Formal Languages and Translators, Management and Development of Database Applications, and Data Structures and Algorithms. Also, she is Software Developer at the Institute for Computers, Bucharest, Romania. She received her Ph.D. degree in 2021, and her Ph.D. thesis is on advanced cryptographic schemes using searchable encryption and homomorphic encryption. She has worked for more than two years as Assistant Lecturer at the University of Bucharest where she taught courses on subjects such as Advanced Programming Techniques, Simulation Methods, and Operating Systems. She has authored and co-authored more than 32 work papers published in international conferences proceedings and journals and 7 books on functional programming and cryptography. She holds an M.Sc. in SoftwareEngineering and two B.Sc. in Computer Science and Mathematics.
Marius Iulian Mihailescu, Ph.D., is Associate Professor at the Faculty of Engineering and Informatics of "Spiru Haret" University, Bucharest, Romania, and Software IT Project Manager at the Institute for Computers, Bucharest, Romania. He is also CEO of Dapyx Solution Ltd., a company based in Bucharest, Romania, where he is involved in information security and cryptography-related research projects. He authored and co-authored more than 40 articles in conference proceedings and journals, and 8 books. For more than six years he has served as Lecturer at well-known national and international universities (the University of Bucharest, "Titu Maiorescu" University of Bucharest, and Kadir Has University in Istanbul, Turkey). He served for three years as IT Officer at Royal Caribbean Cruises Ltd. where he dealt with IT infrastructure, data security, and satellite communications systems. He received his Ph.D. degree in 2014, and his thesis was on applied cryptography over biometrics data.


Best Sellers


Product Details
  • ISBN-13: 9783031432132
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 136
  • Returnable: N
  • ISBN-10: 3031432134
  • Publisher Date: 27 Sep 2023
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances to Homomorphic and Searchable Encryption
Springer International Publishing AG -
Advances to Homomorphic and Searchable Encryption
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advances to Homomorphic and Searchable Encryption

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!