Qualification: 
Ph.D, MCA, MPhil, B.Ed.
ck_shyamala@cb.amrita.edu

Dr. C. K. Shyamala received her B.Sc degree in Applied Sciences- Computer Technology in 1988 from PSG College of Technology, M.C.A degree in 2000 from PSG College of Arts and Science, M.Phil from Bharathiar University in 2004 and Ph.D degree in Sustaining Dependability in Distributed Storages in 2015, from Amrita Vishwa Vidyapeetham, Tamil Nadu, India. She is working at Amrita Vishwa Vidyapeetham University since 2000. She is currently an Associate Professor(Selection Grade) in the department of Computer Science and Engineering, Amrita School of Engineering, Amrita Vishwa Vidyapeetham University, Tamil Nadu, India.

Her research interest includes Distributed storage and access, Erasure and Error correction codes, Privacy preservation, Trust and Reputation systems in P2P networks, Cryptography, Information security, Security in big data. She has coauthored a book on “Cryptography and Security”, currently the text book for B.Tech CSE Elective on “Cryptography” in Amrita School of Engineering, Amrita Vishwa Vidyapeetham. She has published papers in reputed journals and conference proceedings, out of which majority of the papers are indexed in SCOPUS. She is also guiding B.Tech, M.Tech, and M.C.A student projects/thesis.

Education

YEAR DEGREE/PROGRAM INSTITUTION
2015 PhD in Sustaining Dependability in Distributed Storages Amrita Vishwa Vidyapeetham
2004 M.Phil Bharathiar University
2000 M.C.A PSG College of Arts and Science
1988 B.Sc degree in Applied Sciences- Computer Technology PSG College of Technology

Honors and Awards

  1. Gold medalist in MCA (1997 -2000) PSG College of Arts and Science affiliated to Bharathiar University.
  2. Member BoS -MCA Department, 2003 to 2007, PSG College of Arts and Science affiliated to Bharathiar University.
  3. Member BoS - Computer Courses (UA) Department, 2007 to 2012, PSG College of Arts and Science affiliated to Bharathiar University.
  4. Member BoS – BTech CSE, 2012 to 2015, Dept of CSE, Amrita School of Engineering.
     

Workshops/FDP Organized

  1. Organized a faculty development workshop on “Computational Thinking for Problem Solving”, 2015.
  2. Organized a student workshop on “Android app development”, SWAD-2014 and 2015.
  3. Organized a three days workshop on “Publishing your research” for PG students at Amrita Vishwa Vidyapeetham, on May-2014.
  4. Organized faculty development programme on “Question paper setting and evaluation”, 2012 to 2014.

Publications

Publication Type: Conference Paper

Year of Conference Publication Type Title

2017

Conference Paper

Dr. Shyamala C. K., Dr. Shunmuga Velayutham C., and Dr. Latha Parameswaran, “Teaching computational thinking to entry-level undergraduate engineering students at Amrita”, in IEEE Global Engineering Education Conference, EDUCON, 2017, pp. 1731-1734.[Abstract]


This paper is about various aspects of the Computational Thinking and Problem Solving course offered to entry-level undergraduate engineering students across 7 engineering disciplines at Amrita University, India. The various aspects include the motivations for offering the course, aims and objectives of the course, course design as well as the delivery and assessment of the course. The paper also shares the experience of conducting the course to a very large number of students and the lessons learnt during the process. © 2017 IEEE.

More »»

Publication Type: Journal Article

Year of Conference Publication Type Title

2016

Journal Article

Dr. Shyamala C. K. and Sharanya, R. R., “Adversarial effect in distributed storage systems”, Indian Journal of Science and Technology, vol. 9, 2016.[Abstract]


