Design and Analysis of Bilinear Pairing based Cryptosystems

dc.contributor.guideSethumadhavan M
dc.coverage.spatial
dc.creator.researcherPraveen I
dc.date.accessioned2021-02-17T12:08:50Z
dc.date.available2021-02-17T12:08:50Z
dc.date.awarded2019
dc.date.completed2019
dc.date.registered2009
dc.description.abstractPairings 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...
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions
dc.format.extentix,96
dc.identifier.urihttp://hdl.handle.net/10603/315635
dc.languageEnglish
dc.publisher.institutionCenter for Cyber Security Systems and Networks
dc.publisher.placeCoimbatore
dc.publisher.universityAmrita Vishwa Vidyapeetham (University)
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer security
dc.subject.keywordCryptography
dc.subject.keywordData encryption (Computer science)
dc.subject.keywordEngineering and Technology
dc.subject.keywordHomomorphisms (Mathematics)
dc.titleDesign and Analysis of Bilinear Pairing based Cryptosystems
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 17
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
203.58 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_certificate.pdf
Size:
221.98 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_declaration.pdf
Size:
156.16 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_contents.pdf
Size:
142.52 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_acknowledgement.pdf
Size:
68.4 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: