Identity-Based Cryptosystem Based on Tate Pairing

Identity-Based Cryptosystem Based on Tate Pairing

Ramesh Ch

Contact

K Venugopal Rao

Contact

D Vasumathi

Contact

α Jawaharlal Nehru Technological University, Hyderabad

Identity-Based Cryptosystem Based on Tate Pairing

Article Fingerprint

ReserarchID

CSTNWS2FSOR

Identity-Based Cryptosystem Based on Tate Pairing Banner

AI TAKEAWAY

Connecting with the Eternal Ground

Abstract

Tate Pairings on Elliptic curve Cryptography are important because they can be used to build efficient Identity-Based Cryptosystems, as well as their implementation essentially determines the efficiency of cryptosystems. In this work, we propose an identity-based encryption based on Tate Pairing on an elliptic curve. The scheme was chosen ciphertext security in the random oracle model assuming a variant of computational problem Diffie-Hellman . This paper provides precise definitions to encryption schemes based on identity, it studies the construction of the underlying ground field, their extension to enhance the finite field arithmetic and presents a technique to accelerate the time feeding in Tate pairing algorithm.

References

24 Cites in Article

Reference Format

Adi Shamir (1985). Identity-Based Cryptosystems and Signature Schemes.
D Boneh,M Franklin (2001). Identity-based encryption from the Weil pairing.
Kenneth Paterson,Geraint Price (2003). A comparison between traditional public key infrastructures and identity-based cryptography.
W Mao (2004). The Fundamentals of Modern Cryptography.
Joux (2000). A one round protocol for tripartite Diffie-Hellman.
J Menezes,T Okamoto,S Vanstone (1983). Reducing elliptic curve logarithms to a finite field.
L Adleman,M Huang (1999). Function field sieve methods for discrete logarithms over finite fields.
R Sakai,K Ohgishi,M Kasahara (2000). Cryptosystem based on pairing.
O Ahmadi,D Hankerson,A Menezes (2007). Software implementation of arithmetic in F3m.
T Pornin (1999). Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA).
A Atkin,F Morain (1993). Elliptic curves and primality proving.
R Balasubramanian,Neal Koblitz (1998). The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm.
P Barreto,S Galbraith,C ´o,M Scott (2007). Efficient pairing computation on supersingular abelian varieties.
Paulo Barreto,Hae Kim,Ben Lynn,Michael Scott (2002). Efficient Algorithms for Pairing-Based Cryptosystems.
P Barreto,B Lynn,M Scott (2004). Efficient implementation of pairing-based cryptosystems.
Paulo Barreto,Michael Naehrig (2006). Pairing-Friendly Elliptic Curves of Prime Order.
Den Boer (1996). Diffie-Hellman is as strong as discrete log for certain primes.
Boldyreva (2003). Efficient threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme.
X Boneh,H Boyen,Shacham (2004). Short group signatures.
Dan Boneh,Giovanni Di Crescenzo,Rafail Ostrovsky,Giuseppe Persiano (2004). Public Key Encryption with Keyword Search.
Dan Boneh,Matt Franklin (2001). Identity-Based Encryption from the Weil Pairing.
D Boneh,C Gentry,H Shacham,B Lynn (2003). Aggregate and verifiably encrypted signatures from bilinear maps.
Dan Boneh,Ben Lynn,Hovav Shacham (2001). Short Signatures from the Weil Pairing.
M Young (1989). The Technical Writer's Handbook.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Ramesh Ch. 2016. \u201cIdentity-Based Cryptosystem Based on Tate Pairing\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 16 (GJCST Volume 16 Issue E5): .

More Citation Formats

Select Citation Style:

Download Citation

Download Article

GJCST Volume 16 Issue E5
Pg. 31- 35

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-E Classification: E.3, D.4.6

Submission ReceivedDecember 9, 2015
Peer Review Double Blind
Handling Editor
Accepted January 3, 2016
Published January 15, 2016

Version of record

v1.2

Issue date

July 19, 2016

Language

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Score: 103

Country: India

Subject: Global Journal of Computer Science and Technology - E: Network, Web & Security

Authors: Ramesh Ch, K Venugopal Rao, D Vasumathi (PhD/Dr. count: 0)

View Count (all-time): 272

Total Views (Real + Logic): 7229

Total Downloads (simulated): 1853

Publish Date: 2016 11, Sun

Monthly Totals (Real + Logic):

Month 1: 58 views
Month 2: 47 views
Month 3: 35 views
Month 4: 46 views
Month 5: 50 views
Month 6: 27 views
Month 7: 22 views
Month 8: 29 views
Month 9: 45 views
Month 10: 30 views
Month 11: 39 views
Month 12: 23 views
Month 13: 26 views
Month 14: 31 views
Month 15: 22 views
Month 16: 23 views
Month 17: 24 views
Month 18: 39 views
Month 19: 23 views
Month 20: 42 views
Month 21: 16 views
Month 22: 43 views
Month 23: 35 views
Month 24: 22 views
Month 25: 41 views
Month 26: 19 views
Month 27: 32 views
Month 28: 29 views
Month 29: 33 views
Month 30: 37 views
Month 31: 24 views
Month 32: 40 views
Month 33: 44 views
Month 34: 38 views
Month 35: 29 views
Month 36: 33 views
Month 37: 20 views
Month 38: 36 views
Month 39: 29 views
Month 40: 32 views
Month 41: 23 views
Month 42: 35 views
Month 43: 28 views
Month 44: 38 views
Month 45: 23 views
Month 46: 25 views
Month 47: 24 views
Month 48: 23 views
Month 49: 27 views
Month 50: 47 views
Month 51: 38 views
Month 52: 18 views
Month 53: 46 views
Month 54: 31 views
Month 55: 33 views
Month 56: 22 views
Month 57: 38 views
Month 58: 14 views
Month 59: 31 views
Month 60: 31 views
Month 61: 48 views
Month 62: 33 views
Month 63: 43 views
Month 64: 33 views
Month 65: 20 views
Month 66: 22 views
Month 67: 34 views
Month 68: 39 views
Month 69: 43 views
Month 70: 33 views
Month 71: 43 views
Month 72: 24 views
Month 73: 30 views
Month 74: 21 views
Month 75: 22 views
Month 76: 37 views
Month 77: 24 views
Month 78: 17 views
Month 79: 15 views
Month 80: 34 views
Month 81: 18 views
Month 82: 14 views
Month 83: 35 views
Month 84: 33 views
Month 85: 29 views
Month 86: 40 views
Month 87: 31 views
Month 88: 18 views
Month 89: 21 views
Month 90: 31 views
Month 91: 21 views
Month 92: 31 views
Month 93: 24 views
Month 94: 22 views
Month 95: 21 views
Month 96: 18 views
Month 97: 12 views
Month 98: 43 views
Month 99: 33 views
Month 100: 43 views
Month 101: 25 views
Month 102: 41 views
Month 103: 30 views
Month 104: 27 views
Month 105: 19 views
Month 106: 33 views
Month 107: 43 views
Month 108: 20 views
Month 109: 34 views
Month 110: 45 views
Month 111: 45 views
Month 112: 47 views
Month 113: 44 views
Month 114: 27 views

Total Views: 7229

Total Downloads: 1853

2026 Trends

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]