Friday, August 30, 2019

International Journal of Network Security & Its Applications (IJNSA)

PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLES

PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLES
Prashant Kushwah1 and Sunder Lal2
1Department of Mathematics and Statistics, Banasthali University, Rajasthan, India
2Vice Chancellor, Veer Bahadur Singh Purvanchal University, Jaunpur (UP), India

ABSTRACT

Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step with the cost lower than signature-then-encryption approach. Recently, Li et al. [35] proposed the first provable secure identity based signcryption without random oracles. In their scheme sender signs the ciphertext. However, in [11] Boyen showed that non-repudiation is easily achieved if the sender sign the plaintext rather than ciphertext. In this paper we proposed an identity based signcryption scheme without random oracles, which provides the non-repudiation with respect to plaintext. We also proposed an identity based public verifiable signcryption scheme with third party verification in the standard model.

KEYWORDS

Signcryption, identity based cryptography, provable security, standard model, public verifiable signcryption





Wednesday, August 28, 2019

6th International Conference on Cryptography and Information Security (CRIS 2020)


6th International Conference on Cryptography and Information Security (CRIS 2020)

January 25 ~ 26, 2020, Zurich, Switzerland


Scope & Topics

6th International Conference on Cryptography and Information Security (CRIS 2020) provides a forum for researchers who address this issue and to present their work in a peer-reviewed forum. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.

Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in applied cryptography and Information security.

Topics of interest include, but are not limited to, the following:

  • Cryptographic Protocols
  • Cryptography and Coding
  • Untraceability
  • Privacy and Authentication
  • Key Management
  • Trust Management
  • Quantum Cryptography
  • Computational Intelligence in Security
  • Artificial Immune Systems
  • Biological and Evolutionary Computation
  • Intelligent Agents and Systems
  • Reinforcement and Unsupervised Learning
  • Autonomy-Oriented Computing
  • Co-evolutionary Algorithms
  • Fuzzy Systems
  • Biometric Security
  • Trust Models and Metrics
  • Regulation and Trust Mechanisms
  • Data Integrity
  • Models for Authentication, Trust and Authorization
  • Wireless Network Security
  • Information Hiding
  • E- Commerce
  • Data and System Integrity
  • Access Control and Intrusion Detection
  • Intrusion Detection and Vulnerability Assessment
  • Authentication and Non-repudiation
  • Identification and Authentication
  • Insider Threats and Countermeasures
  • Intrusion Detection & Prevention
  • Secure Cloud Computing
  • Security Information Systems Architecture and Design and Security Patterns
  • Security Management
  • Security Requirements (Threats, Vulnerabilities, Risk, Formal Methods, etc.)
  • Sensor and Mobile Ad Hoc Network Security
  • Service, Systems Design and QoS Network Security
  • Software Security
  • Security and Privacy in Mobile Systems
  • Security and Privacy in Pervasive/Ubiquitous Computing
  • Security and Privacy in Web Services
  • Security and Privacy Policies
  • Security Area Control
  • Security Deployment
  • Security Engineering
  • Security for Grid Computing
  • Security in Distributed Systems

Paper Submission

Authors are invited to submit papers through the conference Submission System by August 31, 2019. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this conference. The proceedings of the conference will be published by Computer Science Conference Proceedings in Computer Science & Information Technology (CS & IT) series (Confirmed).

Selected papers from CRIS 2020, after further revisions, will be published in the special issues of the following journals


Important Dates

  • Submission Deadline : August 31, 2019
  • Authors Notification : October 27, 2019
  • Registration & Camera-Ready Paper Due : November 10, 2019

Contact Us

Here's where you can reach us: cris@cosit2020.org or crissecretary@gmail.com

Submission System




Tuesday, August 27, 2019

RESILIENT VOTING MECHANISMS FOR MISSION SURVIVABILITY IN CYBERSPACE:COMBINING REPLICATION AND DIVERSITY

