Cite this DOI

Hari Prasad, P., Gangadhara Rao, D. K., & Rao, D. B. (2018). Pattern Based Homomorphic Encryption Technique for Minimizing Computation and CommunicationOverhead. *Journal of Science & Technology*, *03*(02), 11–17. https://doi.org/10.46243/jstj.2018.v3.i2.157

@article{hariprasad2018pattern,
  author    = {Hari Prasad, P.Venkata and Gangadhara Rao, Dr. K. and Rao, Dr. B.Basaveswara},
  title     = {{Pattern Based Homomorphic Encryption Technique for Minimizing Computation and CommunicationOverhead}},
  journal   = {Journal of Science \& Technology},
  year      = {2018},
  month     = {mar},
  volume    = {03},
  number    = {02},
  pages     = {11--17},
  publisher = {Longman Publishers},
  issn      = {2456-5660},
  doi       = {10.46243/jstj.2018.v3.i2.157},
  url       = {https://doi.org/10.46243/jstj.2018.v3.i2.157},
  language  = {en},
  abstract  = {Securing private information and distribution plays a vital role in distributed environment against the unauthorized users. Server information can be distributed to the authorized users based on the user’s identity. Traditional identity based attack which breaks the user’s identity and privacy during the communication process. Existing attribute based encryption and decryption process relay on policy tree structure and number of attributes in the setup phase. Due to identity based attacks, data communication within oroutside the network changed or spoofed. Network communication cost increases as the number of users within the network increases. In order to overcome identity based attacks, a new pattern based user’s identity or policy structure was implemented in this paper. In this work, each attributes along with user’s policies are defined in the form of patterns. Each pattern has three parts with three operations namely policy AND, policy OR and policy ANY. During set up phase and encryption phase each user’s profile is constructed in the form of patterns. Proposed pattern based mechanism minimizes the policy search space and decryption time during data communication. Experimental result shows that proposed approach completely protects against theidentity attacks by minimizing the communication and storageoverhead}
}

TY  - JOUR
TI  - Pattern Based Homomorphic Encryption Technique for Minimizing Computation and CommunicationOverhead
AU  - Hari Prasad, P.Venkata
AU  - Gangadhara Rao, Dr. K.
AU  - Rao, Dr. B.Basaveswara
JO  - Journal of Science & Technology
PY  - 2018
DA  - 2018/03/01/
VL  - 03
IS  - 02
SP  - 11
EP  - 17
PB  - Longman Publishers
SN  - 2456-5660
LA  - en
AB  - Securing private information and distribution plays a vital role in distributed environment against the unauthorized users. Server information can be distributed to the authorized users based on the user’s identity. Traditional identity based attack which breaks the user’s identity and privacy during the communication process. Existing attribute based encryption and decryption process relay on policy tree structure and number of attributes in the setup phase. Due to identity based attacks, data communication within oroutside the network changed or spoofed. Network communication cost increases as the number of users within the network increases. In order to overcome identity based attacks, a new pattern based user’s identity or policy structure was implemented in this paper. In this work, each attributes along with user’s policies are defined in the form of patterns. Each pattern has three parts with three operations namely policy AND, policy OR and policy ANY. During set up phase and encryption phase each user’s profile is constructed in the form of patterns. Proposed pattern based mechanism minimizes the policy search space and decryption time during data communication. Experimental result shows that proposed approach completely protects against theidentity attacks by minimizing the communication and storageoverhead
DO  - 10.46243/jstj.2018.v3.i2.157
UR  - https://doi.org/10.46243/jstj.2018.v3.i2.157
ER  -

{
    "type": "article-journal",
    "id": "10.46243/jstj.2018.v3.i2.157",
    "DOI": "10.46243/jstj.2018.v3.i2.157",
    "URL": "https://doi.org/10.46243/jstj.2018.v3.i2.157",
    "title": "Pattern Based Homomorphic Encryption Technique for Minimizing Computation and CommunicationOverhead",
    "source": "Smart Scholars DOI Registry",
    "container-title": "Journal of Science & Technology",
    "author": [
        {
            "family": "Hari Prasad",
            "given": "P.Venkata"
        },
        {
            "family": "Gangadhara Rao",
            "given": "Dr. K."
        },
        {
            "family": "Rao",
            "given": "Dr. B.Basaveswara"
        }
    ],
    "issued": {
        "date-parts": [
            [
                2018,
                3,
                1
            ]
        ]
    },
    "volume": "03",
    "issue": "02",
    "page": "11-17",
    "publisher": "Longman Publishers",
    "language": "en",
    "abstract": "Securing private information and distribution plays a vital role in distributed environment against the unauthorized users. Server information can be distributed to the authorized users based on the user’s identity. Traditional identity based attack which breaks the user’s identity and privacy during the communication process. Existing attribute based encryption and decryption process relay on policy tree structure and number of attributes in the setup phase. Due to identity based attacks, data communication within oroutside the network changed or spoofed. Network communication cost increases as the number of users within the network increases. In order to overcome identity based attacks, a new pattern based user’s identity or policy structure was implemented in this paper. In this work, each attributes along with user’s policies are defined in the form of patterns. Each pattern has three parts with three operations namely policy AND, policy OR and policy ANY. During set up phase and encryption phase each user’s profile is constructed in the form of patterns. Proposed pattern based mechanism minimizes the policy search space and decryption time during data communication. Experimental result shows that proposed approach completely protects against theidentity attacks by minimizing the communication and storageoverhead",
    "ISSN": "2456-5660"
}

From the record as registered (version 2) — the record and its history. Programs: https://registry.smartscholars.in/api.php?action=cite&doi=10.46243%2Fjstj.2018.v3.i2.157 gives all four in one JSON answer.