default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDV. Ch. Venkaiah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j20]Umesh Kumar, Vadlamudi Ch. Venkaiah:
A novel stream cipher based on quasigroups and QG-PRNG. Int. J. Inf. Comput. Secur. 22(3/4): 411-435 (2023)- 2022
- [j19]Umesh Kumar, V. Ch. Venkaiah:
An Efficient Message Authentication Code Based on Modified MD5-384 Bits Hash Function and Quasigroup. Int. J. Cloud Appl. Comput. 12(1): 1-27 (2022) - 2021
- [j18]Ajeet Singh
, Appala Naidu Tentu, V. Ch. Venkaiah:
A dynamic key management paradigm for secure wireless ad hoc network communications. Int. J. Inf. Comput. Secur. 14(3/4): 380-402 (2021) - 2020
- [j17]Abdul Basit, Patibandla Chanakya, V. Ch. Venkaiah, Salman Abdul Moiz:
New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure. Int. J. Commun. Networks Distributed Syst. 24(4): 357-380 (2020) - [j16]Jyoti Lamba, V. Ch. Venkaiah:
Privacy-preserving frequent itemset mining in vertically partitioned database using symmetric homomorphic encryption scheme. Int. J. Inf. Priv. Secur. Integr. 4(3): 203-225 (2020) - 2019
- [j15]China Venkaiah Vadlamudi, Sesha Phani Deepika Vadlamudi:
A novel self-healing key distribution scheme based on vector space access structure and MDS codes. Int. J. Commun. Syst. 32(16) (2019) - [j14]N. Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, V. Ch. Venkaiah:
Subgroup Operations in Identity Based Encryption Using Weil Pairing for Decentralized Networks. Int. J. Netw. Secur. 21(6): 930-936 (2019) - 2018
- [j13]Harsha Putla, Chanakya Patibandla, China Venkaiah Vadlamudi:
A Reusable Multipartite Secret Sharing Scheme Based on Superincreasing Sequence. Int. J. Netw. Secur. 20(3): 527-535 (2018) - [j12]Appala Naidu Tentu, China Venkaiah Vadlamudi, V. Kamakshi Prasad:
CRT based multi-secret sharing schemes: revisited. Int. J. Secur. Networks 13(1): 1-9 (2018) - 2016
- [j11]Dileep Kumar Pattipati, Appala Naidu Tentu, V. Ch. Venkaiah, Allam Appa Rao:
Sequential Secret Sharing Scheme Based on Level Ordered Access Structure. Int. J. Netw. Secur. 18(5): 874-881 (2016) - 2014
- [j10]Appala Naidu Tentu, Prabal Paul, V. Ch. Venkaiah:
Computationally perfect compartmented secret sharing schemes based on MDS codes. Int. J. Trust. Manag. Comput. Commun. 2(4): 353-378 (2014) - 2012
- [j9]Vadlamudi Ch. Venkaiah, T. Aaron Gulliver:
Quasi-cyclic codes over F13 and enumeration of defining polynomials. J. Discrete Algorithms 16: 249-257 (2012) - 2011
- [j8]V. Ch. Venkaiah, D. M. Vinod Kumar:
Fuzzy adaptive bacterial foraging congestion management using sensitivity based optimal active power re-scheduling of generators. Appl. Soft Comput. 11(8): 4921-4930 (2011) - [j7]Kishore Yadav, Satish Varagani, Kishore Kothapalli, V. Ch. Venkaiah:
Acyclic vertex coloring of graphs of maximum degree 5. Discret. Math. 311(5): 342-348 (2011) - 2009
- [j6]Satish Varagani, V. Ch. Venkaiah, Kishore Yadav, Kishore Kothapalli:
Acyclic Vertex Coloring of Graphs of Maximum Degree Six. Electron. Notes Discret. Math. 35: 177-182 (2009) - 2008
- [j5]K. Ramanjaneyulu, V. Ch. Venkaiah, Kishore Kothapalli:
Anti-magic labellings of a class of planar graphs. Australas. J Comb. 41: 283-290 (2008) - 2005
- [j4]Mukul S. Bansal, V. Ch. Venkaiah:
A note on finding a maximum clique in a graph using BDDs. Australas. J Comb. 32: 253-258 (2005) - 1996
- [j3]Eric A. Lord, V. Ch. Venkaiah, Syamal Kumar Sen:
A shrinking polytope method for linear programming. Neural Parallel Sci. Comput. 4(3): 325-340 (1996) - 1994
- [j2]V. Ch. Venkaiah, Arogyaswami Paulraj:
Subspace rotation using modified Householder transforms and projection matrices - Robustness of DOA algorithms. Signal Process. 36(1): 91-98 (1994) - 1990
- [j1]Eric A. Lord, Syamal Kumar Sen, V. Ch. Venkaiah:
A concise algorithm to solve over-/under-determined linear systems. Simul. 54(5): 239-240 (1990)
Conference and Workshop Papers
- 2021
- [c6]Y. Narasimhulu, Ashok Suthar, Raghunadh Pasunuri, China Venkaiah Vadlamudi:
CKD-Tree: An Improved KD-Tree Construction Algorithm. ISIC 2021: 211-218 - 2017
- [c5]Appala Naidu Tentu, Abdul Basit, K. Bhavani, V. Ch. Venkaiah:
Multi-secret Sharing Scheme for Level-Ordered Access Structures. NuTMiC 2017: 267-278 - 2015
- [c4]Appala Naidu Tentu, Banita Mahapatra, V. Ch. Venkaiah, V. Kamakshi Prasad:
New secret sharing scheme for multipartite access structures with threshold changeability. ICACCI 2015: 1910-1916 - 2014
- [c3]Appala Naidu Tentu, Prabal Paul, V. Ch. Venkaiah:
Computationally Perfect Secret Sharing Scheme Based on Error-Correcting Codes. SNDS 2014: 251-262 - [c2]Dileep Kumar Pattipati, Appala Naidu Tentu, V. Ch. Venkaiah:
Ideal and Computationally Perfect Secret Sharing Schemes for Generalized Access Structures. SSCC 2014: 149-161 - 2013
- [c1]Appala Naidu Tentu, Prabal Paul, China Venkaiah Vadlamudi:
Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes. IWOCA 2013: 463-467
Informal and Other Publications
- 2022
- [i8]Umesh Kumar, V. Ch. Venkaiah:
A Family of Block Ciphers Based on Multiple Quasigroups. IACR Cryptol. ePrint Arch. 2022: 1761 (2022) - 2019
- [i7]Priyadarshi Singh, Abdul Basit, N. Chaitanya Kumar, V. Ch. Venkaiah:
Towards a Hybrid Public Key Infrastructure (PKI): A Review. IACR Cryptol. ePrint Arch. 2019: 784 (2019) - 2018
- [i6]N. Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, V. Ch. Venkaiah:
Lightweight Cryptography for Distributed PKI Based MANETS. CoRR abs/1804.06313 (2018) - [i5]Kallepu Raju, Appala Naidu Tentu, China Venkaiah Vadlamudi:
Cryptanalysis of a Group Key Transfer Protocol Based on Secret Sharing: Generalization and Countermeasures. IACR Cryptol. ePrint Arch. 2018: 711 (2018) - 2017
- [i4]N. Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, V. Ch. Venkaiah, Y. V. Subba Rao:
Node Authentication Using BLS Signature in Distributed PKI Based MANETS. CoRR abs/1708.08972 (2017) - 2016
- [i3]Lalitha Kiran Nemana, V. Ch. Venkaiah:
An Empirical Study towards Refining the AKS Primality Testing Algorithm. IACR Cryptol. ePrint Arch. 2016: 362 (2016) - 2014
- [i2]V. Ch. Venkaiah, K. Ramanjaneyulu, Neelima Jampala, J. Rajendra Prasad:
Equivalence of lower bounds on the number of perfect pairs. CoRR abs/1412.6793 (2014) - 2013
- [i1]Appala Naidu Tentu, Prabal Paul, V. Ch. Venkaiah:
Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes. IACR Cryptol. ePrint Arch. 2013: 189 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-15 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