RESILIENT VOTING MECHANISMS FOR MISSION SURVIVABILITY IN CYBERSPACE:COMBINING REPLICATION AND DIVERSITY
Charles A. Kamhoua1, Patrick Hurley1, Kevin A. Kwiat1 and Joon S. Park2
1Air Force Research Laboratory, Information Directorate, Rome, New York, USA
2Syracuse University, Syracuse, New York, USA

ABSTRACT

While information systems became ever more complex and the interdependence of these systems increased, mission-critical services should be survivable even in the presence of cyber attacks or internal failures. Node replication can be used to protect a mission-critical system against faults that may occur naturally or be caused by malicious attackers. The overall reliability increases by the number of replicas. However, when the replicas are a perfect copy of each other, a successful attack or failure in any node can be instantaneously repeated in all the other nodes. Eventually, the service of those nodes will discontinue, which may affect the system’s mission. Therefore, it becomes evident that there must be more survivable approach with diversity among the replicas in mission-critical systems. In particular, this research investigates the best binary voting mechanism among replicas. Furthermore, with experimental results, we compare the simple majority mechanism with hierarchical decision process and discuss their trade-offs.

KEYWORDS

Diversity, Fault-tolerant Networks, Intrusion Resilience, Reliability, Survivability 




























































































Monday, August 26, 2019

International Journal of Network Security & Its Applications (IJNSA)

International Journal of Network Security & Its Applications (IJNSA)
ISSN 0974 - 9330 (Online); 0975 - 2307 (Print)
                
Scope & Topics

The International Journal of Network Security & Its Applications (IJNSA) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the computer Network Security & its applications. The journal focuses on all technical and practical aspects of security and its applications for wired and wireless networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern security threats and countermeasures, and establishing new collaborations in these areas.

Topics of Interest include, but are not limited to, the following:

  • Network and Wireless Network Security
  • Mobile, Ad Hoc and Sensor Network Security
  • Peer-to-Peer Network Security
  • Database and System Security
  • Intrusion Detection and Prevention
  • Internet Security & Applications
  • Security & Network Management
  • E-mail security, Spam, Phishing, E-mail fraud
  • Virus, worms, Trojan Protection
  • Security threats & countermeasures (DDoS, MiM, Session Hijacking, Replay attack etc,)
  • Ubiquitous Computing Security
  • Web 2.0 security
  • Cryptographic protocols
  • Performance Evaluations of Protocols & Security Application

Paper submission

Authors are invited to submit papers for this journal through e-mail ijnsa@airccse.org or Submission System.  Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this Journal.

Important Dates

  • Submission Deadline   : August 31, 2019
  • Notification                   :  September 25, 2019
  • Final Manuscript Due   :  September 30, 2019
  • Publication Date           :  Determined by the Editor-in-Chief

Contact Us

Here's where you can reach us : ijnsa@airccse.org or ijnsa@aircconline.com

Please Visit

For other details please visit http://airccse.org/journal/ijnsa.html 

Submission System


Thursday, August 22, 2019

THE NEW AGE OF COMPUTER VIRUS AND THEIR DETECTION

THE NEW AGE OF COMPUTER VIRUS AND THEIR DETECTION
Nitesh Kumar Dixit1, Lokesh mishra2, Mahendra Singh Charan3 and Bhabesh Kumar Dey4
1Department of Electronics and Communication Engineering, BIET, Sikar, Raj., INDIA
2Department of Computer Science, NCAC,Sikar,Raj. INDIA
3,4Department of Computer Engineering, BIET, Sikar, Raj., INDIA

ABSTRACT
This paper presents a general overview on computer viruses and defensive techniques. Computer virus writers commonly use metamorphic techniques to produce viruses that change their internal structure on each infection. On the other hand, anti-virus technologies continually follow the virus tricks and methodologies to overcome their threats. In this paper, anti-virus experts design and develop new methodologies to make them stronger, more and more, every day. The purpose of this paper is to review these methodologies and outline their strengths and weaknesses to encourage those are interested in more investigation on these areas. In this paper, first analyze four virus creation kits to determine the degree of metamorphism provided by each and able to precisely quantify the degree of metamorphism produced by these virus generators. While the best generator, the Next Generation Virus Creation Kit (NGVCK), produces virus variants that differ greatly from one another, the other three generators examined are much less effective.

