Qualification: 
M.Tech
k_praveen@cb.amrita.edu

Praveen K. currently serves as Assistant Professor at TIFAC-CORE in Cyber Security, Coimbatore Campus.  He pursued his M.Tech Cyber Security from Amrita Vishwa Vidyapeetham Coimbatore. 

Teaching

OS/Android/Database Security, Computer Architecture

Funded Projects Involved

  1. Development of Visual Cryptographic Schemes (ISRO Project)
  2. Design and Analysis of Stream Ciphers (ISRO Project)
     

Publications

Publication Type: Journal Article

Year of Publication Publication Type Title

2017

Journal Article

K. Praveen, Sethumadhavan, M., and Krishnan, R., “Visual cryptographic schemes using combined Boolean operations”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 20, pp. 413-437, 2017.[Abstract]


Visual Cryptographic scheme (VCS) is a variant form of secret sharing method to encode a secret image into n distinct shares. The dealer distributes shares to each participants in such a way that, while certain qualified subsets of participants can visually recover the secret, but other forbidden sets of participants have no information on the secret. Such a system is the general access structures in VCS. The essential access structure (k, n)* is a type of threshold scheme were one participant is the leader who holds the essential share and the remaining n-1 shares are given to n-1 participants. The secret image cannot be retrieved in the absence of leader and the leader needs the support of at least k-1 remaining participants to recover the secret image. Small pixel expansion and maximum contrast are the basic parameters for measuring the quality of the VCS. In the literature there are constructions for both deterministic and probabilistic (k, n)*-VCS. The following are the important contributions of this paper. (1) A deterministic (k, n)*-VCS with improved contrast. (2) A deterministic (k, n)- VCS for t essential participants with improved contrast and less pixel expansion. (3) An ideal contrast general access structure construction with AND operation for grey scale images. (4) An ideal contrast (k, n)*-VCS construction for both binary and grey scale images. (5) An ideal contrast (k, n)-VCS for t essential participants for both binary and grey scale images. © 2017 Taru Publications.

More »»

2016

Journal Article

M. D. Amruth and Praveen, K., “Android smudge attack prevention techniques”, Advances in Intelligent Systems and Computing, vol. 385, pp. 23-31, 2016.[Abstract]


Graphical patterns are widely used for authentication in touch screen phones. When a user enters a pattern on a touch screen, epidermal oils of his skin leave oily residues on screen called smudge. Attackers can forensically retrieve this smudge which can help them to deduce the unlock pattern. In this paper we analyze some existing techniques and propose new techniques to prevent this attack. We propose Split pattern, Wheel lock, Random PIN lock and Temporal lock to reduce or prevent smudge attack. Usability and shoulder surfing resistance were also considered while designing these techniques. This paper explains how the proposed techniques are effective against smudge attacks. © Springer International Publishing Switzerland 2016.

More »»

2015

Journal Article

K. Jamsheed and Praveen, K., “A low overhead prevention of android web view abuse attacks”, Communications in Computer and Information Science, vol. 536, pp. 530-537, 2015.[Abstract]


WebView, an Android component to load and display web content, has become the center of attraction for attackers as its use increases with the increased trend of hybrid application development. The attackers mainly concentrate on abusing the JavaScript interface and accessing the native code. Since most of the developers do not go for HTTPS secure connections to decrease processing overhead, injection attacks becomes easy. The attacker looks for the JavaScript interface implementation in well known libraries like ad-provider libraries or hybrid application wrapper libraries and try to inject code that uses them. This paper presents a low overhead solution to use public key cryptography for ensuring integrity over data transferred and thus prevent such attacks. © Springer International Publishing Switzerland 2015.

More »»

2015

Journal Article

K. R. Arjun and Praveen, K., “A Hybrid Approach for Querying Numeric data in DAS-Model”, International Journal of Control Theory and Applications, vol. 8, pp. 2077-2083, 2015.[Abstract]


Database is the key component of any organization. Outsourcing these databases reduces the cost of managing and maintaining the database. Data in outsourced database are encrypted to provide privacy and confidentiality. In the proposed Hybrid model the data is initially bucketized using query optimal bucketization and then we apply an Order Preserving Encryption (OPE) on each bucket. Thehybrid model combines bucketization and OPE. Since, we apply an OPE the comparison operation can be directly applied without decrypting the data. The OPE provides zero false positives with exact match. The proposed model preserves this zero false positives with increase in efficiency of querying of the database. Even if the attacker has access to the encrypted database he cannot decrypt thedata without key and domain information. © 2015 International Science Press.

More »»

2013

Journal Article

M. Ritwik and Praveen, K., “Analyzing the Makier Virus”, International Journal of Computer Science, vol. 10, pp. 530-533, 2013.[Abstract]


Malware is most rampant in the modern era. Security professionals remain one step behind the attackers as they are reactive rather than proactive. This paper conducts an analysis of a recent malware strain henceforth called The Makier Virus. More »»

Publication Type: Conference Proceedings