Objectives: The critical problem of mass storage and access is handled by Distributed Storage System (DSS) by incorporating data Replication and/or Dispersal techniques. Handling the hybrid failures is very crucial for the design of reliable and efficient DSS. The realistic combination of Crash and Non-Crash faults in DSS disallow fail stop assumption in design. This paper provides an insight into different types of failures, adversaries, proposes a systematic scheme to simulate adversarial effect in DSS. Methods/Statistical Analysis: Information Dispersal Algorithm (IDA) and Reed Solomon codes (RS) are the methods used to analyze the performance of the system. Findings: The performance of the system and robustness of the RS Coded DSS is evaluated and analyzed for various Workload, RS (n, k) values, % of Hybrid failures to design reliable and efficient Distributed Storage System. Application/Improvement: Reed Solomon codes improves the performance of the system by handling both errors and erasures compared to Information Dispersal Algorithm. More »»

2016

Journal Article

Dr. Shyamala C. K. and Hemaashri, S., “An enhanced design for anonymization in social networks”, Indian Journal of Science and Technology, vol. 9, 2016.[Abstract]


Objectives: Our primary objective is to safeguard the privacy of the users by anonymizing the sensitive data shared by the users in Social networking sites. Methods/Statistical Analysis: The user's friends are grouped dynamically into various categories such as best friends, normal friends and casual friends based on their closeness with the user. The most private sensitive data is solely disclosed to best friends, while the sensitive data is anonymized using generalization and revealed to the normal friends. The last category of friends is exposed to only the least private information using another level of generalization. Findings: Currently, Social networking sites have become the rapid and preferred way of communicating with each other to share information. On one hand the options and benefits expand constantly, while on the other data privacy risks and sensitivity issues accumulate, eventually the privacy of the user is at grave, our work addresses this issue. The proposed design is resilient to Sybil attacks, where it restricts the revelation of the sensitive data of the user by anonymizing the shared data among various categories of friends. Application/Improvement: The performance of the system is enhanced by restricting the access to the sensitive data among various categories of friends based on their closeness degree.

More »»

2015

Journal Article

Dr. Shyamala C. K. and Vidya, N. V., “Dual quorum-dispersal, A novel approach for reliable and consistent ECC based storages”, International Journal of Applied Engineering Research, vol. 10, pp. 6901-6917, 2015.[Abstract]


Consistency, Availability, and Fault tolerance are the primary requirements at storage in a distributed environment. Besides these requirements storage efficacy and security in terms of confidentiality are also equally important. The traditional approach to achieve primary requirements is replication for data redundancy. Redundancy using replication provides high rates of availability at the cost of security and storage efficacy. This paper explores the possibility of incorporating dual quorum protocol, which provides availability, strong consistency and reasonable disk access time, with dispersal, to satisfy the additional requirements of security and storage efficiency at nominal cost. The performance of Dual quorum dispersal with respect to availability, errors, erasures and disk space is evaluated in comparison with Dual quorum incorporated for replication. Dual quorum dispersal outperforms Dual quorum replication in several functionalities like disk access time, security storage efficiency etc. On the other hand Dual quorum replication performs better when availability is considered. For applications that require space efficient, secure, error and erasure tolerant system which makes use of interleaved read and write workloads, Dual quorum-dispersal is an attractive choice and this is reinstated with the analyzed results. © Research India Publications.

More »»

2015

Journal Article

P. L. Aiswarya, Dr. Shyamala C. K., and Sukanya, V. S., “Computation of trust”, International Journal of Applied Engineering Research, vol. 10, pp. 26093-26102, 2015.[Abstract]


Trust, a multi-faceted and context dependent subjective factor, is gaining prominence in the computer world for the virtue of shielding applications from deceptions. Numerous applications online and offline rely on trust-reputation system as a means for the propagation of trust. Trust which is determined as encompassment of personal experiences and reputation is propagated across the participants in an application through transitivity. Difference in the nature of applications and context dependency of trust make it impossible to have a universal trust propagation scheme. The dimension of challenges in establishing transitivity of trust remains unexplored. This paper discusses the changing face of trust determination based on the computational models. It structures the transitive propagation of bi-directional trust, explores the challenges of transitivity in unidirectional trust and proposes a solution for the same. Prominent applications are discussed and classified along the lines of trust propagation. © Research India Publications.

