This document discusses concurrent signature schemes and proposes improvements to address fairness issues. It contains the following key points:
1. Concurrent signature schemes allow two parties to produce ambiguous signatures that only bind to the true signers when a keystone is released. Previous schemes had unfairness issues.
2. The document reviews Huang et al.'s ID-based concurrent signature schemes but notes they are still unfair and vulnerable to message substitution attacks.
3. A new scheme is proposed that uses an offline TTP to ensure fairness. It modifies the keystone generation and includes the exchanged messages to prevent substitution attacks. Recovery protocols are included for either party to appeal to the TTP.
Implementation of Elliptic Curve Digital Signature Algorithm Using Variable T...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Cryptography is the combination of Mathematics and Computer science. Cryptography is used for encryption and decryption of data using mathematics. Cryptography transit the information in an illegible manner such that only intended recipient will be able to decrypt the information
MODIFICATION THE SECURITY OF FLIP PROTOCOL BY CHANGING THE BASE POINT SELECTIONijcsit
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.
Global Domination Set in Intuitionistic Fuzzy Graphijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Implementation of Elliptic Curve Digital Signature Algorithm Using Variable T...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Cryptography is the combination of Mathematics and Computer science. Cryptography is used for encryption and decryption of data using mathematics. Cryptography transit the information in an illegible manner such that only intended recipient will be able to decrypt the information
MODIFICATION THE SECURITY OF FLIP PROTOCOL BY CHANGING THE BASE POINT SELECTIONijcsit
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.
Global Domination Set in Intuitionistic Fuzzy Graphijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Data Security Using Elliptic Curve CryptographyIJCERT
Cryptography technique is used to provide data security. In existing cryptography technique the key generation takes place randomly. Key generation require shared key. If shared key is access by unauthorized user then security becomes disoriented. Hence existing problems are alleviated to give more security to data. In proposed system a algorithm called as Elliptic Curve Cryptography is used. The ECC generates the key by using the point on the curve. The ECC is used for generating the key by using point on the curve and encryption and decryption operation takes place through curve. In the proposed system the encryption and key generation process takes place rapidly.
Improved security system using steganography and elliptic curve crypto...atanuanwesha
The main objectives of the project is to make the data safe and secure and transmit the data in such a way that it is not possible for anyone to detect the data . Steganography is concealing the secret message in non secret image. Whereas Encryption is converting data into code to prevent unauthorized access .Steganography as well as cryptography has its own disadvantage. Our objective is to implement both the procedures to enforce tight security and to prevent evesdropping etc.
Heptagonal Fuzzy Numbers by Max Min MethodYogeshIJTSRD
In this paper, we propose another methodology for the arrangement of fuzzy transportation problem under a fuzzy environment in which transportation costs are taken as fuzzy Heptagonal numbers. The fuzzy numbers and fuzzy values are predominantly used in various fields. Here, we are converting fuzzy Heptagonal numbers into crisp value by using range technique and then solved by the MAX MIN method for the transportation problem. M. Revathi | K. Nithya "Heptagonal Fuzzy Numbers by Max-Min Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-3 , April 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38280.pdf Paper URL: https://www.ijtsrd.com/mathemetics/applied-mathamatics/38280/heptagonal-fuzzy-numbers-by-maxmin-method/m-revathi
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
We present basic concepts of machine learning such as: supervised and unsupervised learning, types of tasks, how some algorithms work, neural networks, deep learning concepts, how to apply it in your work.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Cryptanalysis on Privacy-aware Two-factor Authentication Protocol for Wireles...IJECEIAES
Das first proposed two-factor authentication combining the smart card and password to resolve the security problems of wireless sensor networks (WSNs). After that, various researchers studied two-factor authentication suitable for WSNs. In user authentication protocols based on the symmetric key approach, a number of elliptic curve cryptography (ECC)-based authentication protocols have been proposed. To resolve the security and efficiency problems of ECC-based two-factor authentication protocols, Jiang et al. proposed a privacy-aware two-factor authentication protocol based on ECC for WSNs. However, this paper performs a vulnerability analysis on Jiang et al.’s authentication protocol and shows that it has security problems, such as a lack of mutual authentication, a risk of SID modification and DoS attacks, a lack of sensor anonymity, and weak ID anonymity.
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
EXTENDED LINEAR MULTI-COMMODITY MULTICOST NETWORK AND MAXIMAL FLOW LIMITED CO...IJCNCJournal
The Graph is a powerful mathematical tool applied in many fields as transportation, communication,
informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered
independently where the length of a path is the sum of weights of the edges and the vertexes on this path.
However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex
but depend on coming and leaving edges. The presented paper develops a model of the extended linear
multi-commodity multi-cost network that can be more exactly and effectively applied to model many
practical problems. Then, maximal limit cost flow problems are modeled as implicit linear programming
problems. On the base of dual theory in linear programming, an effective approximate algorithm is
developed.
A New Hendecagonal Fuzzy Number For Optimization Problemsijtsrd
A new fuzzy number called Hendecagonal fuzzy number and its membership function is introduced, which is used to represent the uncertainty with eleven points. The fuzzy numbers with ten ordinates exists in literature. The aim of this paper is to define Hendecagonal fuzzy number and its arithmetic operations. Also a direct approach is proposed to solve fuzzy assignment problem (FAP) and fuzzy travelling salesman (FTSP) in which the cost and distance are represented by Hendecagonal fuzzy numbers. Numerical example shows the effectiveness of the proposed method and the Hendecagonal fuzzy number M. Revathi | Dr. M. Valliathal | R. Saravanan | Dr. K. Rathi"A New Hendecagonal Fuzzy Number For Optimization Problems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-5 , August 2017, URL: http://www.ijtsrd.com/papers/ijtsrd2258.pdf http://www.ijtsrd.com/mathemetics/applied-mathamatics/2258/a-new-hendecagonal-fuzzy-number-for-optimization-problems/m-revathi
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
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 Elliptic Curve Digital Signature Algorithm Using Variable T...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
On the Usage of Chained Codes in CryptographyCSCJournals
We discuss the chained randomized linear code and their use in cryptography. We show that the adoption of randomized chained codes in the framework of McEliece cryptosystem expose the cryptosystem to some new attacks.
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.
Data Security Using Elliptic Curve CryptographyIJCERT
Cryptography technique is used to provide data security. In existing cryptography technique the key generation takes place randomly. Key generation require shared key. If shared key is access by unauthorized user then security becomes disoriented. Hence existing problems are alleviated to give more security to data. In proposed system a algorithm called as Elliptic Curve Cryptography is used. The ECC generates the key by using the point on the curve. The ECC is used for generating the key by using point on the curve and encryption and decryption operation takes place through curve. In the proposed system the encryption and key generation process takes place rapidly.
Improved security system using steganography and elliptic curve crypto...atanuanwesha
The main objectives of the project is to make the data safe and secure and transmit the data in such a way that it is not possible for anyone to detect the data . Steganography is concealing the secret message in non secret image. Whereas Encryption is converting data into code to prevent unauthorized access .Steganography as well as cryptography has its own disadvantage. Our objective is to implement both the procedures to enforce tight security and to prevent evesdropping etc.
Heptagonal Fuzzy Numbers by Max Min MethodYogeshIJTSRD
In this paper, we propose another methodology for the arrangement of fuzzy transportation problem under a fuzzy environment in which transportation costs are taken as fuzzy Heptagonal numbers. The fuzzy numbers and fuzzy values are predominantly used in various fields. Here, we are converting fuzzy Heptagonal numbers into crisp value by using range technique and then solved by the MAX MIN method for the transportation problem. M. Revathi | K. Nithya "Heptagonal Fuzzy Numbers by Max-Min Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-3 , April 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38280.pdf Paper URL: https://www.ijtsrd.com/mathemetics/applied-mathamatics/38280/heptagonal-fuzzy-numbers-by-maxmin-method/m-revathi
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
We present basic concepts of machine learning such as: supervised and unsupervised learning, types of tasks, how some algorithms work, neural networks, deep learning concepts, how to apply it in your work.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Cryptanalysis on Privacy-aware Two-factor Authentication Protocol for Wireles...IJECEIAES
Das first proposed two-factor authentication combining the smart card and password to resolve the security problems of wireless sensor networks (WSNs). After that, various researchers studied two-factor authentication suitable for WSNs. In user authentication protocols based on the symmetric key approach, a number of elliptic curve cryptography (ECC)-based authentication protocols have been proposed. To resolve the security and efficiency problems of ECC-based two-factor authentication protocols, Jiang et al. proposed a privacy-aware two-factor authentication protocol based on ECC for WSNs. However, this paper performs a vulnerability analysis on Jiang et al.’s authentication protocol and shows that it has security problems, such as a lack of mutual authentication, a risk of SID modification and DoS attacks, a lack of sensor anonymity, and weak ID anonymity.
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
EXTENDED LINEAR MULTI-COMMODITY MULTICOST NETWORK AND MAXIMAL FLOW LIMITED CO...IJCNCJournal
The Graph is a powerful mathematical tool applied in many fields as transportation, communication,
informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered
independently where the length of a path is the sum of weights of the edges and the vertexes on this path.
However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex
but depend on coming and leaving edges. The presented paper develops a model of the extended linear
multi-commodity multi-cost network that can be more exactly and effectively applied to model many
practical problems. Then, maximal limit cost flow problems are modeled as implicit linear programming
problems. On the base of dual theory in linear programming, an effective approximate algorithm is
developed.
A New Hendecagonal Fuzzy Number For Optimization Problemsijtsrd
A new fuzzy number called Hendecagonal fuzzy number and its membership function is introduced, which is used to represent the uncertainty with eleven points. The fuzzy numbers with ten ordinates exists in literature. The aim of this paper is to define Hendecagonal fuzzy number and its arithmetic operations. Also a direct approach is proposed to solve fuzzy assignment problem (FAP) and fuzzy travelling salesman (FTSP) in which the cost and distance are represented by Hendecagonal fuzzy numbers. Numerical example shows the effectiveness of the proposed method and the Hendecagonal fuzzy number M. Revathi | Dr. M. Valliathal | R. Saravanan | Dr. K. Rathi"A New Hendecagonal Fuzzy Number For Optimization Problems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-5 , August 2017, URL: http://www.ijtsrd.com/papers/ijtsrd2258.pdf http://www.ijtsrd.com/mathemetics/applied-mathamatics/2258/a-new-hendecagonal-fuzzy-number-for-optimization-problems/m-revathi
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
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 Elliptic Curve Digital Signature Algorithm Using Variable T...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
On the Usage of Chained Codes in CryptographyCSCJournals
We discuss the chained randomized linear code and their use in cryptography. We show that the adoption of randomized chained codes in the framework of McEliece cryptosystem expose the cryptosystem to some new attacks.
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.
In the age of fast evolution, software development project must accept many challenges of unpredicted
requirements change and new technology environment. Software development processes should have
adjustable and extendable features to meet the multifaceted needs of the users. Iterative and Incremental
Development (IID) is a practical approach to overcome the various challenges of software development.
However, continuous testing and building new versions need to spend more time and human resources that
is a major obstacle of IID. The other, the iterative operations must have a sound communication skills.
Lack of standard version control and intercommunication manner often lead to failure of software project.
High quality Continuous Integration (CI) environment can effectively make up the defects of IID. In this
paper, CI environment and advantages are deeply surveyed. In order to overcome the defects of IID, CI
environment needs combine the perfect procedures and qualified tools, and concretely enhance the quality
of CI environment. Based on the process quality measurement model, this paper proposes the Process
Quality Improvement Mechanism (PQIM). Applying PQIM, in software development, the processes
problems and the CI environment quality defects can identify timely and indeed revise to reduce the risk of
CI environment
V design and implementation of network security using genetic algorithmeSAT Journals
Abstract Over the last few years, Secured transmission of data has been a major issue in data communication. This project mainly concerns about the security of confidential information and data transmission using public key cryptography with Genetic Algorithm in order to provide confidentiality, authentication, integrity and non-repudiation of the messages. First, an algorithm is developed and implemented to generate a key pair (Private and public Key).A plain text is encrypted using the Public Key of receiver to produce an intermediate cipher. The intermediate cipher is again encrypted using genetic algorithm to produce final cipher. The final cipher first decrypted to produce the intermediate cipher which in turn decrypted to get the plain text using the Private key of the receiver or vice versa. Index Terms: Network Security, Genetic Algorithm
Design and implementation of network security using genetic algorithmeSAT Publishing House
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.
Identity-Based Blind Signature Scheme with Message Recovery IJECEIAES
Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. Blind signatures play an important role in many real world applications such as e-voting, e-cash system where anonymity is of great concern. Due to the rapid growth in popularity of both wireless communications and mobile devices, the design of secure schemes with low-bandwidth capability is an important research issue. In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. The proposed scheme is unforgeable with the assumption that the Computational Diffie-Hellman problem is hard. We compare our scheme with the related schemes in terms of computational and communicational point of view.
New Digital Signature Protocol Based on Elliptic Curvesijcisjournal
In this work, a new digital signature based on elliptic curves is presented. We established its efficiency and
security. The method, derived from a variant of ElGamal signature scheme, can be seen as a secure alternative protocol if known systems are completely broken.
Identity-based threshold group signature scheme based on multiple hard number...IJECEIAES
We introduce in this paper a new identity-based threshold signature (IBTHS) technique, which is based on a pair of intractable problems, residuosity and discrete logarithm. This technique relies on two difficult problems and offers an improved level of security relative to an on two difficult hard problems. The majority of the denoted IBTHS techniques are established on an individual difficult problem. Despite the fact that these methods are secure, however, a prospective solution of this sole problem by an adversary will enable him/her to recover the entire private data together with secret keys and configuration values of the associated scheme. Our technique is immune to the four most familiar attack types in relation to the signature schemes. Enhanced performance of our proposed technique is verified in terms of minimum cost of computations required by both of the signing algorithm and the verifying algorithm in addition to immunity to attacks.
AUTHENTICATED PUBLIC KEY ENCRYPTION SCHEME USING ELLIPTIC CURVE CRYPTOGRAPHYijujournal
Secure transformation of data is of prime importance in today’s world. In the present paper, we propose a
double fold authenticated public key encryption scheme which helps us in securely sending the confidential
data between sender and receiver. This scheme makes the encrypted data more secure against various
cryptographic attacks.
AUTHENTICATED PUBLIC KEY ENCRYPTION SCHEME USING ELLIPTIC CURVE CRYPTOGRAPHYijujournal
Secure transformation of data is of prime importance in today’s world. In the present paper, we propose a
double fold authenticated public key encryption scheme which helps us in securely sending the confidential data between sender and receiver. This scheme makes the encrypted data more secure against various
cryptographic attacks.
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Leading Change strategies and insights for effective change management pdf 1.pdf
1897 1900
1. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1897
www.ijarcet.org
Abstract— Concurrent signature scheme was introduced by
Chen, Kudla and Paterson in Eurocrypt 2004. In these
concurrent signature schemes, two parties can produce two
ambiguous signatures. These signatures bind to their true
signers concurrently only when an extra piece of information
(namely the keystone) is released by either of the two parties.
The concept of original concurrent signature schemes is that
both parties must have the true fairness in exchanging the
signatures mutually. Huang, Chen and Wang improved two
ID-based perfect concurrent signature schemes in 2007.
However, this paper points out that their schemes are unfair
because the initial signer can cheat the matching signer.
Therefore, the initial signer has more advantages than the
matching signer. According to this observation, we modify these
schemes to achieve the true fairness of two ID-based perfect
concurrent signature schemes and also propose these schemes to
get the accountability property.
Index Terms—Fair exchange, Concurrent signature,
Bilinear pairings, accountability, ID-Based signatures.
I. INTRODUCTION
Concurrent signatures contribute an alternative approach for
the traditional problem in fair exchange of signatures. The
principle of fair exchange is that both parties get the other
party’s item, or no party gets the other party’s item at the end
of a process. To achieve fair exchange over Internet, in which
two parties are mutually dishonest, is an important task. In
concurrent signature, both parties can produce their
ambiguous signatures. Thus, any third party cannot
distinguish which signature is signed by any party until one of
the two parties releases the keystone publicly.
In concurrent signature, there are two parties acting in the
protocol. They are known as the initial signer and the
matching signer. The initial signer is the party who computes
a keystone and sends the first signature to the matching signer.
The matching signer is also the party who responds to the
initial signature by creating another signature.
In [3], Chen, Kudla and Paterson introduced original
concurrent signature schemes that used the same keystone fix
in producing the ambiguous signatures. However, these
schemes were unfair because only the party who can create
the keystone can get more advantages over the other party.
Manuscript received May, 2013.
Pearl Ei Phyu, Department of Information and Communication
Technology (ICT), University Technology (Yatanarpon Cyber City), Pyin
Oo Lwin, Myanmar, +959402535605
Susilo, Mu and Zhang [4] proposed perfect concurrent
signatures, but the initiator could generate the two keystones
independently which enable the initiator could bind different
ambiguous signature (neither the one send to the matching
signer) with the one created by the matching signer.
Therefore, these schemes cannot provide perfect ambiguity.
To overcome these weak points, Chow and Susilo
provided identity-based perfect concurrent signatures [5]. As
both keystones (kI and kM) were produced by the initial signer,
it may cause unfair. To give true fairness, Huang, Chen, Lin
and R.Huang improved ID-based concurrent signature
scheme by producing the keystones from both parties [7].
However, the protocol breaks down fairness in step (2) and
step (3).
Moreover, ID-based perfect concurrent signatures
suffered from the message substitute attack. Because the
keystone fix does not contain the exchange messages (such as
mA and mB) in their concurrent signature schemes. Therefore,
we propose the modified ID-based concurrent signature
schemes in order to overcome message substitute attack and
to get the true fairness.
II. REVIEW OF HUANG, CHEN, LIN AND R.HUANG’S
SCHEMES
A. Bilinear Pairings and Complexity Assumption
Let G1 be a cyclic additive group generated by P with order
prime q and G2 be a cyclic multiplicative group with the same
order q. A bilinear pairing is a map
eˆ: G1× G1 G2 with the following properties:
Bilinear: For all P, P1, P2, Q, Q1, Q2 Є G1,
eˆ (P1+ P2, Q) = eˆ (P1, Q) eˆ (P2, Q),
eˆ (P, Q1 +Q2) = eˆ (P, Q1) eˆ (P, Q2).
Non-degenerate: There exits P,Q Є G1 such that eˆ (P, Q)
≠1;
Computable: There is an efficient algorithm to compute
eˆ (P, Q) for all P, Q Є G1 .
Modified Weil pairing and Tate pairings are examples of
bilinear maps.
Computational Co-Diffie-Hellman (Co-CDH) Problem:
Given a randomly chosen (P1, P2, aP1, bP2), where P1, P2 Є G1,
a, b Є Zq
*
, and a, b are unknown, compute abP2 Є G2.
Co-CDH Assumption: For every probabilistic
polynomial-time algorithm A, the advantage of A to solve
Co-CDH-Problem is negligible.[7]
Fairness of Optimistic ID-Based Concurrent
Signature Schemes
Pearl Ei Phyu
2. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
www.ijarcet.org
1898
B. ID-Based Perfect Concurrent Signature Algorithms
SETUP:
Choose (G1, G2, eˆ, q, P) as Section A. The Private
Key Generator (PKG) selects a random number s Є
Zq
*
and sets Ppub = sP. It selects three cryptographic
hash functions H0 : {0, 1}*
→ G1 and H1 : {0, 1 }*
→
Zq and H2 : {0, 1}*
→ G1. It publishes system
parameters params = {G1, G2, eˆ, q, P, Ppub, H0, H1,
H2}, and keeps s as the master private key. The
algorithm also sets M = F = Zq, and F = K´ = G1.
Sets KI = KM = G2.
Sets FI : G2 Zq be a one-way permutation.
Sets FM (x, y) = FI (x) + y (mod q).
Sets Enc(k) = kP.
Sets Dec(K´, K˝ ) = eˆ(K´, K˝ ).
EXTRACT: The EXTRACT algorithm is defined as
follows.
A user Ui submits his or her identity IDi to the PKG.
The PKG generates Ui’s private key as SIDi = sQIDi,
where QIDi = H0 (IDi).
ASIGN: The algorithm accepts (IDi, IDj, SIDi, fi, mi) and
performs the following.
Selects a random point Z Є G1.
Computes u0 = H1 (H0 (m) || (IDi ⊕ IDj) || eˆ (Z, P)
eˆ (fiQIDj, Ppub)).
Computes V = u0
-1
(Z – (u0 – uj) SIDi).
Sets ui = u0 – fi (mod q), uj = fi.
Outputs σ = (ui, uj, V) as the signature on message m.
AVERIFY: The algorithm accepts (σ, IDi, IDj, m), where
σ = (ui, uj, V), and verifies whether
ui + uj =?
H1(H2(m) || (IDi ⊕ IDj) || eˆ(V, P) ui + uj
eˆ(uiQIDi,
Ppub) eˆ(ujQIDj, Ppub))
holds with the equality. If so, then output accept.
Otherwise, output reject.
VERIFY: The algorithm accepts ( ki, kj, S´ ), where ki Є
KI and kj Є KM are the keystones and S´ = (σi, σj, IDi,
IDj, mi, mj). The algorithm verifies whether fi = FI (ki), fj =
FI (kj) + fi (mod q). If not, then outputs reject. Otherwise,
run AVERIFY on σi and σj respectively. If both outputs
are accept, then outputs accept. Otherwise, outputs
reject.[7]
C. ID-Based Perfect Concurrent Signature Protocol
1. Alice performs the following
Picks a random keystone kI Є G2, computes keystone fix
fI = FI (kI).
Selects a message mI Є M, computes her ambiguous
signature as
σI = (uI, uM, V) ASIGN (IDI, IDM, SIDI, fI, mI).
Sends σI to Bob.
2. Bob performs the following
Verifies the signature σI by testing whether AVERIFY
(σI, IDI, IDM, mI) = accept. Aborts if the equation does
not hold.
Picks a random number k Є Zq, computes keystone kM =
eˆ (Ppub, QIDI)k
.
Computes encrypted keystone KM = kP.
Computes matching keystone fix fM = FI (kM) + uj (mod
q).
Selects a message mM Є M, and computes his ambiguous
signature as
σM = ( u´M, u´I, V´ ) ASIGN (IDM, IDI, SIDM, fM,
mM).
Sends σM and KM to Alice.
3. Alice verifies σM by testing whether
u´I = FI (eˆ (KM, SIDI)) + uM (mod q)
AVERIFY (σM, IDM, IDI, mM) = accept.
If not, then Alice aborts. Otherwise, Alice computes
keystone kM = eˆ (KM, SIDI) and releases the keystone (kI,
kM), then both signatures are binding concurrently.[7]
In their concurrent signature protocol, Alice can cheat Bob
without releasing her keystone in Step (3). In this situation,
Bob can’t afford to get her keystone. Therefore, their schemes
are unfair. Moreover, they did not consider the exchanged
messages altogether in generating the keystone fix. Therefore,
their schemes may suffer from message substitute attack. Due
to this observation, we propose the modified ID-based
concurrent signature schemes to get the true fairness and also
overcome the message substitute attack.
III. PROPOSED SCHEME
In this section, we describe a fair ID-based perfect concurrent
signature scheme to achieve the true fairness by using an
off-line Trusted Third Party (off-line TTP). Our scheme also
prevents message substitute attack.
The protocol consists of two sub protocols, main protocol
and recovery protocol, respectively. In main protocol, two
parties exchange their ambiguous signature. After executing
the main protocol, each party fairly gets respective signature
if both of them is honest. If someone is dishonest in the
exchange protocol, TTP can resolve this case by executing the
recovery protocol.
Assume that mA and mB are the messages that Alice and
Bob want to exchange.
A. Improved ID-based perfect concurrent signature
algorithm
3. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
1899
www.ijarcet.org
SETUP: The same as that of the original scheme.
EXTRACT: The same as that of the original scheme.
ASIGN: The algorithm accepts (IDA, IDB, SIDA, fA, mA) and
performs the following.
Selects a random point Z Є G1.
Computes u0 = H1 ( H0 (mA ⊕ mB ) || ( IDA ⊕ IDB ) ||
eˆ (Z, P) eˆ (fAQIDB, Ppub)).
Computes V = u0
-1
(Z – (u0 – uB) SIDA).
Sets uA = u0 – fA (mod q), uB = fA.
Outputs σA = (uA, uB, V) as the signature on message
mA and mB.
AVERIFY: The same as that of the original scheme.
VERIFY: The same as that of the original scheme.
B. Improved ID-based Perfect Concurrent Signature
Protocol (Main Protocol)
1. Alice performs the following
Picks a random keystone kA Є G2, and computes
keystone fix fA = FA (kA || (mA ⊕ mB)).
Selects a message mA Є M and computes her
ambiguous signature as
σA = (uA, uB, V) ASIGN (IDA, IDB, SIDA, fA, mA).
Sends [σA, EsAT(kA || (mA ⊕ mB))] to Bob.
2. Bob performs the following
Verifies the signature σA by testing whether AVERIFY
(σA, IDA, IDB, mA) = accept. Aborts if the equation
does not hold.
Picks a random number k Є Zq, computes keystone kB
= eˆ (Ppub, QIDA)k
.
Computes encrypted keystone KB = kP.
Computes matching keystone fix
fB = FA (kB || (mA ⊕ mB)) + uB (mod q).
Selects a message mB Є M, and computes his
ambiguous signature as
σB = ( u´B, u´A, V´ ) ASIGN (IDB, IDA, SIDB,
fB, mB).
Sends σB and KB to Alice.
3. Alice verifies σB by testing whether
u´A = FA(eˆ (KB, SIDA)) + uB (mod q)
AVERIFY (σB, IDB, IDA, mB) = accept.
If not, then Alice aborts. Otherwise, Alice computes
keystone kB = eˆ (KB, SIDA) and releases the keystone (kA,
kB), then both signatures are binding concurrently.
C.Recovery for B
If Alice is dishonest, when she receives Bob’s signature (σB)
and KB in Step (2), she may refuse to release the keystone pair
(kA, kB) in Step (3). Therefore, the two ambiguous signatures
cannot bind to their true signers concurrently. At that time,
Bob run the following recovery protocol to ask the keystone k
from TTP.
B TTP : [σA, EsAT(kA || (mA ⊕ mB))], [σB, KB]
TTP B : kA
D.Recovery for A
If Bob is dishonest, as soon as he receives Alice’s signature
(σA) in Step (1), he may cheat to get the keystone k from TTP.
In this situation, Alice can run the following recovery
protocol to ask Bob’s signature and his encrypted keystone
from TTP.
A TTP : FA (kA || (mA ⊕ mB))
TTP A : [σB, KB]
E. Initialization Phase
In initialization phase, Alice and Bob must download their
secret keys with respect to TTP (namely sAT and sBT) before
they run the concurrent signature exchange protocol.
IV. SECURITY PROOFS
Fairness: Our proposed scheme satisfies the true fairness
property.
Fairness Proof: There are two possible cases to prove the
fairness of our proposed scheme.
Case 1: Alice is dishonest but Bob is honest.
Alice receives Bob’s signature in Step (2) but she refuses to
release the keystone to Bob in Step (3). In this situation, Bob
can ask the help of TTP by running the recovery protocol for
B. When TTP receives Bob’s messages, TTP check whether
all messages are valid. If all are valid, TTP decrypts EsAT(kA ||
(mA ⊕ mB)) and releases the keystone kA to let the two
signatures bind to their true signers concurrently. Therefore,
the proposed protocol is fair.
Case 2: Alice is honest but Bob is dishonest.
Bob receives Alice’s signature in Step (1) but he can cheat to
get the keystone kA from TTP without sending back his
signature to Alice. In this situation, Alice can get Bob’s
signature and KB from TTP by running the recovery protocol
for A. Therefore, the proposed protocol is still fair.
Accountability: Our proposed scheme satisfies the
accountability property. Our proposed scheme inherits the
definition of accountability property.[9]
Proof: In our proposed scheme, the keystone fix contains the
exchange messages. Therefore, the initial signer cannot use
this keystone in other messages except the exchange
messages. Furthermore, any signer could not generate
4. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, No 5, May 2013
www.ijarcet.org
1900
ambiguous signature for any messages other than the one send
to other signers in his ambiguous signature, which could
satisfy the VERIFY and AVERIFY algorithms.
Message Substitute Attack: Our proposed scheme can avoid
the message substitute attack.
Proof: In original protocol, they suffered this attack because
the keystone fix does not contain the exchange messages. For
example, Alice is a customer and Bob is a merchant. When
Alice want to buy the item (price -$100), she agrees to
exchange signature with Bob. In this situation, Alice can cheat
to get the item (price - $200) because Alice can produce the
two signatures about these items. Because they do not
compute the exchange messages in generating their keystone
fix. The initiator could bind different ambiguous signature
(neither the one send to the matching signer) with the one
created by the matching signer. Therefore, we consider to
compute the keystone fix including the exchange messages.
V. CONCLUSION
A In this paper, we present an ID-based perfect concurrent
signature scheme in order to ensure that both parties can get
the valid signature or neither of them receives any useful
information. As both parties have the equal opportunities at
the end of the exchange protocol, our scheme achieves the
true fairness and also has the accountability property.
Furthermore, our proposed scheme can prevent the message
substitute attack.
ACKNOWLEDGMENT
The author would like to give special thanks to Dr. Aung Win,
Principal of University of Technology (Yatanarpon Cyber
City), Pyin Oo Lwin, Myanmar, Dr. Soe Soe Khaing,
Professor, Head of ICT, University of Technology
(Yatanarpon Cyber City), Pyin Oo Lwin, Myanmar and my
supervisor, Dr. Khin Khat Khat Kyaw, Assistant Professor,
Faculty of ICT, University of Technology (Yatanarpon Cyber
City), Pyin Oo Lwin, Myanmar, for their invaluable
suggestions and general guidances. The author would like to
thank to all my teachers, my parents and all my colleagues.
REFERENCES
[1] Shamir, A., ―Identity-base cryptosystems and signature schemes‖. In
Advances in Cryptology – CryptoÆ84, Lecture Notes in Computer
Science, Vol. 196. Springer-Verlag, Berlin, (1985), pp. 47–53.
[2] Asokan N., V. Shoup and M.Waidner. ―Optimistic fair exchange of
signatures‖. In Advances in Cryptology-EUROCRYPT’98, lecture
Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, (1998),
pp. 591-606.
[3] L. Chen, C.J. Kudla and K.G. Paterson, ―Concurrent Signatures‖. In C.
Cachin and J. Camenisch (eds.), EUROCRYPT 2004, lecture Notes in
Computer Science, vol. 3027, Springer-Verlag, (2004), pp.287-305.
[4] W. Susilo, Y. Mu, and F. Zhang. ―Perfect concurrent signature schemes‖.
In: ICICS’04, LNCS, Vol. 3269, (2004), pp. 14-26. Springer, Belin.
[5] S.S.M. Chow and W. Susilo, ―Generic construction of (identity-based)
perfect concurrent signatures‖, ICICS’05, LNCS, Vol. 3783, (2005),
pp. 194-206, Springer, Berlin.
[6] Wang Gui-lin, Bao Feng, Zhou Jian-ying. ―The fairness of perfect
concurrent signatures‖, In: ICICS’06, LNCS, Vol. 4307, (2006), pp.
435-451, Springer, Berlin.
[7] Zhenjie Huang, Kefei Chen, Xuanzhi Lin, Rufen Huang, ―Analysis and
Improvements of Two Identity-Based Perfect Concurrent Signature
Schemes‖, INFORMATICA, Vol. 18, No. 3, (2007), 375-394@2007
Institute of Mathematics and Informatics, Vilnius.
[8] Li Yunfeng, He Dake, Lu Xianhui, ―Accountability of Perfect CS‖, In:
IEEE, International Conference on Computer & Electircal
Engineering, (2008), pp. 773—777, IEEE Press.
[9] Wang, C.H., Chen, C.C., ―Identity-Based Concurrent Signature Scheme
with Improved Accountability‖. In: 5th
International Conference on
Innovative Mobile and Internet Services in Ubiquitous Computing
(IMIS), (2011), pp. 514—519. IEEE Press.