Year of Publication Publication Type Title

2016

Conference Proceedings

K. Praveen and Dr. M. Sethumadhavan, “Ideal Contrast Visual Cryptography for General Access Structures with AND Operation.”, In Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics: ICACNI 2015, vol. 2, 44 vol. Springer India, New Delhi, 2016.[Abstract]


In Visual Cryptographic Scheme (VCS) reversing operations (NOT operations) are carried out during reconstruction process to improve the quality of the reconstructed secret image. Many studies were reported on using reversing operation in both perfect and nonperfect black VCS. In 2005, Cimato et al. put forward an ideal contrast VCS with reversing, which is applicable to any access structures (IC-GA-VCS). Here there will not be any change in resolution for reconstructed secret image in comparison with original secret image (KI). In this paper a proposal for replacing reversing operations with AND operations during reconstruction in perfect black VCS is shown. A comparison of the proposed modification with Cimato et al. construction and other related work are discussed in this paper.

More »»

2014

Conference Proceedings

K. Praveen, Dr. M. Sethumadhavan, and Rajeev, K., “On the Extensions of (k, n)*-Visual Cryptographic Schemes”, In Recent Trends in Computer Networks and Distributed Systems Security. Springer Berlin Heidelberg, pp. 231-238, 2014.

2013

Conference Proceedings

K. Praveen and Dr. M. Sethumadhavan, “An Application of Vector Decomposition problem in Public key Cryptography using homomarphic Encryption”, International Conference on Emerging Research in Computing Information Communication and Applications. Meenakshi Institute of Technology, Bangalore, 2013.

2012

Conference Proceedings

R. Arun, Nath, H. V., Bose, D. Chandra, and Praveen, K., “A distortion free relational database watermarking using patch work method (2012)”, In Proceedings of the International Conference on Information Systems Design and Intelligent Applications. Springer Berlin Heidelberg, pp. 531-538, 2012.

Publication Type: Book Chapter

Year of Publication Publication Type Title

2016

Book Chapter

S. Remya and Praveen, K., “Protecting the Augmented Browser Extension from Mutation Cross-Site Scripting”, in Proceedings of the Second International Conference on Computer and Communication Technologies: IC3T 2015, Volume 1, C. Suresh Satapathy, Raju, S. K., Mandal, K. Jyotsna, and Bhateja, V. New Delhi: Springer India, 2016, pp. 215–223.[Abstract]


Browser extensions have a great role in bringing changes to the web browser behavior and improving browser performance. However, nowadays, many browser extensions fail to meet the security requirements. Due to this, they become a medium for various attackers to steal the credential information of the users. The proposal in this paper makes a pitch for the protection of an augmented browser extension against mutation-based cross-site scripting attack. A method is introduced for hardening the browser extension script along with dead code injection. A mutation-based cross-site scripting identifier to identify the attacks that affect the extensions is also discussed in this paper. These methods will protect browser extensions from various malicious script injection attacks.

More »»

2016

Book Chapter

D. Nidhin, Praveen, I., and Praveen, K., “Role-Based Access Control for Encrypted Data Using Vector Decomposition”, in Proceedings of the International Conference on Soft Computing Systems: ICSCS 2015, Volume 2, P. L. Suresh and Panigrahi, K. Bijaya New Delhi: Springer India, 2016, pp. 123–131.[Abstract]


In this current era, cloud environment has become essential for large-scale data storage which makes it challenging to control and prevent unauthorized access to the data. At the same time trusting the cloud provider’s integrity is also significant. Instead of assuming that the cloud providers are trusted, data owners can store the encrypted data. In 2013, Zhou et al. put forward a role-based encryption scheme (RBE) that integrates encryption with role-based access control (RBAC). In 2008, Okamoto and Takashima introduced a higher dimensional vector decomposition problem (VDP) and a trapdoor bijective function. In this paper, we propose a RBE scheme using VDP.

More »»

2015

Book Chapter

G. S. Devisree and Praveen, K., “Secretly Shared QR Code and Its Applications”, in Artificial Intelligence and Evolutionary Algorithms in Engineering Systems: Proceedings of ICAEES 2014, Volume 2, P. L. Suresh, Dash, S. Subhransu, and Panigrahi, K. Bijaya New Delhi: Springer India, 2015, pp. 473–480.[Abstract]


Quick response codes (QR codes) are widely being used for various applications such as user authentication and advertisements. The data in QR codes can easily be read with the help of a QR code reader application installed in a smartphone with camera. Here, we cannot neglect the possibility of an attacker tampering the QR code data. For example, in authentication, the attacker can forge the text password. In order to avoid such attacks as well as hide this data from the public, we propose a secret sharing scheme with reversing. This scheme not only splits the QR code into different shares, but also allows us to perfectly reconstruct back the original QR code.

More »»

2015

Book Chapter

