Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/315635
Title: | Design and Analysis of Bilinear Pairing based Cryptosystems |
Researcher: | Praveen I |
Guide(s): | Sethumadhavan M |
Keywords: | Computer security Cryptography Data encryption (Computer science) Engineering and Technology Homomorphisms (Mathematics) |
University: | Amrita Vishwa Vidyapeetham (University) |
Completed Date: | 2019 |
Abstract: | Pairings are basic building blocks in many cryptographic protocols such as identity newlinebased encryption, one round three party key agreement schemes, short signatures newlineand zero-knowledge proofs. The basic algorithm for pairing computation is provided by Victor S. Miller. The reduction of complexity of Miller s algorithm is a newlinesignificant research area in pairing based cryptography. We try to put some light newlinein this direction. We propose an algorithm for pairing computation by modifying newlinethe algorithm provided by Ionia and Joux.Elementary mathematical structures such as cyclic groups and pairings on genus 1 curves have been used very common in cryptography. Mathematically rich structures are also useful to realize various cryptographic primitives and protocols. Vector decomposition problem is a problem which can be defined on non-cyclic groups. We extend the use of Vector decomposition problem in different cryptographic primitives. We proposed a key agreement scheme based on vector decomposition. Managing digital identity is an important requirement in any network. Managing certificates newlineis too laborious in a large infrastructure network. The identity based encryption newline(IBE) is an alternative to this problem which uses the identity of the entity, to newlinegenerate public parameters and secret key. In IBE scheme, the secret key is generated newlineby a trusted third party called Private Key Generator (PKG). This permits newlinePKG to decrypt any messages sent in the network. Certificateless public key cryptography was another suggestion by Al-Riyami and Paterson [1]. But their system newlineuses two different encryption keys which results in double encryption. We propose newlinea scheme which uses shorter key and has reduced computational complexity. newlineThe advancement in computing facilities made an enormous increase in the amount newlineof digital information. This necessitates reliable and inexpensive ways to manage newlinethe huge storage requirement. Cloud data storage has drawn attention of people newlineas a solution to this requirement... |
Pagination: | ix,96 |
URI: | http://hdl.handle.net/10603/315635 |
Appears in Departments: | Center for Cyber Security Systems and Networks |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 203.58 kB | Adobe PDF | View/Open |
02_certificate.pdf | 221.98 kB | Adobe PDF | View/Open | |
03_declaration.pdf | 156.16 kB | Adobe PDF | View/Open | |
04_contents.pdf | 142.52 kB | Adobe PDF | View/Open | |
05_acknowledgement.pdf | 68.4 kB | Adobe PDF | View/Open | |
06_abbreviation.pdf | 236.04 kB | Adobe PDF | View/Open | |
07_abstract.pdf | 195.63 kB | Adobe PDF | View/Open | |
08_chapter 1.pdf | 379.92 kB | Adobe PDF | View/Open | |
09_chapter 2.pdf | 372.73 kB | Adobe PDF | View/Open | |
10_chapter 3.pdf | 383.63 kB | Adobe PDF | View/Open | |
11_chapter 4.pdf | 401.97 kB | Adobe PDF | View/Open | |
12_chapter 5.pdf | 390 kB | Adobe PDF | View/Open | |
13_chapter 6.pdf | 347.95 kB | Adobe PDF | View/Open | |
14_chapter 7.pdf | 188.93 kB | Adobe PDF | View/Open | |
15_references.pdf | 155.93 kB | Adobe PDF | View/Open | |
16_publications.pdf | 126.1 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 392.87 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: