Decentralized Privacy-Preserving Timed Execution in Blockchain-Based Smart Contract Platforms

Chao Li, Balaji Palanisamy

TL;DR

This paper introduces a decentralized protocol for scheduling smart contract transactions to execute at a specific future time without revealing sensitive inputs beforehand. By combining Shamir’s Secret Sharing, layered encryption ("onions"), and economic incentives, the system allows users to go offline while a distributed set of trustees ensures their private data is only revealed and executed during the desired time window.

What Problem Does This Paper Address?

On platforms like Ethereum, smart contracts are "passive"—they only run when triggered by a transaction, and that execution happens immediately. This creates two major hurdles for decentralized applications (dApps):

  1. The Timing Problem: If you want to reveal a sealed bid in an auction or cast a vote during a specific window next week, you (or a bot you run) must be online at that exact time to send the transaction.
  2. The Privacy Problem: Blockchains are public. If you send your bid or vote to the chain early, everyone can see it, destroying the fairness of the protocol.

Existing solutions usually rely on centralized "middlemen" (like Oraclize) or "alarm clock" services. However, these introduce a single point of failure and require users to trust a third party with their private data. The authors aim to build a "trustless" alternative that maintains decentralization and privacy.

Methods

The authors propose a protocol involving four main components: Trustee Application, User Scheduling, Function Execution, and Misbehavior Reporting.

Key Technical Pillars:

  • Shamir’s Secret Sharing (SSS): The user generates a secret key to encrypt their transaction inputs. This key is split into $n$ shares, where any $m$ shares can reconstruct the key.
  • Layered Encryption (Onions): To prevent trustees from seeing the shares too early, the shares are wrapped in multiple layers of encryption using the public keys of selected trustees.
  • Two-Round Trustee Selection: To prevent collusion, the protocol uses two rounds. In the first round, trustees are selected to provide signatures and nonces. In the second round, a different set of trustees is chosen to actually store the "onions."
  • Economic Deterrence: Trustees must deposit Ether as a security stake. If they fail to show up, reveal data early, or submit fake data, their deposit is "slashed" (confiscated) and given to the whistleblower who reported them.
  • Smart Contract Architecture:
    • Scheduler Contract ($C_s$): A global contract that manages the pool of trustees and schedule requests.
  • Proxy Contract ($C_p$): A unique contract deployed by the user that acts as the gateway to the final "Target" contract.

Datasets

As a systems and protocol paper, the authors did not use a traditional machine learning dataset. Instead, they evaluated their implementation using:

  • Ethereum Rinkeby Test Network: Used for live deployment and testing of Solidity smart contracts.
  • Test Instances (A and B): Two simulated scenarios with different parameters ($l$ layers, $m$ threshold, $n$ shares) to measure scalability. Instance A used 15 trustees, while Instance B used 40.
  • Target Application: A "Sealed Bid Auction" contract was used as the benchmark application to demonstrate a real-world use case.

Key Insights and Ideas

  • Offline Availability: The core "aha" moment is that the user can go completely offline after the setup phase. The decentralized network of trustees takes over the responsibility of "waking up" the transaction.
  • Rational Adversary Model: The paper assumes participants are "rational" (profit-driven) rather than purely honest or malicious. By making the penalty for cheating higher than the potential gain from collusion, the protocol remains secure.
  • Privacy via Distributed Trust: No single trustee ever sees the full secret key or the raw transaction inputs until the execution window opens. Even if a few trustees are compromised, the $m$-of-$n$ threshold protects the data.
  • Verifiable Misbehavior: Every step of the protocol is recorded or hashed on-chain, making it possible for any observer to prove a trustee cheated and claim a reward.

Key Results

The authors implemented the system in Solidity and tested it using Geth (Go-Ethereum).

  • Low Gas Costs: Most on-chain functions cost less than $10^5$ gas. For Instance A (15 trustees), the total cost was roughly $7.6 \times 10^6$ gas. While this varies with Ethereum's market price, the authors show it was as low as $1.20 USD at 2016 prices.
  • Minimal Time Overhead: 14 out of the 15 required functions took less than 200ms to process on the blockchain. The most "expensive" function in terms of time was setTrustee(), which took about 375ms for 15 trustees and 881ms for 40 trustees.
  • Resilience: Mathematical analysis showed that even if 5% of trustees inadvertently fail (e.g., lose their keys), the success rate of the schedule remains extremely high (99.82% to 99.95%) due to the redundancy of the secret sharing scheme.

Limitations and Future Work

  • Cryptocurrency Volatility: The authors acknowledge that the monetary cost of the service is highly sensitive to the fluctuating price of Ether and Gas, which could make it expensive during periods of high network congestion.
  • Trustee Pool Size: The security of the system relies on having a sufficiently large and diverse pool of trustees to prevent large-scale collusion.
  • Complexity: The two-round selection and layered encryption add significant architectural complexity compared to centralized alternatives.
  • Future Direction: The authors suggest exploring more advanced "witness encryption" or "time-lock puzzles," though they note these are currently computationally impractical for standard blockchain environments.

Summary updated

Abstract

Timed transaction execution is critical for various decentralized privacy-preserving applications powered by blockchain-based smart contract platforms. Such privacy-preserving smart contract applications need to be able to securely maintain users' sensitive inputs off the blockchain until a prescribed execution time and then automatically make the inputs available to enable on-chain execution of the target function at the execution time, even if the user goes offline. While straight-forward centralized approaches provide a basic solution to the problem, unfortunately they are limited to a single point of trust. This paper presents a new decentralized privacy-preserving transaction scheduling approach that allows users of Ethereum-based decentralized applications to schedule transactions without revealing sensitive inputs before an execution time window selected by the users. The proposed approach involves no centralized party and allows users to go offline at their discretion after scheduling a transaction. The sensitive inputs are privately maintained by a set of trustees randomly selected from the network enabling the inputs to be revealed only at the execution time. The proposed protocol employs secret key sharing and layered encryption techniques and economic deterrence models to securely protect the sensitive information against possible attacks including some trustees destroying the sensitive information or secretly releasing the sensitive information prior to the execution time. We demonstrate the attack-resilience of the proposed approach through rigorous analysis. Our implementation and experimental evaluation on the Ethereum official test network demonstrates that the proposed approach is effective and has a low gas cost and time overhead associated with it.
BibTeX
@inproceedings{li2018decentralized,
  author = {Chao Li and Balaji Palanisamy},
  title = {{Decentralized Privacy-Preserving Timed Execution in Blockchain-Based Smart Contract Platforms}},
  booktitle = {HiPC},
  year = {2018},
  url = {https://openreview.net/forum?id=kesL9h3y3v},
}

Loading related content...

Figure