K. Praveen and Sasi, N., “A (t, n) Secure Sum Multiparty Computation Protocol Using Multivariate Polynomial Secret Sharing Scheme”, in Artificial Intelligence and Evolutionary Algorithms in Engineering Systems: Proceedings of ICAEES 2014, Volume 1, P. L. Suresh, Dash, S. Subhransu, and Panigrahi, K. Bijaya New Delhi: Springer India, 2015, pp. 457–463.[Abstract]


A (t, n) threshold scheme is a method for sharing a secret among n shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. In this paper, we propose a (t, n) secure sum multiparty computation protocol using multivariate polynomial secret sharing scheme. In this scheme, any t or more shareholders acting in collusion can reconstruct the secret, but a particular shareholder’s information is not revealed to other shareholders. This scheme can be applied for authenticating a selected single group of tparticipants securely without revealing their shares.

More »»

2014

Book Chapter

K. Praveen and Dr. M. Sethumadhavan, “Results on (2, n) Visual Cryptographic Scheme”, in Security in Computing and Communications: Second International Symposium, SSCC 2014, Delhi, India, September 24-27, 2014. Proceedings, J. Lloret Mauri, Thampi, S. M., Rawat, D. B., and Jin, D. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014, pp. 335–340.[Abstract]


In the literature a lot of studies were carried out on (2, n) visual cryptographic scheme (VCS) using either XOR or OR operation. A scheme on ideal contrast (2, n) VCS with reversing using combined OR and NOT operations was reported. In this paper, a construction on an ideal contrast (2, n) VCSusing combined XOR and OR operations with less amount of transparencies than ideal contrast (2,n) VCS with reversing using OR and NOT operations is proposed. This paper also shows a construction of (2, n) VCS with pixel expansion one which perfectly reconstruct the white pixels and probabilistically reconstruct the black pixel using XOR operation.

More »»

2014

Book Chapter

K. Praveen and Dr. M. Sethumadhavan, “A Probabilistic Essential Visual Cryptographic Scheme for Plural Secret Images”, in Advanced Computing, Networking and Informatics- Volume 2: Wireless Networks and Security Proceedings of the Second International Conference on Advanced Computing, Networking and Informatics (ICACNI-2014), M. Kumar Kundu, Mohapatra, P. Durga, Konar, A., and Chakraborty, A. Cham: Springer International Publishing, 2014, pp. 225–231.[Abstract]


In order to reduce the pixel expansion of visual cryptography scheme (VCS), many probabilistic schemes were proposed. Let P = {P 1,P 2,P 3,...,P } be the set of participants. The minimal qualified set for essential VCS is given by Γ0={A: A ⊆ P, P 1 ∈ A and |A| = k}. In this paper we propose a construction of probabilistic essential VCS for sharing plural secret images simultaneously.

More »»

2012

Book Chapter

D. D. Shankar, Dr. Gireesh K. T., Praveen, K., Jithin, R., and Raj, A. S., “Block Dependency Feature Based Classification Scheme for Uncalibrated Image Steganalysis”, in Data Engineering and Management: Second International Conference, ICDEM 2010, Tiruchirappalli, India, July 29-31, 2010. Revised Selected Papers, R. Kannan and Andres, F. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 189–195.

2011

Book Chapter

S. Mallissery, Praveen, K., and Sathar, S., “Correlation of Alerts Using Prerequisites and Consequences for Intrusion Detection”, in Computational Intelligence and Information Technology: First International Conference, CIIT 2011, Pune, India, November 7-8, 2011. Proceedings, V. V. Das and Thankachan, N. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 662–666.[Abstract]


Alert Correlation is a process that analyses the alerts produced by one or more Intrusion Detection Sensors and provides a clear picture of occurring or attempted intrusions. Even though the correlation process is often presented as a single step, the analysis is actually carried out by a number of components, each of which has a specific goal. The idea of prerequisites of an intrusion, that is the necessary condition for the intrusion to be successful and the possible outcomes of intrusion is the consequences. This method also help us to correlates two alerts if the consequence of the earlier alert prepares for the prerequisites of the later one. In this system, before alert classification we are performing normalization, pre-processing, and alert correlation. In correlation phase there are two types of correlation, which are duplicate removal (alert fusion) and consequence correlation. Thus the resulting alert set is clustered. Based on this analysis of the alert set, the prioritization component assigns an appropriate priority to every alert. This priority information is important for quickly discarding information that is irrelevant or of less importance. The second way of prioritizing is based on the number of alerts coming from the networked systems.

More »»
207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS
  • Amrita on Social Media

  • Contact us

    Amrita Vishwa Vidyapeetham,
    Amritanagar,
    Coimbatore - 641 112,
    Tamil Nadu, India.
    • Fax                 : +91 (422) 268 6274
    • Coimbatore   : +91 (422) 268 5000
    • Amritapuri    : +91 (476) 280 1280
    • Bengaluru     : +91 (080) 251 83700
    • Kochi              : +91 (484) 280 1234
    • Mysuru          : +91 (821) 234 3479
    • Chennai         : +91 (44 ) 276 02165
    • Contact Details »