Implementing a Smart Contract PKI
- 6 April 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 67 (4) , 1425-1443
Abstract
Public key infrastructures (PKIs) provide the foundations for securing Internet communications. Currently, PKIs are operated by centralized authorities, which have been involved in numerous security incidents. Blockchain or smart contract PKIs employ their distributed, fault-tolerant log of transactions to store either all identity records, or, constant-sized data to verify identity records stored off-chain. However, as most of these systems have never been implemented, there is little information regarding their practical implications. In this article, we implement, evaluate, and provide a complete security proof for the smart contract-based PKI of (Patsonakis et al.) on Ethereum. This construction incurs constant-sized storage at the expense of computational complexity. To explore this tradeoff, we propose and implement a second construction which, eliminates the need for trusted setup, preserves its security properties and show that it is the only version with constant-sized state that can be deployed on Ethereum’s live chain. We compare these constructions with the simple approach of storing all identity records on the smart contract’s state, to illustrate several shortcomings of Ethereum and its cost model. We propose several modifications for fine tuning the model, which should be considered for any smart contract platform like Ethereum so that it may support arbitrary distributed applications.Keywords
Funding Information
- EU Horizon 2020 NEANIAS (863448)
- ERC starting (279237)
This publication has 15 references indexed in Scilit:
- IKP: Turning a PKI Around with Decentralized Automated Incentives2017
- Catena: Efficient Non-equivocation via Bitcoin2017
- SCPKI2017
- Accumulators with Applications to Anonymity-Preserving Revocation2017
- EthIKS: Using Ethereum to Audit a CONIKS Key Transparency Log2016
- Strong Accumulators from Collision-Resistant Hashing2008
- Universal Accumulators with Efficient Nonmembership Proofs2007
- Secure Hash-and-Sign Signatures Without the Random Oracle1999
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979