{ "ok": true, "doi": "10.46243/jstj.2017.v2.i4.215", "events": [ { "seq": 1, "kind": "register", "at": "2026-09-29 22:00:37", "by": "Administrator (admin)", "by_kind": "user", "note": "registered at Crossref; record read from api.crossref.org", "changes": [ { "path": "abstract.lang", "from": null, "to": "en" }, { "path": "abstract.value", "from": null, "to": "Present day’s definition of protection of publickey finding encryption idea take find time linear with the II. RELATED WORK total number of the cipher texts. This makes renewal from large-scale databases preventing. To eradicate this problem, Present definition protection PEKS chart take find time linear this paper introduce finding Public-Key Cipher texts with with number of cipher texts. This makes improve from largeHidden Structures (SPCHS) for keyword find as quick as scale databases excessive. Therefore, more efficient search possible without losing definition protection of the encrypted performance is crucial for practically expand PEKS chart" }, { "path": "agents.0.name.family", "from": null, "to": "Mishra" }, { "path": "agents.0.name.given", "from": null, "to": "Virsha" }, { "path": "agents.0.role", "from": null, "to": "author" }, { "path": "agents.0.sequence", "from": null, "to": "first" }, { "path": "agents.1.name.family", "from": null, "to": "Dr.B.Sujatha" }, { "path": "agents.1.name.given", "from": null, "to": "" }, { "path": "agents.1.role", "from": null, "to": "author" }, { "path": "agents.1.sequence", "from": null, "to": "additional" }, { "path": "agents.2.name.org", "from": null, "to": "Longman Publishers" }, { "path": "agents.2.role", "from": null, "to": "publisher" }, { "path": "characters.0", "from": null, "to": "Language" }, { "path": "container.identifiers.0.medium", "from": null, "to": "electronic" }, { "path": "container.identifiers.0.type", "from": null, "to": "ISSN" }, { "path": "container.identifiers.0.value", "from": null, "to": "2456-5660" }, { "path": "container.issue", "from": null, "to": "04" }, { "path": "container.pages.first", "from": null, "to": "56" }, { "path": "container.pages.last", "from": null, "to": "58" }, { "path": "container.titles.0.type", "from": null, "to": "PrincipalTitle" }, { "path": "container.titles.0.value", "from": null, "to": "Journal of Science & Technology" }, { "path": "container.type", "from": null, "to": "Journal" }, { "path": "container.volume", "from": null, "to": "02" }, { "path": "dates.date_type", "from": null, "to": "PublicationDate" }, { "path": "dates.online", "from": null, "to": "2017-07-18" }, { "path": "dates.published", "from": null, "to": "2017-07-18" }, { "path": "doi", "from": null, "to": "10.46243/jstj.2017.v2.i4.215" }, { "path": "format", "from": null, "to": "smartscholars-doi-metadata/1.0" }, { "path": "identifiers.0.type", "from": null, "to": "DOI" }, { "path": "identifiers.0.value", "from": null, "to": "10.46243/jstj.2017.v2.i4.215" }, { "path": "language", "from": null, "to": "en" }, { "path": "license.applies_to", "from": null, "to": "vor" }, { "path": "license.start", "from": null, "to": "2017-07-18" }, { "path": "license.url", "from": null, "to": "https://creativecommons.org/licenses/by/4.0/" }, { "path": "links.0.primary", "from": null, "to": true }, { "path": "links.0.return_type", "from": null, "to": "text/html" }, { "path": "links.0.url", "from": null, "to": "https://www.jst.org.in/index.php/pub/article/view/215" }, { "path": "links.1.purpose", "from": null, "to": "text-mining" }, { "path": "links.1.return_type", "from": null, "to": "application/pdf" }, { "path": "links.1.url", "from": null, "to": "https://www.jst.org.in/index.php/pub/article/download/215/192" }, { "path": "links.2.purpose", "from": null, "to": "text-mining" }, { "path": "links.2.return_type", "from": null, "to": "application/xml" }, { "path": "links.2.url", "from": null, "to": "https://www.jst.org.in/index.php/pub/article/download/215/3509" }, { "path": "links.3.purpose", "from": null, "to": "similarity-checking" }, { "path": "links.3.url", "from": null, "to": "https://www.jst.org.in/index.php/pub/article/view/215/192" }, { "path": "modes.0", "from": null, "to": "Visual" }, { "path": "record.issue_number", "from": null, "to": 1 }, { "path": "record.registered", "from": null, "to": "2026-09-08" }, { "path": "record.registrant", "from": null, "to": "Longman Publishers" }, { "path": "record.source", "from": null, "to": "crossref-api" }, { "path": "record.source_agency", "from": null, "to": "Crossref (member 25296)" }, { "path": "record.updated", "from": null, "to": "2026-09-20" }, { "path": "references.0.doi", "from": null, "to": "10.1007/978-3-540-24676-3_30" }, { "path": "references.0.key", "from": null, "to": "ref1" }, { "path": "references.0.unstructured", "from": null, "to": "Joneh D., Crescenzo G. D., Ostrovsky R., Persiano G.: Public Key Encryption with Keyword Search. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)" }, { "path": "references.1.doi", "from": null, "to": "10.1007/978-3-540-74143-5_30" }, { "path": "references.1.key", "from": null, "to": "ref2" }, { "path": "references.1.unstructured", "from": null, "to": "Bellare M., Boldyreva A., O’Neill A.: Deterministic and Efficiently Searchable Encryption. In: Menezes A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535-552. Springer, Heidelberg (2007)" }, { "path": "references.10.doi", "from": null, "to": "10.1007/3-540-44647-8_13" }, { "path": "references.10.key", "from": null, "to": "ref11" }, { "path": "references.10.unstructured", "from": null, "to": "Boneh D., Franklin M.: Identity-Based Encryption from the Weil Pairing. In: Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213- 239. Springer, Heidelberg (2001)" }, { "path": "references.11.doi", "from": null, "to": "10.1007/11889663_4" }, { "path": "references.11.key", "from": null, "to": "ref12" }, { "path": "references.11.unstructured", "from": null, "to": "Barth A., Boneh D., Waters B.: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption. In: Di Crescenzo G., Rubin A.(eds.) FC 2006. LNCS, vol. 4107, pp. 52-64. Springer, Heidelberg (2006)" }, { "path": "references.12.doi", "from": null, "to": "10.1007/978-3-642-30057-8_13" }, { "path": "references.12.key", "from": null, "to": "ref13" }, { "path": "references.12.unstructured", "from": null, "to": "Libert B., Paterson K. G., Quaglia E. A.: Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 206-224. Springer, Heidelberg (2012)" }, { "path": "references.13.doi", "from": null, "to": "10.1145/1180405.1180417" }, { "path": "references.13.key", "from": null, "to": "ref14" }, { "path": "references.13.unstructured", "from": null, "to": "Curtmola R., Garay J., Kamara S., Ostrovsky R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79-88. ACM (2006)" }, { "path": "references.14.doi", "from": null, "to": "10.1109/secpri.2000.848445" }, { "path": "references.14.key", "from": null, "to": "ref15" }, { "path": "references.14.unstructured", "from": null, "to": "Song D. X., Wagner D., Perrig A.: Practical techniques for searches on encrypted data. In: IEEE S&P 2000, pp. 44-55. IEEE (2000) Journal of Science and Technology (ISSN: 2456-5660), Volume 2, Special Issue 1, July 2017 58" }, { "path": "references.2.doi", "from": null, "to": "10.1007/978-3-540-24676-3_14" }, { "path": "references.2.key", "from": null, "to": "ref3" }, { "path": "references.2.unstructured", "from": null, "to": "Boneh D., Boyen X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)" }, { "path": "references.3.doi", "from": null, "to": "10.1007/11818175_17" }, { "path": "references.3.key", "from": null, "to": "ref4" }, { "path": "references.3.unstructured", "from": null, "to": "Boyen X., Waters B. R.: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290-307. Springer, Heidelberg (2006)" }, { "path": "references.4.doi", "from": null, "to": "10.1007/11761679_27" }, { "path": "references.4.key", "from": null, "to": "ref5" }, { "path": "references.4.unstructured", "from": null, "to": "Gentry C.: Practical Identity-Based Encyrption Without Random Oracles. In: Vaudenay S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp.445-464. Springer, Heidelberg (2006)" }, { "path": "references.5.doi", "from": null, "to": "10.1007/978-3-642-00862-7_3" }, { "path": "references.5.key", "from": null, "to": "ref6" }, { "path": "references.5.unstructured", "from": null, "to": "Ateniese G., Gasti P.: Universally Anonymous IBE Based on the Quadratic Residuosity Assumption. In: Fischlin M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 32-47. Springer, Heidelberg (2009)" }, { "path": "references.6.doi", "from": null, "to": "10.1007/978-3-642-11925-5_11" }, { "path": "references.6.key", "from": null, "to": "ref7" }, { "path": "references.6.unstructured", "from": null, "to": "Ducas L.: Anonymity from Asymmetry: New Constructions for Anonymous HIBE. In: Pieprzyk J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 148-164. Springer, Heidelberg (2010)" }, { "path": "references.7.doi", "from": null, "to": "10.1007/s00145-013-9153-x" }, { "path": "references.7.key", "from": null, "to": "ref8" }, { "path": "references.7.unstructured", "from": null, "to": "Abdalla M., Catalano D., Fiore D.: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3), pp. 544-593 (2013)" }, { "path": "references.8.doi", "from": null, "to": "10.1007/978-3-642-40041-4_28" }, { "path": "references.8.key", "from": null, "to": "ref9" }, { "path": "references.8.unstructured", "from": null, "to": "Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology-CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013)" }, { "path": "references.9.doi", "from": null, "to": "10.1007/978-3-642-38348-9_1" }, { "path": "references.9.key", "from": null, "to": "ref10" }, { "path": "references.9.unstructured", "from": null, "to": "Garg S., Gentry C., Halevi S.: Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P. (eds.) Advances in Cryptology-EUROCRYPT 2013. LNCS, vol. 7881, pp. 1-17. Springer, Heidelberg (2013)" }, { "path": "referent", "from": null, "to": "Creation" }, { "path": "structural_type", "from": null, "to": "Digital" }, { "path": "titles.0.lang", "from": null, "to": "en" }, { "path": "titles.0.type", "from": null, "to": "PrincipalTitle" }, { "path": "titles.0.value", "from": null, "to": "Generating Searchable Public-Key Cipher Texts with Hidden Structures for Fast Keyword Search" }, { "path": "type", "from": null, "to": "JournalArticle" } ], "record_after": { "format": "smartscholars-doi-metadata/1.0", "doi": "10.46243/jstj.2017.v2.i4.215", "referent": "Creation", "type": "JournalArticle", "structural_type": "Digital", "modes": [ "Visual" ], "characters": [ "Language" ], "titles": [ { "value": "Generating Searchable Public-Key Cipher Texts with Hidden Structures for Fast Keyword Search", "type": "PrincipalTitle", "lang": "en" } ], "identifiers": [ { "type": "DOI", "value": "10.46243/jstj.2017.v2.i4.215" } ], "agents": [ { "role": "author", "name": { "given": "Virsha", "family": "Mishra" }, "sequence": "first" }, { "role": "author", "name": { "given": "", "family": "Dr.B.Sujatha" }, "sequence": "additional" }, { "role": "publisher", "name": { "org": "Longman Publishers" } } ], "dates": { "published": "2017-07-18", "date_type": "PublicationDate", "online": "2017-07-18" }, "language": "en", "container": { "type": "Journal", "titles": [ { "value": "Journal of Science & Technology", "type": "PrincipalTitle" } ], "identifiers": [ { "type": "ISSN", "value": "2456-5660", "medium": "electronic" } ], "volume": "02", "issue": "04", "pages": { "first": "56", "last": "58" } }, "links": [ { "url": "https://www.jst.org.in/index.php/pub/article/view/215", "return_type": "text/html", "primary": true }, { "url": "https://www.jst.org.in/index.php/pub/article/download/215/192", "purpose": "text-mining", "return_type": "application/pdf" }, { "url": "https://www.jst.org.in/index.php/pub/article/download/215/3509", "purpose": "text-mining", "return_type": "application/xml" }, { "url": "https://www.jst.org.in/index.php/pub/article/view/215/192", "purpose": "similarity-checking" } ], "abstract": { "value": "Present day’s definition of protection of publickey finding encryption idea take find time linear with the II. RELATED WORK total number of the cipher texts. This makes renewal from large-scale databases preventing. To eradicate this problem, Present definition protection PEKS chart take find time linear this paper introduce finding Public-Key Cipher texts with with number of cipher texts. This makes improve from largeHidden Structures (SPCHS) for keyword find as quick as scale databases excessive. Therefore, more efficient search possible without losing definition protection of the encrypted performance is crucial for practically expand PEKS chart", "lang": "en" }, "license": { "url": "https://creativecommons.org/licenses/by/4.0/", "start": "2017-07-18", "applies_to": "vor" }, "references": [ { "key": "ref1", "doi": "10.1007/978-3-540-24676-3_30", "unstructured": "Joneh D., Crescenzo G. D., Ostrovsky R., Persiano G.: Public Key Encryption with Keyword Search. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)" }, { "key": "ref2", "doi": "10.1007/978-3-540-74143-5_30", "unstructured": "Bellare M., Boldyreva A., O’Neill A.: Deterministic and Efficiently Searchable Encryption. In: Menezes A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535-552. Springer, Heidelberg (2007)" }, { "key": "ref3", "doi": "10.1007/978-3-540-24676-3_14", "unstructured": "Boneh D., Boyen X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)" }, { "key": "ref4", "doi": "10.1007/11818175_17", "unstructured": "Boyen X., Waters B. R.: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290-307. Springer, Heidelberg (2006)" }, { "key": "ref5", "doi": "10.1007/11761679_27", "unstructured": "Gentry C.: Practical Identity-Based Encyrption Without Random Oracles. In: Vaudenay S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp.445-464. Springer, Heidelberg (2006)" }, { "key": "ref6", "doi": "10.1007/978-3-642-00862-7_3", "unstructured": "Ateniese G., Gasti P.: Universally Anonymous IBE Based on the Quadratic Residuosity Assumption. In: Fischlin M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 32-47. Springer, Heidelberg (2009)" }, { "key": "ref7", "doi": "10.1007/978-3-642-11925-5_11", "unstructured": "Ducas L.: Anonymity from Asymmetry: New Constructions for Anonymous HIBE. In: Pieprzyk J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 148-164. Springer, Heidelberg (2010)" }, { "key": "ref8", "doi": "10.1007/s00145-013-9153-x", "unstructured": "Abdalla M., Catalano D., Fiore D.: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3), pp. 544-593 (2013)" }, { "key": "ref9", "doi": "10.1007/978-3-642-40041-4_28", "unstructured": "Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology-CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013)" }, { "key": "ref10", "doi": "10.1007/978-3-642-38348-9_1", "unstructured": "Garg S., Gentry C., Halevi S.: Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P. (eds.) Advances in Cryptology-EUROCRYPT 2013. LNCS, vol. 7881, pp. 1-17. Springer, Heidelberg (2013)" }, { "key": "ref11", "doi": "10.1007/3-540-44647-8_13", "unstructured": "Boneh D., Franklin M.: Identity-Based Encryption from the Weil Pairing. In: Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213- 239. Springer, Heidelberg (2001)" }, { "key": "ref12", "doi": "10.1007/11889663_4", "unstructured": "Barth A., Boneh D., Waters B.: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption. In: Di Crescenzo G., Rubin A.(eds.) FC 2006. LNCS, vol. 4107, pp. 52-64. Springer, Heidelberg (2006)" }, { "key": "ref13", "doi": "10.1007/978-3-642-30057-8_13", "unstructured": "Libert B., Paterson K. G., Quaglia E. A.: Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 206-224. Springer, Heidelberg (2012)" }, { "key": "ref14", "doi": "10.1145/1180405.1180417", "unstructured": "Curtmola R., Garay J., Kamara S., Ostrovsky R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79-88. ACM (2006)" }, { "key": "ref15", "doi": "10.1109/secpri.2000.848445", "unstructured": "Song D. X., Wagner D., Perrig A.: Practical techniques for searches on encrypted data. In: IEEE S&P 2000, pp. 44-55. IEEE (2000) Journal of Science and Technology (ISSN: 2456-5660), Volume 2, Special Issue 1, July 2017 58" } ], "record": { "registrant": "Longman Publishers", "registered": "2026-09-08", "updated": "2026-09-20", "issue_number": 1, "source": "crossref-api", "source_agency": "Crossref (member 25296)" } }, "url_after": "https://www.jst.org.in/index.php/pub/article/view/215", "sha256_before": null, "sha256_after": "fe4f7015305df3c1830591d3b20285b17126d31bf21313de5f554ea89d419310" }, { "seq": 2, "kind": "update", "at": "2026-09-29 23:59:57", "by": "Administrator (admin)", "by_kind": "user", "note": "record re-read from api.crossref.org", "changes": [ { "path": "container.titles.0.value", "from": "Journal of Science & Technology", "to": "Journal of Science & Technology" } ], "record_after": { "format": "smartscholars-doi-metadata/1.0", "doi": "10.46243/jstj.2017.v2.i4.215", "referent": "Creation", "type": "JournalArticle", "structural_type": "Digital", "modes": [ "Visual" ], "characters": [ "Language" ], "titles": [ { "value": "Generating Searchable Public-Key Cipher Texts with Hidden Structures for Fast Keyword Search", "type": "PrincipalTitle", "lang": "en" } ], "identifiers": [ { "type": "DOI", "value": "10.46243/jstj.2017.v2.i4.215" } ], "agents": [ { "role": "author", "name": { "given": "Virsha", "family": "Mishra" }, "sequence": "first" }, { "role": "author", "name": { "given": "", "family": "Dr.B.Sujatha" }, "sequence": "additional" }, { "role": "publisher", "name": { "org": "Longman Publishers" } } ], "dates": { "published": "2017-07-18", "date_type": "PublicationDate", "online": "2017-07-18" }, "language": "en", "container": { "type": "Journal", "titles": [ { "value": "Journal of Science & Technology", "type": "PrincipalTitle" } ], "identifiers": [ { "type": "ISSN", "value": "2456-5660", "medium": "electronic" } ], "volume": "02", "issue": "04", "pages": { "first": "56", "last": "58" } }, "links": [ { "url": "https://www.jst.org.in/index.php/pub/article/view/215", "return_type": "text/html", "primary": true }, { "url": "https://www.jst.org.in/index.php/pub/article/download/215/192", "purpose": "text-mining", "return_type": "application/pdf" }, { "url": "https://www.jst.org.in/index.php/pub/article/download/215/3509", "purpose": "text-mining", "return_type": "application/xml" }, { "url": "https://www.jst.org.in/index.php/pub/article/view/215/192", "purpose": "similarity-checking" } ], "abstract": { "value": "Present day’s definition of protection of publickey finding encryption idea take find time linear with the II. RELATED WORK total number of the cipher texts. This makes renewal from large-scale databases preventing. To eradicate this problem, Present definition protection PEKS chart take find time linear this paper introduce finding Public-Key Cipher texts with with number of cipher texts. This makes improve from largeHidden Structures (SPCHS) for keyword find as quick as scale databases excessive. Therefore, more efficient search possible without losing definition protection of the encrypted performance is crucial for practically expand PEKS chart", "lang": "en" }, "license": { "url": "https://creativecommons.org/licenses/by/4.0/", "start": "2017-07-18", "applies_to": "vor" }, "references": [ { "key": "ref1", "doi": "10.1007/978-3-540-24676-3_30", "unstructured": "Joneh D., Crescenzo G. D., Ostrovsky R., Persiano G.: Public Key Encryption with Keyword Search. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)" }, { "key": "ref2", "doi": "10.1007/978-3-540-74143-5_30", "unstructured": "Bellare M., Boldyreva A., O’Neill A.: Deterministic and Efficiently Searchable Encryption. In: Menezes A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 535-552. Springer, Heidelberg (2007)" }, { "key": "ref3", "doi": "10.1007/978-3-540-24676-3_14", "unstructured": "Boneh D., Boyen X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223-238. Springer, Heidelberg (2004)" }, { "key": "ref4", "doi": "10.1007/11818175_17", "unstructured": "Boyen X., Waters B. R.: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290-307. Springer, Heidelberg (2006)" }, { "key": "ref5", "doi": "10.1007/11761679_27", "unstructured": "Gentry C.: Practical Identity-Based Encyrption Without Random Oracles. In: Vaudenay S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp.445-464. Springer, Heidelberg (2006)" }, { "key": "ref6", "doi": "10.1007/978-3-642-00862-7_3", "unstructured": "Ateniese G., Gasti P.: Universally Anonymous IBE Based on the Quadratic Residuosity Assumption. In: Fischlin M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 32-47. Springer, Heidelberg (2009)" }, { "key": "ref7", "doi": "10.1007/978-3-642-11925-5_11", "unstructured": "Ducas L.: Anonymity from Asymmetry: New Constructions for Anonymous HIBE. In: Pieprzyk J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 148-164. Springer, Heidelberg (2010)" }, { "key": "ref8", "doi": "10.1007/s00145-013-9153-x", "unstructured": "Abdalla M., Catalano D., Fiore D.: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3), pp. 544-593 (2013)" }, { "key": "ref9", "doi": "10.1007/978-3-642-40041-4_28", "unstructured": "Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology-CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013)" }, { "key": "ref10", "doi": "10.1007/978-3-642-38348-9_1", "unstructured": "Garg S., Gentry C., Halevi S.: Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P. (eds.) Advances in Cryptology-EUROCRYPT 2013. LNCS, vol. 7881, pp. 1-17. Springer, Heidelberg (2013)" }, { "key": "ref11", "doi": "10.1007/3-540-44647-8_13", "unstructured": "Boneh D., Franklin M.: Identity-Based Encryption from the Weil Pairing. In: Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213- 239. Springer, Heidelberg (2001)" }, { "key": "ref12", "doi": "10.1007/11889663_4", "unstructured": "Barth A., Boneh D., Waters B.: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption. In: Di Crescenzo G., Rubin A.(eds.) FC 2006. LNCS, vol. 4107, pp. 52-64. Springer, Heidelberg (2006)" }, { "key": "ref13", "doi": "10.1007/978-3-642-30057-8_13", "unstructured": "Libert B., Paterson K. G., Quaglia E. A.: Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 206-224. Springer, Heidelberg (2012)" }, { "key": "ref14", "doi": "10.1145/1180405.1180417", "unstructured": "Curtmola R., Garay J., Kamara S., Ostrovsky R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79-88. ACM (2006)" }, { "key": "ref15", "doi": "10.1109/secpri.2000.848445", "unstructured": "Song D. X., Wagner D., Perrig A.: Practical techniques for searches on encrypted data. In: IEEE S&P 2000, pp. 44-55. IEEE (2000) Journal of Science and Technology (ISSN: 2456-5660), Volume 2, Special Issue 1, July 2017 58" } ], "record": { "registrant": "Longman Publishers", "registered": "2026-09-08", "updated": "2026-09-20", "issue_number": 1, "source": "crossref-api", "source_agency": "Crossref (member 25296)" } }, "url_after": "https://www.jst.org.in/index.php/pub/article/view/215", "sha256_before": "fe4f7015305df3c1830591d3b20285b17126d31bf21313de5f554ea89d419310", "sha256_after": "2412ad1964dd03d7685aac38a6f778de5d42bccb9e550ee9d876daace26b0e22" } ] }