KEYWORDS
Antivirus Techniques, Computer Antivirus, Creation, Defensive, Metamorphism, NGVCK, Virus. 




















Wednesday, August 21, 2019

ENERGY CONSTRAINED RELIABLE ROUTING OPTIMIZED CLUSTER HEAD PROTOCOL FOR MULTIHOP UNDER WATER ACOUSTIC SENSOR NETWORKS

ENERGY CONSTRAINED RELIABLE ROUTING OPTIMIZED CLUSTER HEAD PROTOCOL FOR MULTIHOP UNDER WATER ACOUSTIC SENSOR NETWORKS
Padmavathy.T.V1, Gayathri.V2, Indhumathi.V3, Karthiga.G4
Department of Electronics and Communication Engineering
R.M.K Collge of Engineering, Chennai, India

ABSTRACT

Underwater acoustic sensor network is an emerging technique consisting of sensor nodes, and AUVs all working together to sense various phenomenon, converts the sensed information into digital data, store the digital data and communicate to the base stations through the intermediate nodes. Also Underwater Acoustic Sensor Networks are playing a main role in ocean applications. Unfortunately the efficiency of underwater Acoustic Sensor Networks is inferior to that of terrestrial sensor networks due to the long propagation delay, narrow bandwidth and high error rates. Also battery life and storage capacity of node is limited. Many routing protocols are proposed to improve the efficiency of Under Water Acoustic Sensor Networks. However their improvement is not enough, so there is a need of suitable routing protocol that consider all these limitations and makes communication in underwater network viable. In this paper, we propose a protocol called Reliable Routing Optimized Cluster Head (RROCH) protocol, a network coding approach for multihop topologies. We used performance metrics like packet delivery ratio, energy consumption, end-to-end delay and throughput of sensor nodes. LEACH, HMR-LEACH, LEACH-M are compared for their performance at different traffic conditions, number of nodes and depth. By analyzing our simulation results we found that RROCH protocol may be used for denser network with low traffic and HMR- LEACH protocol is suitable for higher traffic with less number of nodes.

KEYWORDS

Acoustic Sensor Networks, Buffer Length, Energy Consumption, NS-2.26, optimum cluster size







Sunday, August 18, 2019

GENERALIZED LEGENDRE POLYNOMIALS FOR SUPPORT VECTOR MACHINES (SVMS) CLASSIFICATION

GENERALIZED LEGENDRE POLYNOMIALS FOR SUPPORT VECTOR MACHINES (SVMS) CLASSIFICATION

Ashraf Afifi1 and E.A.Zanaty2
1Department of Computer Engineering, Computers and Information Technology College, Taif University, Al-Hawiya 21974, Kingdom of Saudi Arabia

 2Computer Science Dept., Faculty of Science, Sohag University, Sohag, Egypt.

ABSTRACT

In this paper, we introduce a set of new kernel functions derived from the generalized Legendre polynomials to obtain more robust and higher support vector machine (SVM) classification accuracy. The generalized Legendre kernel functions are suggested to provide a value of how two given vectors are like each other by changing the inner product of these two vectors into a greater dimensional space. The proposed kernel functions satisfy the Mercer’s condition and orthogonality properties for reaching the optimal result with low number support vector (SV). For that, the new set of Legendre kernel functions could be utilized in classification applications as effective substitutes to those generally used like Gaussian, Polynomial and Wavelet kernel functions. The suggested kernel functions are calculated in compared to the current kernels such as Gaussian, Polynomial, Wavelets and Chebyshev kernels by application to various non-separable data sets with some attributes. It is seen that the suggested kernel functions could give competitive classification outcomes in comparison with other kernel functions. Thus, on the basis test outcomes, we show that the suggested kernel functions are more robust about the kernel parameter change and reach the minimal SV number for classification generally. 

