The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Aron Laszka - One of the best experts on this subject based on the ideXlab platform.
-
designing secure ethereum smart contracts a finite state Machine based approach
Financial Cryptography, 2018Co-Authors: Anastasia Mavridou, Aron LaszkaAbstract:The adoption of blockchain-based distributed computation platforms is growing fast. Some of these platforms, such as Ethereum, provide support for implementing smart contracts, which are envisioned to have novel applications in a broad range of areas, including finance and the Internet-of-Things. However, a significant number of smart contracts deployed in practice suffer from security vulnerabilities, which enable malicious users to steal assets from a contract or to cause damage. Vulnerabilities present a serious issue since contracts may handle financial assets of considerable value, and contract bugs are non-fixable by design. To help developers create more secure smart contracts, we introduce FSolidM, a framework rooted in rigorous semantics for designing contracts as Finite State Machines (FSM). We present a tool for creating FSM on an easy-to-use graphical interface and for automatically generating Ethereum contracts. Further, we introduce a set of design patterns, which we implement as plugins that developers can easily add to their contracts to enhance security and functionality.
-
Designing Secure Ethereum Smart Contracts : A Finite State Machine Based Approach
22nd International Conference on Financial Cryptography and Data Security (FC 2018), 2018Co-Authors: Anastasia Mavridou, Aron LaszkaAbstract:The adoption of blockchain-based distributed computation platforms is growing fast. Some of these platforms, such as Ethereum, provide support for implementing smart contracts, which are envisioned to have novel applications in a broad range of areas, including finance and Internet-of-Things. However, a significant number of smart contracts deployed in practice suffer from security vulnerabilities, which enable malicious users to steal assets from a contract or to cause damage. Vul- nerabilities present a serious issue since contracts may handle financial assets of considerable value, and contract bugs are non-fixable by design. To help developers create more secure smart contracts, we introduce FSolidM, a framework rooted in rigorous semantics for designing con- tracts as Finite State Machines (FSM). We present a tool for creating FSM on an easy-to-use graphical interface and for automatically gener- ating Ethereum contracts. Further, we introduce a set of design patterns, which we implement as plugins that developers can easily add to their contracts to enhance security and functionality.
Anastasia Mavridou - One of the best experts on this subject based on the ideXlab platform.
-
designing secure ethereum smart contracts a finite state Machine based approach
Financial Cryptography, 2018Co-Authors: Anastasia Mavridou, Aron LaszkaAbstract:The adoption of blockchain-based distributed computation platforms is growing fast. Some of these platforms, such as Ethereum, provide support for implementing smart contracts, which are envisioned to have novel applications in a broad range of areas, including finance and the Internet-of-Things. However, a significant number of smart contracts deployed in practice suffer from security vulnerabilities, which enable malicious users to steal assets from a contract or to cause damage. Vulnerabilities present a serious issue since contracts may handle financial assets of considerable value, and contract bugs are non-fixable by design. To help developers create more secure smart contracts, we introduce FSolidM, a framework rooted in rigorous semantics for designing contracts as Finite State Machines (FSM). We present a tool for creating FSM on an easy-to-use graphical interface and for automatically generating Ethereum contracts. Further, we introduce a set of design patterns, which we implement as plugins that developers can easily add to their contracts to enhance security and functionality.
-
Designing Secure Ethereum Smart Contracts : A Finite State Machine Based Approach
22nd International Conference on Financial Cryptography and Data Security (FC 2018), 2018Co-Authors: Anastasia Mavridou, Aron LaszkaAbstract:The adoption of blockchain-based distributed computation platforms is growing fast. Some of these platforms, such as Ethereum, provide support for implementing smart contracts, which are envisioned to have novel applications in a broad range of areas, including finance and Internet-of-Things. However, a significant number of smart contracts deployed in practice suffer from security vulnerabilities, which enable malicious users to steal assets from a contract or to cause damage. Vul- nerabilities present a serious issue since contracts may handle financial assets of considerable value, and contract bugs are non-fixable by design. To help developers create more secure smart contracts, we introduce FSolidM, a framework rooted in rigorous semantics for designing con- tracts as Finite State Machines (FSM). We present a tool for creating FSM on an easy-to-use graphical interface and for automatically gener- ating Ethereum contracts. Further, we introduce a set of design patterns, which we implement as plugins that developers can easily add to their contracts to enhance security and functionality.
Jie Li - One of the best experts on this subject based on the ideXlab platform.
-
a probabilistic finite state Machine based strategy for multi target search using swarm robotics
Applied Soft Computing, 2019Co-Authors: Jie LiAbstract:Abstract As a distributed system, swarm robotics is well suited for the multi-target search task where a single robot is rather inefficient. In this paper, a model of the multi-target search problem in swarm robotics and its approximate mathematical representation are given, based on which a lower bound of the expected number of iterations is drawn. Two categories of behavior-based strategies for target search are introduced: one is inspired from swarm intelligence optimization while the other from random walk. A novel search strategy based on probabilistic finite state Machine is put forward, showing the highest efficiency in all presented algorithms, which is very close to the optimal value in situations with a large number of robots. It has been demonstrated by extensive experiments that the novel strategy has excellent stability, striking a good balance between exploration and exploitation, as well as a good trade-off between parallelism and cooperative capability.
Alexander Barkalov - One of the best experts on this subject based on the ideXlab platform.
-
research of efficiency of microprogram final state Machine with datapath of transitions
International Conference on Experience of Designing and Applications of CAD Systems in Microelectronics, 2017Co-Authors: R M Babakov, Alexander Barkalov, Larysa TitarenkoAbstract:In this paper results of research of hardware amount in the logic circuit of the finite state Machine (FSM) with datapath of transitions are shown. A research method is reduced to simulating structural blocks of the FSM using VHDL. There is investigated the efficiency of the FSM with datapath of transitions in comparison to the FSM with canonic structure.
-
design of moore finite state Machine with extended coding space
INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2014 (ICCMSE 2014), 2014Co-Authors: Larysa Titarenko, O Hebda, Alexander BarkalovAbstract:The proposed method is targeted on reduction of hardware amount in logic circuit of Moore Finite-State Machine implemented with programmable logic arrays (PLA). The method is based on using more than minimal amount of variables in codes of FSM internal states. The method includes two stages of state encoding. The second stage is connected with recoding of states inside each class of pseudoequivalent states.
-
design of moore finite state Machine with coding space stretching
International Conference on Human System Interactions, 2014Co-Authors: Larysa Titarenko, O Hebda, Alexander BarkalovAbstract:The proposed method is targeted on reduction of hardware amount in logic circuit of Moore Finite-State Machine implemented with programmable logic arrays (PLA). The method is based on using more than minimal amount of variables in codes of FSM internal states. The method includes two stages of state encoding. The second stage is connected with recoding of states inside each class of pseudoequivalent states.
-
design of moore finite state Machine with extended state codes
Information Technology Interfaces, 2013Co-Authors: Larysa Titarenko, O Hebda, Alexander BarkalovAbstract:The new method is proposed for reduction of chip area occupied by logic circuit of Moore FSM implemented with PLAs. It is based on the representation of the state code as a concatenation of the code of class of pseudoequivalent states and code of state inside this class. Such an approach allows elimination of dependence among states and output variables. It allows the hardware reduction in the FSM logic circuit in comparison with known design methods.
-
synthesis of moore finite state Machine with nonstandard presentation of state codes
Przegląd Elektrotechniczny, 2010Co-Authors: Alexander Barkalov, Larysa Titarenko, O HebdaAbstract:The method is proposed for reduction of hardware amount in logic circuit of Moore finite st ate Machine. The method is oriented on CPLD technology. It is based on representation of the next state code a s a concatenation of codes for class of pseudoequivalen t states and collection of microoperations. Such an approach allows elimination of dependence among states and microoperations. As a result, both circuits for gen eration of input memory functions and microoperations are optimized. An example of the proposed method application is given.
Hein S. Venter - One of the best experts on this subject based on the ideXlab platform.
-
finite state Machine for the social engineering attack detection model seadm
SAIEE Africa Research Journal, 2018Co-Authors: Francois Mouton, Louise Leenen, Alastair Nottingham, Hein S. VenterAbstract:Information security is a fast-growing discipline, and relies on continued improvement of security measures to protect sensitive information. Human operators are one of the weakest links in the security chain as they are highly susceptible to manipulation. A social engineering attack targets this weakness by using various manipulation techniques to elicit individuals to perform sensitive requests. The field of social engineering is still in its infancy with respect to formal definitions, attack frameworks, and examples of attacks and detection models. In order to formally address social engineering in a broad context, this paper proposes the underlying abstract finite state Machine of the Social Engineering Attack Detection Model (SEADM). The model has been shown to successfully thwart social engineering attacks utilising either bidirectional communication, unidirectional communication or indirect communication. Proposing and exploring the underlying finite state Machine of the model allows one to have a clearer overview of the mental processing performed within the model. While the current model provides a general procedural template for implementing detection mechanisms for social engineering attacks, the finite state Machine provides a more abstract and extensible model that highlights the inter-connections between task categories associated with different scenarios. The finite state Machine is intended to help facilitate the incorporation of organisation specific extensions by grouping similar activities into distinct categories, subdivided into one or more states. The finite state Machine is then verified by applying it to representative social engineering attack scenarios from all three streams of possible communication. This verifies that all the capabilities of the SEADM are kept in tact, whilst being improved, by the proposed finite state Machine.
-
underlying finite state Machine for the social engineering attack detection model
Information Security for South Africa, 2017Co-Authors: Francois Mouton, Louise Leenen, Alastair Nottingham, Hein S. VenterAbstract:Information security is a fast-growing discipline, and relies on continued improvement of security measures to protect sensitive information. In general, human operators are often highly susceptible to manipulation, and tend to be one of the weakest links in the security chain. A social engineering attack targets this weakness by using various manipulation techniques to elicit individuals to perform sensitive requests. The field of social engineering is still in its infancy with respect to formal definitions, attack frameworks, examples of attacks and detection models. In order to formally address social engineering in a broad context, this paper proposes the underlying finite state Machine of the Social Engineering Attack Detection Model (SEADM). The model has been proven to successfully thwart social engineering attacks utilising either bidirectional communication, unidirectional communication or indirect communication. Proposing and exploring the underlying finite state Machine of the model allows one to have a clearer overview of the mental processing performed within the model. While the current model provides a general procedural template for implementing detection mechanisms for social engineering attacks, the finite state Machine provides a more abstract and extensible model that highlights the interconnections between task categories associated with different scenarios. The finite state Machine is intended to help facilitate the incorporation of organisation specific extensions by grouping similar activities into distinct categories, subdivided into one or more states. In addition, it facilitates additional analysis on state transitions that are difficult to extract from the original flowchart based model.