More »»

2015

Journal Article

Dr. Shyamala C. K. and Padmanabhan, T. R., “An integrated distributed storage design offering data retrievability and recoverability using soft decision decoding of block codes”, Journal of Computing and Information Technology, vol. 23, pp. 191-210, 2015.[Abstract]


<p>Active distributed storages need to assure both consistency and dynamic data support, in addition to availability, confidentiality and resiliency. Further, since storage durability suffers in untrusted and unreliable environments, it becomes crucial to (a) select the most reliable set of servers to assure data retrievability and (b) dynamically identify errant servers and restore the data to ensure data recoverability. We address the issues of concurrency, consistency, dynamic data support, data share repair, and trust management in providing persistent storage and access. The paper focuses primarily on erasure coded distributed storages (storages employing erasure coding for data dispersal). Integration of Quorum based approach using Notification propagation, with a reliability model based on server trust-reputation forms the comprehensive design proposed. Treating servers and their data shares equally at data reconstructions during data retrievals is rather inadequate in untrusted environments. The design provides a suitable platform for use of Soft Decision Decoding to overcome this inadequacy. The design has been validated by the simulation, study, and analysis carried out for Reed Solomon coded storage with varying levels of resiliency and concurrency. The proposed design can be suitably adapted in typical distributed information storages catering to global networked audience in public, untrusted, and unreliable operating environments.</p>

More »»

2015

Journal Article

Dr. Shyamala C. K. and R.R., S., “Study of adversary models in distributed storage systems”, Global Journal of Pure and Applied Mathematics, vol. 11, pp. 148-155, 2015.[Abstract]


In recent years, there has been an increasing demand for efficient and reliable storage systems which makes Distributed Storage Systems (DSS) become more popular. A Distributed Storage system is a form of storing data remotely on more than one node. DSS employ Data Replication and/or Data Dispersal techniques to provide Availability, Scalability and Fault Tolerance. An important concern is the risk of failure. Failure may be due to Crash or Non - crash faults called as Hybrid failures. It may be due to software, hardware, Adversary, human errors or network error, etc. An adversary is generally considered to be a person, group, or malicious entity that prevent the system in achieving its goal. This survey paper provides an insight into different fault tolerant methods used in replication and dispersal techniques, adversary and its classification with respect to hybrid failures which helps to design an efficient and reliable distributed storage system. © Research India Publications.

More »»

2015

Journal Article

Dr. Shyamala C. K., Ashok, N., and Narayanan, B., “Trust-based multi-path Security Scheme for Ad-hoc networks”, International Journal of Control Theory and Applications, vol. 8, pp. 1735-1742, 2015.[Abstract]


Open and autonomous environments are highly heterogeneous and are characterized heavily by entities that leave or join the community as they choose. Security is termed as the degree of resistance to, or protection from, harm; the degrees of resistance to attacks in these varieties of networks are rather low. To protect the confidentiality of the information shared in these networks, it has to be secured from malicious individuals and communal. Though Public Key Infrastructure (PKI) is a widely accepted scheme, it is much ill-suited for adoption in open and autonomous environments. Traditional approaches to security schemes cannot always be adopted in open and autonomous distributed environments; ensuring security in such open natured environments is a critical issue that is open for investigation. Recent researches have suggested an effective way to provide security by building 'Trust' among entities to sort out the most reliable entities to interact with. This essentially calls for quantifying levels of entity trust in a distributed environment and obtaining feedback to support the levels of trust entrusted on the entities. This paper proposes a decentralized transitive trust and data dispersal to secure data exchanges among entities (a few of which may be malicious) in ad-hoc networked environments. © International Science Press.

More »»

2015

Journal Article