KEYWORDS

Legendre Polynomials, Kernel Functions, Functional Analysis, SVMS, Classification Problem.

Friday, August 16, 2019

EXPLORING CHALLENGES AND OPPORTUNITIES IN CYBERSECURITY RISK AND THREAT COMMUNICATIONS RELATED TO THE MEDICAL INTERNET OF THINGS (MIOT)

EXPLORING CHALLENGES AND OPPORTUNITIES IN CYBERSECURITY RISK AND THREAT COMMUNICATIONS RELATED TO THE MEDICAL INTERNET OF THINGS (MIOT)
George W. Jackson, Jr.1and Shawon S. M. Rahman2
1Capella University, Minneapolis, MN, USA
2Associate Professor, Department of Computer Science and Engineering University of Hawaii-Hilo, Hilo, Hawaii, USA

ABSTRACT

As device interconnectivity and ubiquitous computing continues to proliferate healthcare, the Medical Internet of Things (MIoT), also well known as the, Internet of Medical Things (IoMT) or the Internet of Healthcare Things (IoHT), is certain to play a major role in the health, and well-being of billions of people across the globe. When it comes to issues of cybersecurity risks and threats connected to the IoT in all of its various flavors the emphasis has been on technical challenges and technical solution. However, especially in the area of healthcare, there is another substantial and potentially grave challenge. It is the challenge of thoroughly and accurately communicating the nature and extent of cybersecurity risks and threats to patients who are reliant upon these interconnected healthcare technologies to improve and even preserve their lives. This case study was conducted to assess the scope and depth of cybersecurity risk and threat communications delivered to an extremely vulnerable patient population, semi-structured interviews were held with cardiac medical device specialists across the United States. This research contributes to scientific data in the field of healthcare cybersecurity and assists scholars and practitioners in advancing education
and research in the field of MIoT patient communications.

KEYWORDS

Internet of Things, IoT Security, Medical Internet of Things, Healthcare Cybersecurity, Thematic Analysis 





Wednesday, August 14, 2019

A NOVEL IMAGE ENCRYPTION SCHEME WITH HUFFMAN ENCODING AND STEGANOGRAPHY TECHNIQUE

A NOVEL IMAGE ENCRYPTION SCHEME WITH HUFFMAN ENCODING AND STEGANOGRAPHY TECHNIQUE
Manju Kumari1, Vipin Pawar2 and Pawan Kumar3
1YMCA University of Science and Technology, Faridabad, India
2Deenbandhu Chotu Ram University of Science and Technology, Murthal, India
3Department of Mathematics, Maitreyi College, University of Delhi, Chanakya puri,New Delhi-110021, India

ABSTRACT

In today’s day and age when everything is done with the aid of computing technology, the need for confidential communication has drastically increased. Not only the sensitive data such as top intelligent secrets of our nation but personal information of common people needs to be secure. Several combinations of cryptography and steganography techniques in different ways are used by researchers over the past to protect the data being transmitted. Cryptography uses mathematical algorithms to convert the data into an incomprehensible form and Steganography, on the other hand hides the data in a carrier such as image, data, audio or video. Cryptography provides necessary mechanisms for providing accountability, accuracy and confidentiality in public communication mediums such as the Internet and steganography is used in other fields such as copyright, preventing e-document forging etc. We are of the opinion that this security mechanism can further be increased by incorporating the use of Huffman coding in order to reduce the data length. This paper is an effort in the direction to hide, secure and compress the data. It explains the executed procedure by applying various encryption techniques one by one and our aim is to get the best security out of the existing ones. The proposed technique is implemented in MATLAB2016a and the results shown in this paper that our technique is better approach then the conventional techniques.

KEYWORDS

Cryptography; Steganography; Huffman Coding; Data Compression.







International Journal of Network Security & Its Applications (IJNSA) - ERA, WJCI Indexed

International Journal of Network Security & Its Applications (IJNSA) - ERA, WJCI Indexed ISSN: 0974 - 9330 (Online); 0975 - 2307 (Print)...