Share This Author
Making Smart Contracts Smarter
- Loi Luu, D. Chu, Hrishi Olickel, P. Saxena, Aquinas Hobor
- Computer ScienceIACR Cryptol. ePrint Arch.
- 24 October 2016
This paper investigates the security of running smart contracts based on Ethereum in an open distributed network like those of cryptocurrencies, and proposes ways to enhance the operational semantics of Ethereum to make contracts less vulnerable.
Finding The Greedy, Prodigal, and Suicidal Contracts at Scale
- I. Nikolic, Aashish Kolluri, Ilya Sergey, P. Saxena, Aquinas Hobor
- Computer ScienceACSAC
- 16 February 2018
Maian is implemented, the first tool for specifying and reasoning about trace properties, which employs interprocedural symbolic analysis and concrete validator for exhibiting real exploits.
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining
- Loi Luu, R. Saha, Inian Parameshwaran, P. Saxena, Aquinas Hobor
- Computer Science, EconomicsIEEE 28th Computer Security Foundations Symposium
- 13 July 2015
It is shown that existing pool reward sharing protocols are insecure in the game-theoretic analysis under an attack strategy called the "block withholding attack", which implies that existing pools are insecure, and if the attack is conducted systematically, Bitcoin pools could lose millions of dollars worth in months.
A Concurrent Perspective on Smart Contracts
The described contracts-as-concurrent-objects analogy provides deeper understanding of potential threats for smart contracts, indicate better engineering practices, and enable applications of existing state-of-the-art formal verification techniques.
Scilla: a Smart Contract Intermediate-Level LAnguage
The automata-based model of Scilla is described, its programming component is presented and it is shown how contract definitions in terms of automata streamline the process of mechanised verification of their safety and temporal properties.
A Fresh Look at Separation Algebras and Share Accounting
The axioms of separation algebras are adjusted; an operator calculus is demonstrated for constructing new separation algeses; a more powerful system of share accounting is presented with a new, simple model; a reusable Coq development is provided.
Exploiting the laws of order in smart contracts
- Aashish Kolluri, I. Nikolic, Ilya Sergey, Aquinas Hobor, P. Saxena
- Computer ScienceISSTA
- 27 October 2018
EthRacer, an automatic analysis tool that runs directly on Ethereum bytecode and requires no hints from users, is built, providing compact event traces (witnesses) that human analysts can examine in only a few minutes per contract.
The ramifications of sharing in data structures
A compositional proof system that enables local reasoning in the presence of sharing and verified the correctness of a number of examples, including programs that manipulate dags, graphs, and overlaid data structures in nontrivial ways.
Oracle Semantics for Concurrent Separation Logic
This work defines a modular operational semantics for Concurrent C minor--a language with shared memory, spawnable threads, and first-class locks, and proves its soundness with respect to the operational semantics and proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy's machine-checked soundness proofs.
Barriers in Concurrent Separation Logic
This work develops and proves sound a concurrent separation logic for Pthreads-style barriers, and shows how this logic can be applied to a specific example program in a modular way.