Dr. Shyamala C. K., Hemaashri, S., and Swetha, R., “An improved recommendation system for social networks”, International Journal of Control Theory and Applications, vol. 8, pp. 1903-1910, 2015.[Abstract]


Social networking sites have become extremely popular in the past few years because of their extensible online connectivity and information sharing capabilities. The ability to communicate and connect online easily has attracted millions of users. Although this establishes high connectivity, privacy of user data is at stake due to various privacy threats such as sensitive data revelation, fake identities etc. We propose an automated dynamic grouping system to have better control over sensitive data that is shared online. This system analyses friends in social networking sites and categorizes them into best friends, normal friends and visitors. The categorization is based on various interaction parameters. The automated grouping system is enhanced using a recommendation system to make the system dynamic.

More »»

2014

Journal Article

Dr. Shyamala C. K. and Padmanabhan, T. R., “A trust-reputation model offering data retrievability and correctness in distributed storages”, International Journal of Computers and Applications, vol. 36, pp. 56-63, 2014.[Abstract]


Distributed storage systems employing dispersal techniques provide retrieval services with a minimal subset of available servers' file shares. Generally, cryptography-based techniques aid data retrievability and storage correctness in distributed storages; we propose an equivalent, alternative approach that uses "server trust". Our work makes available, file retrieval and dynamic restoration of corrupted file shares with highest probability. We present a novel trust-reputation model to quantify and manage the trust of servers operating in an untrusted environment; a significant aspect is in quantification of good/bad behaviour of servers in terms of trust index, using analytical expressions. The scheme provides selection of the most reliable, minimal server set for file reconstruction and identification of servers for restoration of corrupted file shares. Singular treatment of incorrect servers, statistical means of server reward/punishment and selection of the minimal set of file shares for reconstruction are the key features of the model. Our scheme achieves the triple goals of availability, retrievability and recoverability, despite non-crash and crash-stop faults in storage. The model has evolved into a comprehensive system satisfying the triple goals, standard framework and crucial recommendations demanded of such a system. Extensive simulation studies carried out validate the model and its adaptability.

More »»

2014

Journal Article

Dr. Shyamala C. K. and Aishwarya, P. L., “Design of Fair Testimony in Reputation System”, International Journal of Applied Engineering Research, vol. 9, pp. 20405-20419, 2014.

Publication Type: Book

Year of Conference Publication Type Title

2011

Book

T. R. Padmanabhan, Dr. Shyamala C. K., and Harini, N., Cryptography and Security. Wiley India , 2011, p. 560.[Abstract]


In Cryptography and Security book, basic concepts of cryptography and security are introduced. Cryptography and security are dealt with in sufficient depth and detail without losing focus. Symmetric and asymmetric key cryptography Elliptic curve cryptography, hashing functions, message authentication, and digital signature are discussed and salient features in each explained. Subsequently the cryptographic concepts are used to address security issues at application, transport, and network layers. Security threats at various levels and counter measures are explained. Relevant standards and applications are given sufficient attention. The book is organized into three parts. Part A is devoted to cryptography. Necessary mathematical background is provided; currently used cryptosystems as well as authentication and signature schemes are dealt with in adequate depth and detail. Network security is dealt with in Part B. Authentication schemes, internet security protocols, and related services in current use are explained in all their aspects. System security is the scope of Part C. Intrusion, viruses, worms etc., are dealt with in terms of their structures, threats, and protection from them inclusive of firewalls. Adequate justice is done to digital immune systems and trusted systems. Necessary supplementary material is provided as appendices.

More »»

Publication Type: Conference Proceedings

Year of Conference Publication Type Title

2008

Conference Proceedings

Dr. Shyamala C. K., N, H., and Padmanabhan, T. R. Dr., “Arithmetic on Elliptic Curves Over Finite Fields”, National Conference on Advanced Computing Technologies, ACT '08. pp. 25-26, 2008.

Faculty Research Interest: 
207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS