One of the most promising applications in VANETs is vehicle chatting, which allows like-minded vehicles to chat on the topics of common interest on the road. But, some privacy challenging issues emerged recently in vehicle chatting application. The probable issues are how to find a like-minded vehicle on the road and how to prevent one’s interest privacy (IP) from others who are not like-minded. In this paper, in order to address these challenging issues, we study an efficient privacy preserving finding like-minded vehicle protocol (FLIP), and apply the provable security technique to enhance its security.
Rejuvenate Pointcut: A Tool for Pointcut Expression Recovery in Evolving Aspe...Raffi Khatchadourian
Invited tool demonstration at the 8th International Conference on Aspect-Oriented Software Development (AOSD '09), Charlottesville, VA, USA, March 2-6, 2009.
Low Power FPGA Based Elliptical Curve CryptographyIOSR Journals
Cryptography is the study of techniques for ensuring the secrecy and authentication of the
information. The development of public-key cryptography is the greatest and perhaps the only true revolution in
the entire history of cryptography. Elliptic Curve Cryptography is one of the public-key cryptosystem showing
up in standardization efforts, including the IEEE P1363 Standard. The principal attraction of elliptic curve
cryptography compared to RSA is that it offers equal security for a smaller key-size, thereby reducing the
processing overhead. As a Public-Key Cryptosystem, ECC has many advantages such as fast speed, high
security and short key. It is suitable for the hardware of implementation, so ECC has been more and more
focused in recent years. The hardware implementation of ECC on FPGA uses the arithmetic unit that has small
area, small storage unit and fast speed, and it is an extremely suitable system which has limited computation
ability and storage space.[1][2] The modular arithmetic division operations are carried out using conditional
successive subtractions, thereby reducing the area. The system is implemented on Vertex-Pro XCV1000 FPGA
ENCRYPTION USING LESTER HILL CIPHER ALGORITHMAM Publications
The Hill cipher algorithm is one of the symmetrickey algorithms that have several advantages in data
encryption as well as decryptions. But, the inverse of the key matrix used for encrypting the plaintext does not always
exist. Then if the key matrix is not invertible, then encrypted text cannot be decrypted. In the Involuntary matrix
generation method the key matrix used for the encryption is itself invertible. So, at the time of decryption we need not to
find the inverse of the key matrix. The objective of this paper is to encrypt an text using a technique different from the
conventional Hill Cipher
This document provides an overview of elliptic curve cryptography (ECC). It discusses how ECC provides stronger security than RSA with smaller key sizes. The document describes the mathematical foundations of elliptic curves over finite fields. It explains scalar multiplication, which involves adding a point on the elliptic curve to itself multiple times, as the core operation in ECC. Finally, it discusses implementations of ECC and applications for encryption and digital signatures.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Implementation of D* Path Planning Algorithm with NXT LEGO Mindstorms Kit for...idescitation
Autonomous Robots use various Path Planning
algorithms to navigate, to the target point. In the real world
situation robot may not have a complete picture of the obstacles
in its environment. The classical path planning algorithms
such as A*, D* are cost based where the shortest path to the
target is calculated based on the distance to be travelled. In
order to provide real time shortest path solutions, cost
computation has to be redone whenever new obstacles are
identified. D* is a potential search algorithm, capable of
planning shortest path in unknown, partially known and
changing environments. This paper brings out the simulation
of D* algorithm in C++ and the results for different test cases.
It also elucidates the implementation of the algorithm with
NXT LEGO Mindstorms kit using RobotC language and
evaluation in real time scenario.
Elliptic curve cryptography (ECC) is the most efficient public key encryption scheme based on
elliptic curve concepts that can be used to create faster, smaller, and efficient cryptographic keys. ECC
generates keys through the properties of the elliptic curve equation instead of the conventional method of
key generation. This scheme can be used with public key encryption methods, such as RSA, Diffie-Hellman key
exchange and Digital Signature. Review of the four protocols which applies ECC namely Bitcoin, secure
shell (SSH), transport layer security (TLS), and the Austrian e-ID Card describes the high security by using
elliptic curve cryptography.
On the Usage of Chained Codes in CryptographyCSCJournals
This document summarizes a research paper on using randomized chained linear codes for digital signatures. The summary is:
1) Randomized chained linear codes are proposed to address attacks on previous signature schemes that used regular chained codes. Random vectors are concatenated to the generator matrix of a chained code to create randomized chained codes.
2) A digital signature scheme is presented that uses randomized chained codes. The private key consists of the generator matrix and randomization matrices. The public key is the randomized parity check matrix. Signatures are created using the chain code decoding algorithm.
3) Security analysis shows the scheme is secure if the code length is over 1350 bits, preventing an attacker from determining the private key from the public information
Rejuvenate Pointcut: A Tool for Pointcut Expression Recovery in Evolving Aspe...Raffi Khatchadourian
Invited tool demonstration at the 8th International Conference on Aspect-Oriented Software Development (AOSD '09), Charlottesville, VA, USA, March 2-6, 2009.
Low Power FPGA Based Elliptical Curve CryptographyIOSR Journals
Cryptography is the study of techniques for ensuring the secrecy and authentication of the
information. The development of public-key cryptography is the greatest and perhaps the only true revolution in
the entire history of cryptography. Elliptic Curve Cryptography is one of the public-key cryptosystem showing
up in standardization efforts, including the IEEE P1363 Standard. The principal attraction of elliptic curve
cryptography compared to RSA is that it offers equal security for a smaller key-size, thereby reducing the
processing overhead. As a Public-Key Cryptosystem, ECC has many advantages such as fast speed, high
security and short key. It is suitable for the hardware of implementation, so ECC has been more and more
focused in recent years. The hardware implementation of ECC on FPGA uses the arithmetic unit that has small
area, small storage unit and fast speed, and it is an extremely suitable system which has limited computation
ability and storage space.[1][2] The modular arithmetic division operations are carried out using conditional
successive subtractions, thereby reducing the area. The system is implemented on Vertex-Pro XCV1000 FPGA
ENCRYPTION USING LESTER HILL CIPHER ALGORITHMAM Publications
The Hill cipher algorithm is one of the symmetrickey algorithms that have several advantages in data
encryption as well as decryptions. But, the inverse of the key matrix used for encrypting the plaintext does not always
exist. Then if the key matrix is not invertible, then encrypted text cannot be decrypted. In the Involuntary matrix
generation method the key matrix used for the encryption is itself invertible. So, at the time of decryption we need not to
find the inverse of the key matrix. The objective of this paper is to encrypt an text using a technique different from the
conventional Hill Cipher
This document provides an overview of elliptic curve cryptography (ECC). It discusses how ECC provides stronger security than RSA with smaller key sizes. The document describes the mathematical foundations of elliptic curves over finite fields. It explains scalar multiplication, which involves adding a point on the elliptic curve to itself multiple times, as the core operation in ECC. Finally, it discusses implementations of ECC and applications for encryption and digital signatures.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Implementation of D* Path Planning Algorithm with NXT LEGO Mindstorms Kit for...idescitation
Autonomous Robots use various Path Planning
algorithms to navigate, to the target point. In the real world
situation robot may not have a complete picture of the obstacles
in its environment. The classical path planning algorithms
such as A*, D* are cost based where the shortest path to the
target is calculated based on the distance to be travelled. In
order to provide real time shortest path solutions, cost
computation has to be redone whenever new obstacles are
identified. D* is a potential search algorithm, capable of
planning shortest path in unknown, partially known and
changing environments. This paper brings out the simulation
of D* algorithm in C++ and the results for different test cases.
It also elucidates the implementation of the algorithm with
NXT LEGO Mindstorms kit using RobotC language and
evaluation in real time scenario.
Elliptic curve cryptography (ECC) is the most efficient public key encryption scheme based on
elliptic curve concepts that can be used to create faster, smaller, and efficient cryptographic keys. ECC
generates keys through the properties of the elliptic curve equation instead of the conventional method of
key generation. This scheme can be used with public key encryption methods, such as RSA, Diffie-Hellman key
exchange and Digital Signature. Review of the four protocols which applies ECC namely Bitcoin, secure
shell (SSH), transport layer security (TLS), and the Austrian e-ID Card describes the high security by using
elliptic curve cryptography.
On the Usage of Chained Codes in CryptographyCSCJournals
This document summarizes a research paper on using randomized chained linear codes for digital signatures. The summary is:
1) Randomized chained linear codes are proposed to address attacks on previous signature schemes that used regular chained codes. Random vectors are concatenated to the generator matrix of a chained code to create randomized chained codes.
2) A digital signature scheme is presented that uses randomized chained codes. The private key consists of the generator matrix and randomization matrices. The public key is the randomized parity check matrix. Signatures are created using the chain code decoding algorithm.
3) Security analysis shows the scheme is secure if the code length is over 1350 bits, preventing an attacker from determining the private key from the public information
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fpga implementation of linear ldpc encodereSAT Journals
Abstract In this paper, a FPGA implementation of linear time LDPC encoder is presented. This encoder implementation can handle large size of input message. Linear Time encoder hardware architecture reduces the Complexity and area of encoder than generator matrix based encoder techniques. This encoder is simulated on different platform which includes Matlab & High level languages for 1/2 rate & up to 4096 code length. FPGA implementation of the encoder is done on Xilinx Spartan 3E Starter Kit. The result shows the speed & area comparison for different FPGA platform. Keywords— LDPC codes, dual-diagonal, Linear encoding, Generator matrix complexity, FPGA Implementation
This document describes an FPGA implementation of the Park-Miller algorithm to generate a sequence of 32-bit pseudo-random keys for encrypting and decrypting text messages. The Park-Miller algorithm is used to generate the pseudo-random keys on an FPGA using 32-bit operations. The generated keys are then used to encrypt plaintext by XORing the text with the keys to produce ciphertext. The same keys are also used to decrypt the ciphertext back to the original plaintext. The design is programmed in Verilog HDL and simulated in Modelsim to verify it works as intended. It is then synthesized for and implemented on a Spartan 6E FPGA.
Slide for Arithmer Seminar given by Dr. Daisuke Sato (Arithmer) at Arithmer inc.
The topic is on "explainable AI".
"Arithmer Seminar" is weekly held, where professionals from within and outside our company give lectures on their respective expertise.
The slides are made by the lecturer from outside our company, and shared here with his/her permission.
Arithmer株式会社は東京大学大学院数理科学研究科発の数学の会社です。私達は現代数学を応用して、様々な分野のソリューションに、新しい高度AIシステムを導入しています。AIをいかに上手に使って仕事を効率化するか、そして人々の役に立つ結果を生み出すのか、それを考えるのが私たちの仕事です。
Arithmer began at the University of Tokyo Graduate School of Mathematical Sciences. Today, our research of modern mathematics and AI systems has the capability of providing solutions when dealing with tough complex issues. At Arithmer we believe it is our job to realize the functions of AI through improving work efficiency and producing more useful results for society.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
CT-SVD and Arnold Transform for Secure Color Image WatermarkingAM Publications,India
Watermarking is used for protecting copyright of digital images. In this paper, we propose a novel technique for watermarking using Contourlet Transform (CT) and Singular Value Decomposition (SVD). CT ensures imperceptibility of the watermark and SVD ensures its robustness against attacks. Arnold transform is used for scrambling watermark pixels to ensure watermark security. Watermark extraction is semi-blind, which avoids the need for original image for extraction. Both watermark and cover image are color images. Performance of the system is judged by using PSNR and Correlation Coefficient (CC) values. System shows good robustness against noise, JPEG compression, filtering and cropping
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
OpenCVand Matlab based Car Parking System Module for Smart City using Circle ...JANAK TRIVEDI
finding parking availability for a specific time period is
a very tedious job in urban areas. The Indian government now
focusing on t he smart city project, already they published city
name for a n upcoming smart city project. In smart city
application , intelligent transportation system (ITS) plays an
important role- in that finding parking place, specifically for the
car owner to avoid time computation, as well as congestion in
traffic is going to be very important. In this article, we propose
an intelligent car parking system for the smart city using Circle
Hough Transform (CHT).
Improved Performance of Fuzzy Logic Algorithm for Lane Detection ImagesIRJET Journal
1) The document proposes improving lane detection algorithms by modifying the Hough transform with fuzzy logic to handle curved lane images better.
2) It compares the performance of the traditional Hough transform method to the proposed fuzzy logic-based method using metrics like recall, accuracy, and error rates.
3) The results show that the proposed technique outperforms existing methods, particularly in the presence of noise, curved lanes, or other challenging image conditions.
Secure communication for mobile Adhoc network using (LPIT) Lagrange polynomia...AM Publications
Mobile adhoc network is collection of autonomous nodes that are frequently moving without the centralized
control. Mobile adhoc networks are multi hop wireless networks without fixed infrastructure. Node frequently change
topology, due to this type of behavior transformation of information from one node to another node is more
complicated task. Decentralized nature of mobile adhoc network is more vulnerable to attack like denial of service
(DOS) which consumes more bandwidth and resources. Security is major concern in adhoc network, so in this paper,
we propose a new algorithm based on Lagrange polynomial and Laplace transform and inverse Laplace transform to
enhance secure communication for MANET. This proposed algorithm provides security for transmission of
information among node.
This document describes a proposed car black box system using a Raspberry Pi. The system would record video, images, temperature, humidity, and motion detection using a camera module, DHT11 sensor, PIR motion sensor, and RTC. This data could help investigate the cause of accidents. The system was implemented using a Raspberry Pi connected to sensors. Testing showed it successfully detected motion and recorded video, images, temperature, and time. Future work could add more cameras, voice activation, and security features to improve evidence collection and access. The black box system aims to help determine accident causes and prevent future accidents.
IRJET- Monument Informatica Application using ARIRJET Journal
This document proposes an augmented reality application to provide tourists with interactive information about monuments. The application would superimpose videos, text, and images onto the camera view of a monument to give historical context. It would identify the user's location and nearby monuments. Tourists could view information in different languages. The system would use computer vision algorithms like template matching to recognize monuments and retrieve associated multimedia content from a database to augment the real-world view. This interactive AR guide aims to improve on traditional paper or mobile-based tour guides by overlaying informative content directly onto the monument to enhance the tourist experience.
New Blind Muti-signature Schemes based on ECDLP IJECEIAES
In various types of electronic transactions, including election systems and digital cash schemes, user anonymity and authentication are always required. Blind signatures are considered the most important solutions to meeting these requirements. Many studies have focused on blind signature schemes; however, most of the studied schemes are single blind signature schemes. Although blind multi-signature schemes are available, few studies have focused on these schemes. In this article, blind multi-signature schemes are proposed based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed schemes are based on the GOST R34.10-2012 digital signature standard and the EC-Schnorr digital signature scheme, and they satisfy blind multi-signature security requirements and have better computational performance than previously proposed schemes. The proposed schemes can be applied in election systems and digital cash schemes.
CANNY EDGE DETECTION BASED REAL-TIME INTELLIGENT PARKING MANAGEMENT SYSTEMJANAK TRIVEDI
The document describes a real-time intelligent parking management system that uses Canny edge detection. A Raspberry Pi-based module with a USB camera monitors 10 parking slots in real-time. It detects empty and occupied slots using Canny edge detection on the video feed and shares the information via a mobile app and LCD display. Sensors control the opening and closing of gates automatically upon vehicle entry and exit. The system provides up-to-date information on available parking slots to help manage traffic flow.
This document summarizes a research paper that proposes using a fuzzy ant colony system approach to solve the fuzzy vehicle routing problem with time windows (VRPTW). The paper models the fuzzy VRPTW using credibility theory to handle uncertain travel times represented as triangular fuzzy numbers. An improved ant colony system is then used as a metaheuristic to find high-quality routes that satisfy time window constraints at a desired level of confidence. Computational results on benchmark problems demonstrate the effectiveness of integrating fuzzy concepts with the ant colony system to solve the fuzzy VRPTW.
This document describes a solution called "Smart Suggest" that uses machine learning and big data techniques to help NYC taxi drivers choose pickups that will maximize their profits. K-means clustering is used to group pickup locations into zones. Factors like density, average tip, distance, and machine learning recommendations are then scored and weighted to calculate optimal pickup requests for drivers. The system was built using technologies like MapReduce, Hive, Mahout, MongoDB, and deployed as a Spring MVC web application with REST APIs.
A WHITE BOX TESTING TECHNIQUE IN SOFTWARE TESTING : BASIS PATH TESTINGJournal For Research
Software Testing is the emerging and important field of IT industry because without the concept of software testing, there is no quality software which is produced in the industry. Verification and Validation are the two basic building blocks of software testing process. There are various testing tactics, strategies and methodologies to test the software. Path Testing is one such a methodology used to test the software. Basically, path testing is a type of White Box/ Glass Box/ Open Box/ Structural testing technique. It generates the test suite based on the number of independent paths that are presented in a program by drawing the Control Flow Graph of an application. The basic objective of this paper is to acquire the knowledge on the basis path testing by considering a sample of code and the implementation of path testing is described with its merits and demerits.
Here we describe federated learning based traffic flow prediction system. In federated learning we solve the problem of data security and also provide collaborative learning. model parameter are shared here ,not data
Real Estate Investment Advising Using Machine LearningIRJET Journal
This document presents a comparative study of machine learning algorithms for real estate investment advising using property price prediction. It analyzes Linear Regression using gradient descent, K-Nearest Neighbors regression, and Random Forest regression on quarterly Mumbai real estate data from 2005-2016. Features like area, rooms, distance to landmarks, amenities are used to predict prices. Random Forest regression achieved the lowest errors in predicting testing data, making it the most feasible algorithm according to the study. The authors conclude it is a promising approach for real estate trend forecasting and developing an investment advising tool.
Vlsics040307DESIGN AND IMPLEMENTATION OF CAR PARKING SYSTEM ON FPGAVLSICS Design
As, the number of vehicles are increased day by day in rapid manner. It causes the problem of traffic
congestion, pollution (noise and air). To overcome this problem A FPGA based parking system has been
proposed. In this paper, parking system is implemented using Finite State Machine modelling. The system
has two main modules i.e. identification module and slot checking module. Identification module
identifies the visitor. Slot checking module checks the slot status. These modules are modelled in HDL
and implemented on FPGA. A prototype of parking system is designed with various interfaces like sensor
interfacing, stepper motor and LCD.
IRJET- Smart Parking System in Multi-Storey BuildingsIRJET Journal
1. The document describes a proposed smart parking system for multi-storey buildings that uses sensors, a microcontroller, cloud storage, and an Android application.
2. Infrared sensors attached to a Raspberry Pi microcontroller would detect available parking spaces and send that data to the cloud, while an Android app would allow drivers to view available spaces and reserve them.
3. The system is intended to more efficiently manage parking by monitoring space availability in real-time and allowing drivers to reserve spaces in advance through their phones.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fpga implementation of linear ldpc encodereSAT Journals
Abstract In this paper, a FPGA implementation of linear time LDPC encoder is presented. This encoder implementation can handle large size of input message. Linear Time encoder hardware architecture reduces the Complexity and area of encoder than generator matrix based encoder techniques. This encoder is simulated on different platform which includes Matlab & High level languages for 1/2 rate & up to 4096 code length. FPGA implementation of the encoder is done on Xilinx Spartan 3E Starter Kit. The result shows the speed & area comparison for different FPGA platform. Keywords— LDPC codes, dual-diagonal, Linear encoding, Generator matrix complexity, FPGA Implementation
This document describes an FPGA implementation of the Park-Miller algorithm to generate a sequence of 32-bit pseudo-random keys for encrypting and decrypting text messages. The Park-Miller algorithm is used to generate the pseudo-random keys on an FPGA using 32-bit operations. The generated keys are then used to encrypt plaintext by XORing the text with the keys to produce ciphertext. The same keys are also used to decrypt the ciphertext back to the original plaintext. The design is programmed in Verilog HDL and simulated in Modelsim to verify it works as intended. It is then synthesized for and implemented on a Spartan 6E FPGA.
Slide for Arithmer Seminar given by Dr. Daisuke Sato (Arithmer) at Arithmer inc.
The topic is on "explainable AI".
"Arithmer Seminar" is weekly held, where professionals from within and outside our company give lectures on their respective expertise.
The slides are made by the lecturer from outside our company, and shared here with his/her permission.
Arithmer株式会社は東京大学大学院数理科学研究科発の数学の会社です。私達は現代数学を応用して、様々な分野のソリューションに、新しい高度AIシステムを導入しています。AIをいかに上手に使って仕事を効率化するか、そして人々の役に立つ結果を生み出すのか、それを考えるのが私たちの仕事です。
Arithmer began at the University of Tokyo Graduate School of Mathematical Sciences. Today, our research of modern mathematics and AI systems has the capability of providing solutions when dealing with tough complex issues. At Arithmer we believe it is our job to realize the functions of AI through improving work efficiency and producing more useful results for society.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
CT-SVD and Arnold Transform for Secure Color Image WatermarkingAM Publications,India
Watermarking is used for protecting copyright of digital images. In this paper, we propose a novel technique for watermarking using Contourlet Transform (CT) and Singular Value Decomposition (SVD). CT ensures imperceptibility of the watermark and SVD ensures its robustness against attacks. Arnold transform is used for scrambling watermark pixels to ensure watermark security. Watermark extraction is semi-blind, which avoids the need for original image for extraction. Both watermark and cover image are color images. Performance of the system is judged by using PSNR and Correlation Coefficient (CC) values. System shows good robustness against noise, JPEG compression, filtering and cropping
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
OpenCVand Matlab based Car Parking System Module for Smart City using Circle ...JANAK TRIVEDI
finding parking availability for a specific time period is
a very tedious job in urban areas. The Indian government now
focusing on t he smart city project, already they published city
name for a n upcoming smart city project. In smart city
application , intelligent transportation system (ITS) plays an
important role- in that finding parking place, specifically for the
car owner to avoid time computation, as well as congestion in
traffic is going to be very important. In this article, we propose
an intelligent car parking system for the smart city using Circle
Hough Transform (CHT).
Improved Performance of Fuzzy Logic Algorithm for Lane Detection ImagesIRJET Journal
1) The document proposes improving lane detection algorithms by modifying the Hough transform with fuzzy logic to handle curved lane images better.
2) It compares the performance of the traditional Hough transform method to the proposed fuzzy logic-based method using metrics like recall, accuracy, and error rates.
3) The results show that the proposed technique outperforms existing methods, particularly in the presence of noise, curved lanes, or other challenging image conditions.
Secure communication for mobile Adhoc network using (LPIT) Lagrange polynomia...AM Publications
Mobile adhoc network is collection of autonomous nodes that are frequently moving without the centralized
control. Mobile adhoc networks are multi hop wireless networks without fixed infrastructure. Node frequently change
topology, due to this type of behavior transformation of information from one node to another node is more
complicated task. Decentralized nature of mobile adhoc network is more vulnerable to attack like denial of service
(DOS) which consumes more bandwidth and resources. Security is major concern in adhoc network, so in this paper,
we propose a new algorithm based on Lagrange polynomial and Laplace transform and inverse Laplace transform to
enhance secure communication for MANET. This proposed algorithm provides security for transmission of
information among node.
This document describes a proposed car black box system using a Raspberry Pi. The system would record video, images, temperature, humidity, and motion detection using a camera module, DHT11 sensor, PIR motion sensor, and RTC. This data could help investigate the cause of accidents. The system was implemented using a Raspberry Pi connected to sensors. Testing showed it successfully detected motion and recorded video, images, temperature, and time. Future work could add more cameras, voice activation, and security features to improve evidence collection and access. The black box system aims to help determine accident causes and prevent future accidents.
IRJET- Monument Informatica Application using ARIRJET Journal
This document proposes an augmented reality application to provide tourists with interactive information about monuments. The application would superimpose videos, text, and images onto the camera view of a monument to give historical context. It would identify the user's location and nearby monuments. Tourists could view information in different languages. The system would use computer vision algorithms like template matching to recognize monuments and retrieve associated multimedia content from a database to augment the real-world view. This interactive AR guide aims to improve on traditional paper or mobile-based tour guides by overlaying informative content directly onto the monument to enhance the tourist experience.
New Blind Muti-signature Schemes based on ECDLP IJECEIAES
In various types of electronic transactions, including election systems and digital cash schemes, user anonymity and authentication are always required. Blind signatures are considered the most important solutions to meeting these requirements. Many studies have focused on blind signature schemes; however, most of the studied schemes are single blind signature schemes. Although blind multi-signature schemes are available, few studies have focused on these schemes. In this article, blind multi-signature schemes are proposed based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed schemes are based on the GOST R34.10-2012 digital signature standard and the EC-Schnorr digital signature scheme, and they satisfy blind multi-signature security requirements and have better computational performance than previously proposed schemes. The proposed schemes can be applied in election systems and digital cash schemes.
CANNY EDGE DETECTION BASED REAL-TIME INTELLIGENT PARKING MANAGEMENT SYSTEMJANAK TRIVEDI
The document describes a real-time intelligent parking management system that uses Canny edge detection. A Raspberry Pi-based module with a USB camera monitors 10 parking slots in real-time. It detects empty and occupied slots using Canny edge detection on the video feed and shares the information via a mobile app and LCD display. Sensors control the opening and closing of gates automatically upon vehicle entry and exit. The system provides up-to-date information on available parking slots to help manage traffic flow.
This document summarizes a research paper that proposes using a fuzzy ant colony system approach to solve the fuzzy vehicle routing problem with time windows (VRPTW). The paper models the fuzzy VRPTW using credibility theory to handle uncertain travel times represented as triangular fuzzy numbers. An improved ant colony system is then used as a metaheuristic to find high-quality routes that satisfy time window constraints at a desired level of confidence. Computational results on benchmark problems demonstrate the effectiveness of integrating fuzzy concepts with the ant colony system to solve the fuzzy VRPTW.
This document describes a solution called "Smart Suggest" that uses machine learning and big data techniques to help NYC taxi drivers choose pickups that will maximize their profits. K-means clustering is used to group pickup locations into zones. Factors like density, average tip, distance, and machine learning recommendations are then scored and weighted to calculate optimal pickup requests for drivers. The system was built using technologies like MapReduce, Hive, Mahout, MongoDB, and deployed as a Spring MVC web application with REST APIs.
A WHITE BOX TESTING TECHNIQUE IN SOFTWARE TESTING : BASIS PATH TESTINGJournal For Research
Software Testing is the emerging and important field of IT industry because without the concept of software testing, there is no quality software which is produced in the industry. Verification and Validation are the two basic building blocks of software testing process. There are various testing tactics, strategies and methodologies to test the software. Path Testing is one such a methodology used to test the software. Basically, path testing is a type of White Box/ Glass Box/ Open Box/ Structural testing technique. It generates the test suite based on the number of independent paths that are presented in a program by drawing the Control Flow Graph of an application. The basic objective of this paper is to acquire the knowledge on the basis path testing by considering a sample of code and the implementation of path testing is described with its merits and demerits.
Here we describe federated learning based traffic flow prediction system. In federated learning we solve the problem of data security and also provide collaborative learning. model parameter are shared here ,not data
Real Estate Investment Advising Using Machine LearningIRJET Journal
This document presents a comparative study of machine learning algorithms for real estate investment advising using property price prediction. It analyzes Linear Regression using gradient descent, K-Nearest Neighbors regression, and Random Forest regression on quarterly Mumbai real estate data from 2005-2016. Features like area, rooms, distance to landmarks, amenities are used to predict prices. Random Forest regression achieved the lowest errors in predicting testing data, making it the most feasible algorithm according to the study. The authors conclude it is a promising approach for real estate trend forecasting and developing an investment advising tool.
Vlsics040307DESIGN AND IMPLEMENTATION OF CAR PARKING SYSTEM ON FPGAVLSICS Design
As, the number of vehicles are increased day by day in rapid manner. It causes the problem of traffic
congestion, pollution (noise and air). To overcome this problem A FPGA based parking system has been
proposed. In this paper, parking system is implemented using Finite State Machine modelling. The system
has two main modules i.e. identification module and slot checking module. Identification module
identifies the visitor. Slot checking module checks the slot status. These modules are modelled in HDL
and implemented on FPGA. A prototype of parking system is designed with various interfaces like sensor
interfacing, stepper motor and LCD.
IRJET- Smart Parking System in Multi-Storey BuildingsIRJET Journal
1. The document describes a proposed smart parking system for multi-storey buildings that uses sensors, a microcontroller, cloud storage, and an Android application.
2. Infrared sensors attached to a Raspberry Pi microcontroller would detect available parking spaces and send that data to the cloud, while an Android app would allow drivers to view available spaces and reserve them.
3. The system is intended to more efficiently manage parking by monitoring space availability in real-time and allowing drivers to reserve spaces in advance through their phones.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Implementation of Secured Car Parking Management System Using Verilog HDLIJERA Editor
Present days usage of motor vehicles are increased day by day, it causes the pollution, traffic congestion and parking place problems. In this paper we proposed a secured car parking management system using Verilog HDL. This system has two main modules Module-1: Slot identification for parking and LCD display screens, Module-2: Security indicator will provide security to the car, if unauthorized person want to vacant the car. These modules are modeled in Verilog HDL and implemented on FPGA.
This case study examines the impact of sales, fixed assets, and interest paid on the profitability of a major logistics company, GATI Limited, using multiple linear regression analysis. The regression analysis found that profitability is significantly and positively impacted by increases in fixed assets, and significantly and negatively impacted by increases in interest paid. Sales volume has a positive but minimal impact on profitability. Seasonality was also found to impact profitability. Overall, infrastructure development programs are expected to strengthen growth for the logistics industry by reducing costs, though current economic conditions remain challenging due to global slowdown.
IRJET- Number Plate Recognition by using Open CV- PythonIRJET Journal
This document presents a license plate recognition system using OpenCV and Python. The system takes an image as input, pre-processes it by converting it to grayscale and applying thresholding. It then localizes the license plate using contour detection and extracts the plate. The characters on the plate are segmented and recognized using KNN algorithm. The system outputs the recognized characters. It discusses existing license plate recognition methods and proposes this system to address challenges with Indian license plates like variations in fonts, sizes, and colors. The system achieves accurate localization and recognition of license plates.
Automatic face and VLP’S recognition for smart parking systemTELKOMNIKA JOURNAL
One of the concerning issues regarding smart city is Smart Parking. In Smart Parking, some
researchers try to provide solutions and breakthroughs on several research topics among security
systems, the availability of single space, an IoT framework, etc. In this study, we proposed a security
system on Smart Parking based on face recognition and VLP’s (Vehicle License Plates) identification. In
this research, SSIM (Structural Similarity) method as part of IQA has been applied due to its reliability and
simple computation for face detection and recognition process. From the test results of 30 data, obtained
the highest SSIM value 0.83 with the highest accuracy rate of 76.67%. That level of accuracy still has not
reached the implementation standard of 99.9%. So that it still needs to be improved in the future studies,
especially in the filtering noise section.
This document summarizes a research paper on number plate detection using optical character recognition. The system uses a webcam to capture images of vehicles entering a gate. It then detects the number plate using template matching and optical character recognition. The detected license plate numbers are stored in a database and compared to a blacklist to control access. The system is designed for security applications like access control and monitoring vehicles at borders or toll stations. It analyzes the captured images through steps like binarization, number plate area detection, segmentation of characters, and identification of numbers using templates for storage and comparison.
Similar to Modification the Security of Flip Protocol by Changing the Base Point Selection (20)
Home security is of paramount importance in today's world, where we rely more on technology, home
security is crucial. Using technology to make homes safer and easier to control from anywhere is
important. Home security is important for the occupant’s safety. In this paper, we came up with a low cost,
AI based model home security system. The system has a user-friendly interface, allowing users to start
model training and face detection with simple keyboard commands. Our goal is to introduce an innovative
home security system using facial recognition technology. Unlike traditional systems, this system trains
and saves images of friends and family members. The system scans this folder to recognize familiar faces
and provides real-time monitoring. If an unfamiliar face is detected, it promptly sends an email alert,
ensuring a proactive response to potential security threats.
In the era of data-driven warfare, the integration of big data and machine learning (ML) techniques has
become paramount for enhancing defence capabilities. This research report delves into the applications of
big data and ML in the defence sector, exploring their potential to revolutionize intelligence gathering,
strategic decision-making, and operational efficiency. By leveraging vast amounts of data and advanced
algorithms, these technologies offer unprecedented opportunities for threat detection, predictive analysis,
and optimized resource allocation. However, their adoption also raises critical concerns regarding data
privacy, ethical implications, and the potential for misuse. This report aims to provide a comprehensive
understanding of the current state of big data and ML in defence, while examining the challenges and
ethical considerations that must be addressed to ensure responsible and effective implementation.
Cloud Computing, being one of the most recent innovative developments of the IT world, has been
instrumental not just to the success of SMEs but, through their productivity and innovative contribution to
the economy, has even made a remarkable contribution to the economic growth of the United States. To
this end, the study focuses on how cloud computing technology has impacted economic growth through
SMEs in the United States. Relevant literature connected to the variables of interest in this study was
reviewed, and secondary data was generated and utilized in the analysis section of this paper. The findings
of this paper revealed that there have been meaningful contributions that the usage of virtualization has
made in the commercial dealings of small firms in the United States, and this has also been reflected in the
economic growth of the country. This paper further revealed that as important as cloud-based software is,
some SMEs are still skeptical about how it can help improve their business and increase their bottom line
and hence have failed to adopt it. Apart from the SMEs, some notable large firms in different industries,
including information and educational services, have adopted cloud computing technology and hence
contributed to the economic growth of the United States. Lastly, findings from our inferential statistics
revealed that no discernible change has occurred in innovation between small and big businesses in the
adoption of cloud computing. Both categories of businesses adopt cloud computing in the same way, and
their contribution to the American economy has no significant difference in the usage of virtualization.
Energy-constrained Wireless Sensor Networks (WSNs) have garnered significant research interest in
recent years. Multiple-Input Multiple-Output (MIMO), or Cooperative MIMO, represents a specialized
application of MIMO technology within WSNs. This approach operates effectively, especially in
challenging and resource-constrained environments. By facilitating collaboration among sensor nodes,
Cooperative MIMO enhances reliability, coverage, and energy efficiency in WSN deployments.
Consequently, MIMO finds application in diverse WSN scenarios, spanning environmental monitoring,
industrial automation, and healthcare applications.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication. IJCSIT publishes original research papers and review papers, as well as auxiliary material such as: research papers, case studies, technical reports etc.
With growing, Car parking increases with the number of car users. With the increased use of smartphones
and their applications, users prefer mobile phone-based solutions. This paper proposes the Smart Parking
Management System (SPMS) that depends on Arduino parts, Android applications, and based on IoT. This
gave the client the ability to check available parking spaces and reserve a parking spot. IR sensors are
utilized to know if a car park space is allowed. Its area data are transmitted using the WI-FI module to the
server and are recovered by the mobile application which offers many options attractively and with no cost
to users and lets the user check reservation details. With IoT technology, the smart parking system can be
connected wirelessly to easily track available locations.
Welcome to AIRCC's International Journal of Computer Science and Information Technology (IJCSIT), your gateway to the latest advancements in the dynamic fields of Computer Science and Information Systems.
Computer-Assisted Language Learning (CALL) are computer-based tutoring systems that deal with
linguistic skills. Adding intelligence in such systems is mainly based on using Natural Language
Processing (NLP) tools to diagnose student errors, especially in language grammar. However, most such
systems do not consider the modeling of student competence in linguistic skills, especially for the Arabic
language. In this paper, we will deal with basic grammar concepts of the Arabic language taught for the
fourth grade of the elementary school in Egypt. This is through Arabic Grammar Trainer (AGTrainer)
which is an Intelligent CALL. The implemented system (AGTrainer) trains the students through different
questions that deal with the different concepts and have different difficulty levels. Constraint-based student
modeling (CBSM) technique is used as a short-term student model. CBSM is used to define in small grain
level the different grammar skills through the defined skill structures. The main contribution of this paper
is the hierarchal representation of the system's basic grammar skills as domain knowledge. That
representation is used as a mechanism for efficiently checking constraints to model the student knowledge
and diagnose the student errors and identify their cause. In addition, satisfying constraints and the number
of trails the student takes for answering each question and fuzzy logic decision system are used to
determine the student learning level for each lesson as a long-term model. The results of the evaluation
showed the system's effectiveness in learning in addition to the satisfaction of students and teachers with its
features and abilities.
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
This research aims to further understanding in the field of continuous authentication using behavioural
biometrics. We are contributing a novel dataset that encompasses the gesture data of 15 users playing
Minecraft with a Samsung Tablet, each for a duration of 15 minutes. Utilizing this dataset, we employed
machine learning (ML) binary classifiers, being Random Forest (RF), K-Nearest Neighbors (KNN), and
Support Vector Classifier (SVC), to determine the authenticity of specific user actions. Our most robust
model was SVC, which achieved an average accuracy of approximately 90%, demonstrating that touch
dynamics can effectively distinguish users. However, further studies are needed to make it viable option
for authentication systems. You can access our dataset at the following
link:https://github.com/AuthenTech2023/authentech-repo
This paper discusses the capabilities and limitations of GPT-3 (0), a state-of-the-art language model, in the
context of text understanding. We begin by describing the architecture and training process of GPT-3, and
provide an overview of its impressive performance across a wide range of natural language processing
tasks, such as language translation, question-answering, and text completion. Throughout this research
project, a summarizing tool was also created to help us retrieve content from any types of document,
specifically IELTS (0) Reading Test data in this project. We also aimed to improve the accuracy of the
summarizing, as well as question-answering capabilities of GPT-3 (0) via long text
In the realm of computer security, the importance of efficient and reliable user authentication methods has
become increasingly critical. This paper examines the potential of mouse movement dynamics as a
consistent metric for continuous authentication. By analysing user mouse movement patterns in two
contrasting gaming scenarios, "Team Fortress" and "Poly Bridge," we investigate the distinctive
behavioral patterns inherent in high-intensity and low-intensity UI interactions. The study extends beyond
conventional methodologies by employing a range of machine learning models. These models are carefully
selected to assess their effectiveness in capturing and interpreting the subtleties of user behavior as
reflected in their mouse movements. This multifaceted approach allows for a more nuanced and
comprehensive understanding of user interaction patterns. Our findings reveal that mouse movement
dynamics can serve as a reliable indicator for continuous user authentication. The diverse machine
learning models employed in this study demonstrate competent performance in user verification, marking
an improvement over previous methods used in this field. This research contributes to the ongoing efforts to
enhance computer security and highlights the potential of leveraging user behavior, specifically mouse
dynamics, in developing robust authentication systems.
Image segmentation and classification tasks in computer vision have proven to be highly effective using neural networks, specifically Convolutional Neural Networks (CNNs). These tasks have numerous
practical applications, such as in medical imaging, autonomous driving, and surveillance. CNNs are capable
of learning complex features directly from images and achieving outstanding performance across several
datasets. In this work, we have utilized three different datasets to investigate the efficacy of various preprocessing and classification techniques in accurssedately segmenting and classifying different structures
within the MRI and natural images. We have utilized both sample gradient and Canny Edge Detection
methods for pre-processing, and K-means clustering have been applied to segment the images. Image
augmentation improves the size and diversity of datasets for training the models for image classification.
This work highlights transfer learning’s effectiveness in image classification using CNNs and VGG 16 that
provides insights into the selection of pre-trained models and hyper parameters for optimal performance.
We have proposed a comprehensive approach for image segmentation and classification, incorporating preprocessing techniques, the K-means algorithm for segmentation, and employing deep learning models such
as CNN and VGG 16 for classification.
- The document presents 6 different models for defining foot size in Tunisia: 2 statistical models, 2 neural network models using unsupervised learning, and 2 models combining neural networks and fuzzy logic.
- The statistical models (SM and SHM) are based on applying statistical equations to morphological foot data.
- The neural network models (MSK and MHSK) use self-organizing Kohonen maps to cluster foot data and model full and half sizes.
- The fuzzy neural network models (MSFK and MHSFK) incorporate fuzzy logic into the neural network learning process to better account for uncertainty in foot sizes.
The security of Electric Vehicle (EV) charging has gained momentum after the increase in the EV adoption
in the past few years. Mobile applications have been integrated into EV charging systems that mainly use a
cloud-based platform to host their services and data. Like many complex systems, cloud systems are
susceptible to cyberattacks if proper measures are not taken by the organization to secure them. In this
paper, we explore the security of key components in the EV charging infrastructure, including the mobile
application and its cloud service. We conducted an experiment that initiated a Man in the Middle attack
between an EV app and its cloud services. Our results showed that it is possible to launch attacks against
the connected infrastructure by taking advantage of vulnerabilities that may have substantial economic and
operational ramifications on the EV charging ecosystem. We conclude by providing mitigation suggestions
and future research directions.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
The AIRCC's International Journal of Computer Science and Information Technology (IJCSIT) is devoted to fields of Computer Science and Information Systems. The IJCSIT is a open access peer-reviewed scientific journal published in electronic form as well as print form. The mission of this journal is to publish original contributions in its field in order to propagate knowledge amongst its readers and to be a reference publication.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
AI in customer support Use cases solutions development and implementation.pdfmahaffeycheryld
AI in customer support will integrate with emerging technologies such as augmented reality (AR) and virtual reality (VR) to enhance service delivery. AR-enabled smart glasses or VR environments will provide immersive support experiences, allowing customers to visualize solutions, receive step-by-step guidance, and interact with virtual support agents in real-time. These technologies will bridge the gap between physical and digital experiences, offering innovative ways to resolve issues, demonstrate products, and deliver personalized training and support.
https://www.leewayhertz.com/ai-in-customer-support/#How-does-AI-work-in-customer-support
Height and depth gauge linear metrology.pdfq30122000
Height gauges may also be used to measure the height of an object by using the underside of the scriber as the datum. The datum may be permanently fixed or the height gauge may have provision to adjust the scale, this is done by sliding the scale vertically along the body of the height gauge by turning a fine feed screw at the top of the gauge; then with the scriber set to the same level as the base, the scale can be matched to it. This adjustment allows different scribers or probes to be used, as well as adjusting for any errors in a damaged or resharpened probe.
Open Channel Flow: fluid flow with a free surfaceIndrajeet sahu
Open Channel Flow: This topic focuses on fluid flow with a free surface, such as in rivers, canals, and drainage ditches. Key concepts include the classification of flow types (steady vs. unsteady, uniform vs. non-uniform), hydraulic radius, flow resistance, Manning's equation, critical flow conditions, and energy and momentum principles. It also covers flow measurement techniques, gradually varied flow analysis, and the design of open channels. Understanding these principles is vital for effective water resource management and engineering applications.
Supermarket Management System Project Report.pdfKamal Acharya
Supermarket management is a stand-alone J2EE using Eclipse Juno program.
This project contains all the necessary required information about maintaining
the supermarket billing system.
The core idea of this project to minimize the paper work and centralize the
data. Here all the communication is taken in secure manner. That is, in this
application the information will be stored in client itself. For further security the
data base is stored in the back-end oracle and so no intruders can access it.
Modification the Security of Flip Protocol by Changing the Base Point Selection
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
DOI:10.5121/ijcsit.2017.93011 131
MODIFICATION THE SECURITY OF FLIP PROTOCOL
BY CHANGING THE BASE POINT SELECTION
Nabamita Deb and Moumita Roy
Department of Information Technology Gauhati University
Guwahati, India
ABSTRACT
One of the most promising applications in VANETs is vehicle chatting, which allows like-minded vehicles
to chat on the topics of common interest on the road. But, some privacy challenging issues emerged
recently in vehicle chatting application. The probable issues are how to find a like-minded vehicle on the
road and how to prevent one’s interest privacy (IP) from others who are not like-minded. In this paper, in
order to address these challenging issues, we study an efficient privacy preserving finding like-minded
vehicle protocol (FLIP), and apply the provable security technique to enhance its security.
KEYWORDS
VANET,vehicle chatting, ECC, base point, ECDSA, interest privacy, finding like-minded vehicle
1. INTRODUCTION
Vehicular Ad hoc Networks (VANETs) have been subject to extensive research efforts not only
from the government, but also from the academia and automobile industry in recent years. In
VANET, an OnBoard Unit (OBU) device is attached with all vehicles which allows them to
communicate with each other, i.e., vehicle-to-vehicle (V-2-V) communication, as well as to the
Roadside Units (RSUs), i.e., vehicle-to-infrastructure (V-2-I) communication. Now, if we
compare it with the traditional ad hoc network, then it can be seen that the hybrid of V-2-V and
V-2-I communications makes VANETs more promising, and it can also provide a board of
safety-related (e.g., emergency news, warning about collisions) and non-safety-related (vehicle-
vehicle chat, sharing files, downloading videos on the road) applications which are basically close
to our day to day activities.
And because of these applications, VANETs are being attractive to the public. Though several
researches are being conducted on VANET, but as per our knowledge, the interest privacy, as a
special privacy requirement in vehicle chatting application, has not been yet explored much.
Therefore, how to identify a vehicle who is like-minded and establish a shared session key for
secure chatting, and how to prevent other vehicles who are not like-minded from knowing one
vehicle’s interest have become two newly emerging privacy challenges in vehicle chatting
application.[4]
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
132
2. SYSTEM MODEL AND DESIGN GOAL
2.1 SYSTEM MODEL
We consider a scenario which consists of a number of vehicles V = {V1, V2, · · ·} and a single
offline trusted authority (TA). Since our problem is confined to the scenario where vehicles are
required to find like-minded vehicles with common interest on the road without the assistance of
RSUs, RSUs are not included in our current model. Trust Authority (TA): TA is a trustable and
powerful entity. Its responsibility is to manage the whole network, such as, to initialize the
system, to register the vehicles in the system by assigning a finite set of pseudo-IDs and the
corresponding key materials to each vehicle. It should be noted that TA is an offline entity and is
not directly involved in the V-2-V communications.
When two vehicles Va, and Vb ∈ V are within their transmission range, they can chat on the
topics of common interest on the road.
2.2 DESIGN GOAL
Security requirements and design goal: Security and privacy are always of vital importance to the
flourish of vehicle chatting application in VANET. Without the guarantee of vehicle’s privacy
including identity privacy, location privacy and interest privacy, vehicle chatting application can’t
be widely accepted by the public. Therefore, it is essential to protect vehicle’s privacy.
Specifically, the following security requirements should be ensured in vehicle chatting
application:
i) Vehicle’s real identity should be protected;
ii)Vehicle’s location privacy should be guaranteed; and
iii) Vehicle’s interests should be protected against others who don’t have the common interest.
In regard of the former two security requirements, each vehicle can use pseudo-ID to conceal the
real identity, and periodically change multiple pseudo-IDs to achieve the location privacy.
However, for the third security requirement, vehicles should use some IP-preserving protocols to
find other vehicle that have the common interest on the road. Concretely, when a vehicle Va
wants to talk with another vehicle Vb nearby, if Vb has the common interest with Va, Va and Vb
can establish a shared session key used for secure chatting on the topics of common interest.
However, if Vb doesn’t have the common interest with Va, neither Va nor Vb can know the
counterpart’s interest. Besides the above requirements, the time complexity should be less, the
computational cost needed should be less and the protocol should be resistant to attacks. In this
paper, these points will be taken into consideration.
3. OPTIMUM BASE POINT CHOICE ALGORITHM
Base point or generator point selection in ECC is the prime step for its security. The efficiency of
the choice of base point is needed for reducing the time complexity of the algorithm thereby
reducing the overall computational cost. So, the effectiveness of base point is necessary. Some
chooses a random point on the curve as base point while some chooses the smallest point on the
curve as the generator point. But there are some algorithms which gives optimum base point
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
133
selection method. One such method is described below and it uses quadratic residue of mod p to
find the base point [1]. The base point of ECC on GF(p) is given below:
In ECC of GF(p), p is a prime number and Fp is a finite field of mod p. ECC uses modular
arithmetic, so in modular form, the elliptic curve equation E over Fp can be defined as:
Here, a and b are the curve parameters as stated earlier. Now if there is a point (x,y) which meets
the above equation, then the number (x, y) is a point on the elliptic curve E. E(Fp) is used to
represent set of all point which meets the curve E. The domain parameters of ECC on GF(p) are
(q, a, b, p, n, h ) where q is the module, a and b are the coefficient of ECC, n is the order of the
base point, h is the cofactor of n.. Let assume a and p are integers, p>0, so if there is solution to
x2 = a mod p, we called a is quadratic residue of mod p; if the solution doesn’t exist, a is
quadratic non-residue of mod p. if the numbers among 1,2,…, p which are relatively-prime with p
must be quadratic residue of mod p, but some of them may be congruent about mode p. The basic
idea of the algorithm is that at first we have to select an effective random point on the curve and
then scalar multiplication is done using the random point. Finally, the scalar multiplication value
is being used to judge the base point of the elliptic curve.
ALGORITHM 1: THE BASE POINT CHOICE ALGORITHM OF ECC ON GF(P).
Input: a, b, p, n, h.
Output: Effective base point G on curve having order n.
Steps:
S1. Randomly choose x (0 ≤ x < p);
S2. a =(x3 + ax + b) mod p;
S3. Judging whether a belongs to quadratic residue of mod p, if so y is gotten, marked G = (x, y)
go to S4, if not, go to S1.
S4. According to point G to compute G = hG, then judging whether G meets y2 = x3 + ax + b and
G is not infinite point. If so, G is the solved base point, then go S5, if not, go to s1.
S5. Return G
ALGORITHM 2: TO JUDGE WHETHER A IS QUADRATIC RESIDUE AND GET THE COORDINATE Y.
Input: a, p, among them, a is gotten from S2 of Algorithm 1, p is mod;
Output: a, y, among them, a is gotten from S2 of Algorithm 1, y is y-coordinate;
STEPS:
S1. If a=0, return (0, 0), or go to S2
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
134
S2. sum←0, y←1, i←1
S3. for i←1 to p do
sum← (sum+i) mod p,
if a=sum then
return (a,y),
else y←y+1, i←i+2,
if i=p
return (-1,-1)[1].
4. FLIP PROTOCOL
In this section, we study our basic protocol which is efficient privacy -preserving finding like-
minded vehicle protocol (FLIP and it mainly consists of two parts: system initialization and
privacy preserving finding like-minded vehicle on the road.[3]
4.1 SYSTEM INITIALIZATION:
Notation: Let an integer k € N, then 1ª is the string of a 1s. If x,y are two strings, then x||y is the
concatenation of x and y. In system initialization phase, the Trusted Authority (TA) first
initializes the whole system by running the following steps. Given the security parameter l, TA
generates an elliptic curve group G = <P>, where the generator P is being chosen with the
protocol described in section (IV). Then, TA chooses a random number s € Z*q as the master key
and compute the corresponding system public key Ppub = sP . In addition, TA also chooses four
secure hash functions H, H0, H1, and H2, where H : {0, 1}* → G and Hi : {0, 1}* → Z*q , for i
= 0, 1, 2. In the end, TA publishes the public system parameters params as {G, P, q, Ppub, H, H0,
H1, H2} and keeps the master key secretly. When a vehicle Vi € V itself to the system, TA first
checks the vehicle Vi’s validity. If Vi is valid, TA generates a family of pseudo-IDs and the
corresponding key materials for Vi using Algorithm 3. In such a way, Vi can constantly change
its pseudo-IDs to achieve identity privacy and location privacy on the road.
When a vehicle Vi € V itself to the system, TA first checks the vehicle Vi’s validity. If Vi is
valid, TA generates a family of pseudo-IDs and the corresponding key materials for Vi using
Algorithm 3. In such a way, Vi can constantly change its pseudo-IDs to achieve identity privacy
and location privacy on the road.
ALGORITHM 3: VEHICLE REGISTRATION ALGORITHM
1: procedure VEHICLEREGISTRATION
INPUT: a verified vehicle Vi € V
OUTPUT: a family of pseudo-IDs and the corresponding key materials
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
135
2: choose a family of unlinkable pseudo-IDs PID = {pid1, pid2, · · · }
3: for each pseudo-ID pidi € PID do
4: randomly choose a private key xi € Z*q
5: compute the corresponding public key Yi = xiP
6: assert (pidi, Yi) with certificate certi signed by TA with s
7: end for
8: return all tuples (pidi, xi, Yi, certi) to Vi
9: end procedure
B. Privacy-preserving Finding Like-minded Vehicle:
When a vehicle Va € V is on the road and wants to find a like-minded vehicle Vb € V on the
common interest Iα nearby, they will run the following steps to establish a shared session key sk
regarding the common interest Iα.
Figure.1: Privacy-preserving Finding Like-minded Vehicle Protocol [3]
Step 1
Va first sets an interest set I, which consists of k kinds of interests {I1, I2, · · · , Ik}, where Va’s
actual interest I+ is involved. Then, Va chooses a random number x € Z*q, computes X = xH(I+),
and uses the ECDSA algorithm to make a signature σa = ECDSA(I||X) on I||X with regard to the
pseudo-ID pida and the certificate certa. In the end, Va broadcasts the request I||X||σa||pida||certa
to the nearby vehicles.
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
136
Step 2
Upon receiving the request I||X||σa||pida||certa, a nearby vehicle Vb first checks the validity of σa
with pida||certa. If it is invalid, Vb neglects the request. Otherwise, Vb chooses his interest I− € I
and a random number y € Z*q , computes Y = yH(I−), Z = yX, and Auth0 = H0(pida||pidb||Z). In
addition, Vb makes a signature σb = ECDSA(X||Y ||Auth0) on X||Y ||Auth0 with regard to the
pseudo-ID pidb and the certificate certb, and returns the response X||Y ||Auth0||σb||pidb||certb to
Va. Note that, in the protocol, Vb is only allowed to make at most one response for the same
request.
Step 3
After receiving the responsor Vb’s response X||Y||Auth0||σb||pidb||certb, the requestor Va first
checks the validity of σb with pidb||certb. If it is invalid, Va neglects the response. Otherwise, Va
computes Z'= xY , and checks whether Auth0?=H0(pida||pidb||Z'). If it holds, Va computes and
sends Auth1 = H1(pida||pidb||Z') to Vb, and calculate the session key sk = H2(pida||pidb||Z').
Step 4
When Vb receives Auth1 = H1 (pida||pidb||Z'), he checks whether Auth1? = H1 (pida||pidb||Z). If
it holds, Vb calculates the session key sk = H2 (pida||pidb||Z). If I+ = I− = Iα for some 1 ≤ α ≤ k,
Va and Vb have the shared session key sk, i.e., the vehicle Va successfully finds an like-minded
vehicle Vb on the road.
As it can be seen that, ECDSA is being used for signature generation and verification, now besides
strengthening the base point of ECC, we can also strengthen the hash function required to be used
in ECDSA. From [3], it is not being said which hash function is used, but here we use Sha-256 in
place of the traditional Sha-1 which is normally being used in ECDSA. The reason Sha-256 is
being used is because of the fact that it is more secured than the other hash algorithms and
moreover it shows efficient results while coding with java. A comparative study is being shown in
[11, 12, 13, and 14] about the advantages of taking Sha-256 in place of other hashing algorithms.
Since the protocol steps remain the same, so with that the correctness of the protocol follows.
5. EFFICIENCY
The efficient and optimum choosing of base point made the protocol more efficient in terms of
computational costs. If we consider Tm being the time taken for one point multiplication with the
generator point G and Ts and Tv the time taken for ECDSA signing and verification, respectively,
then since these operations are mainly responsible for the speed of FLIP, we can neglect others
such as hash operations. Now, from the FLIP protocol of [3], only 2Tm + Ts + Tv will be
required by both the requestor Va and the responsor Vb. The execution time of Tm is being found
as nearly 2.11 ms, that is Tm ≈ 2.11 ms, and based on the results of [7], we know, Ts ≈ 2.14 ms,
Tv ≈ 3.58 ms for a 256-bit ECDSA. Then, the computational costs are only 2Tm + Ts + Tv ≈
9.94 ms. Since, efficient choosing of base point reduced the computational cost to a good extent,
that is, the time taken to perform one point multiplication, ECDSA signing and verification, has
been found very less and therefore, it is more efficient than the one described by [3].
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
6. SECURITY ANALYSIS
We know ECDSA signature cannot be forged and if the transcripts are being altered by the
adversary, it will get detected. Now in the paper of FLIP by Rongxing Lu et.al. it is already
proved that its IP can be protected in the due time and since we also used the same tool that is
ECC and same basic protocol, then obviously in the enhanced one its IP will also be protected. In
addition to that we used an optimum base point choice algorithm which is more efficient
one in [3]. The base point choice algorithm reduces the time complexity to [1] which is better
than the one considered in [3], thereby reducing the overall computational cost. Along with that,
in ECDSA, SHA-256 is being taken as the hash function
protocol because the security of ECC lies in its efficient base point sele
function.
7. PERFORMANCE EVALUATION
In the FLIP protocol, in order to prevent successive guessing attack from non
vehicle, the responsor Vb is only allowed to respond once for the same request. Therefore, when
large number of interests is being considered by the requestor Va, the harder the actual interest I
€ I can be guessed by non-like-
size of the interest becomes large, it takes more for Vb to choose the correct interest which causes
delay in finding like-minded vehicle. So, in this section we implement the protocol in java with
the changes being made and try to record how the size of the interest affects the time taken
required to find like-minded vehicle. Fig 2 reflects the time taken for finding a like
vehicle under the different size of interest.
Figure. 2 : Time Taken For
8. RELATED WORK
Recently, several research works have been reported [5], [6], which are closely related to the
proposed FLIP protocol, but focus on other scenarios different from VANETs. Different from the
other works, Rongxing Lu [3,4] proposed FLIP protocol, can provide
establish a shared session key between two like
29.98
29.99
30
30.01
30.02
30.03
30.04
1
TimeTaken(second)
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
We know ECDSA signature cannot be forged and if the transcripts are being altered by the
adversary, it will get detected. Now in the paper of FLIP by Rongxing Lu et.al. it is already
protected in the due time and since we also used the same tool that is
ECC and same basic protocol, then obviously in the enhanced one its IP will also be protected. In
addition to that we used an optimum base point choice algorithm which is more efficient
one in [3]. The base point choice algorithm reduces the time complexity to [1] which is better
than the one considered in [3], thereby reducing the overall computational cost. Along with that,
256 is being taken as the hash function which strengthens the security of FLIP
protocol because the security of ECC lies in its efficient base point selection and strong hash
VALUATION
In the FLIP protocol, in order to prevent successive guessing attack from non
vehicle, the responsor Vb is only allowed to respond once for the same request. Therefore, when
large number of interests is being considered by the requestor Va, the harder the actual interest I
-minded vehicle, and thus the IP can be protected. But when the
size of the interest becomes large, it takes more for Vb to choose the correct interest which causes
minded vehicle. So, in this section we implement the protocol in java with
eing made and try to record how the size of the interest affects the time taken
minded vehicle. Fig 2 reflects the time taken for finding a like
vehicle under the different size of interest.
Time Taken For Finding Like-minded Vehicle under different I
Recently, several research works have been reported [5], [6], which are closely related to the
proposed FLIP protocol, but focus on other scenarios different from VANETs. Different from the
other works, Rongxing Lu [3,4] proposed FLIP protocol, can provide mutual authentication and
establish a shared session key between two like-minded vehicles. The security of ECDSA
2 3 4 5 6 7 8 9 10
The Size of Interest Set (I)
International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
137
We know ECDSA signature cannot be forged and if the transcripts are being altered by the
adversary, it will get detected. Now in the paper of FLIP by Rongxing Lu et.al. it is already
protected in the due time and since we also used the same tool that is
ECC and same basic protocol, then obviously in the enhanced one its IP will also be protected. In
addition to that we used an optimum base point choice algorithm which is more efficient than the
one in [3]. The base point choice algorithm reduces the time complexity to [1] which is better
than the one considered in [3], thereby reducing the overall computational cost. Along with that,
which strengthens the security of FLIP
ction and strong hash
In the FLIP protocol, in order to prevent successive guessing attack from non-like-minded
vehicle, the responsor Vb is only allowed to respond once for the same request. Therefore, when
large number of interests is being considered by the requestor Va, the harder the actual interest Iα
d thus the IP can be protected. But when the
size of the interest becomes large, it takes more for Vb to choose the correct interest which causes
minded vehicle. So, in this section we implement the protocol in java with
eing made and try to record how the size of the interest affects the time taken
minded vehicle. Fig 2 reflects the time taken for finding a like-minded
Recently, several research works have been reported [5], [6], which are closely related to the
proposed FLIP protocol, but focus on other scenarios different from VANETs. Different from the
mutual authentication and
minded vehicles. The security of ECDSA
10
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 9, No 3, June 2017
138
algorithm lies in the efficiency of base point selection. So, in this paper, we tried to give an
efficient base point algorithm through which the security of ECDSA increases thereby increasing
the security of FLIP algorithm. Also the overall computational cost is also found to be reduced to
a good extent and more importantly, it is a provably secure protocol suitable for VANET
scenarios.
9. CONCLUSION
Protecting vehicle’s IP can be done by secure finding like-minded vehicles protocol (FLIP) and
its importance is hugely related to the success of vehicle chatting application on the road. But,
this scenario hasn’t paid enough attention in VANET. In this paper, we have tried to study the
FLIP protocol, which is an efficient IP preserving protocol, and tried to make it more secure by
making changes in the base point thereby reducing the overall computational cost and taking sha-
256 as the hash function which is better than the traditional SHA-1 and others in terms of
security. In addition, the vehicle’s IP is also preserved that is because the protocol keeps each
other’s IP-preserving if two vehicles don’t have the common interest and so, it can be widely
accepted by the public.
REFERENCES
[1] Cui, Y., Hu, Y., & Li, T. (2010). An Optimization Base Point Choice Algorithm of ECC on GF(p).
2010 Second International Conference on Computer Modeling and Simulation, 4, 103-105.
[2] Security Issues in Vehicular Ad Hoc Networks by P. Caballero-Gil University of La Laguna, Spain.
Online at http://cdn.intechweb.org/pdfs/12879.pdf
[3] Lu, R., Lin, X., Liang, X., & Shen, X. (2010). FLIP: An Efficient Privacy-Preserving Protocol for
Finding Like-Minded Vehicles on the Road. 2010 IEEE Global Telecommunications Conference
GLOBECOM 2010. doi:10.1109/glocom.2010.5684211
[4] Ho, P., Zhang, Z., & Lu, R. (2008). Special Issue on “Security and Privacy Preservation in Vehicular
Communications” Wileys Security and Communication Networks Journal. Security and
Communication Networks, 1(3), 191-193. doi:10.1002/sec.34
[5] M. Atallah and W. Du, “Secure multi-party computation problems and their applications: a review
and open problems,” in NSPW, 2001, pp.13–22
[6] G. Zhong, I. Goldberg, and U. Hengartner, “Louis, lester and pierre: Three protocols for location
privacy,” in PET 2007, ser. LNCS 4776, 2007, pp. 62–76.
[7] http://www.cryptopp.com/benchmarks.html
[8] http://www.javamex.com/tutorials/cryptography/hash_functions_algorithms. shtml#algorithms
AUTHORS
Nabamita Deb is working as Assistant Proff in the Dept of IT,Gauhati University, and
Moumita Roy is a masters student in the same department