Show simple item record

dc.contributor.authorZyskind, Guy
dc.contributor.authorErez, Yonatan
dc.contributor.authorLanger, Tom
dc.contributor.authorGrossman, Itzik
dc.contributor.authorBondarevsky, Lior
dc.date.accessioned2025-03-07T20:26:06Z
dc.date.available2025-03-07T20:26:06Z
dc.date.issued2024-07-02
dc.identifier.isbn979-8-4007-0638-7
dc.identifier.urihttps://hdl.handle.net/1721.1/158437
dc.descriptionBSCI '24, July 2, 2024, Singapore, Singaporeen_US
dc.description.abstractBlockchains ensure that all transactions, including those that execute deterministic programs known as smart contracts, are processed correctly and without interruption. However, blockchains inherently provide no confidentiality - all transaction data, including inputs sent to smart contracts, are public. This has led to a rise of confidential smart contract blockchains. These blockchains utilize privacy-preserving techniques to add privacy to smart contracts, but they usually rely on Trusted Execution Environments (TEEs) (e.g., [14, 24]) that are susceptible to side-channel attacks and other security concerns ([7, 13, 33] to name a few). More recently, several works have focused on achieving confidentiality using Fully Homomorphic Encryption (FHE) (e.g., [1, 30]). While this approach is promising, these works limit scalability as they require all nodes in the network to execute FHE computations and reach consensus over the encrypted state, which is prohibitive. Instead, in this work and inspired by the recent move towards layer-2 solutions, we present the first rollup-based FHE architecture. We argue that while for plaintext computation rollups are a needed solution, in the context of FHE, where the computational overhead is orders of magnitude higher, they are a necessity. In our design, we take an optimistic rollup approach, allowing us to avoid the orders of magnitude penalty incurred by state-of-the-art verifiable FHE techniques [34]. In fact, our framework can be seen as a cryptoeconomic solution to solve the same problem of verifiability in FHE. We implement a proof-of-concept of our solution, and in the process, we show how we can build FHE rollups without making any changes to existing layer-Is like Ethereum, even if they do not support FHE operations inherently. We further implement three smart-contracts that are only possible if data remains confidential, and show that their performance is practical.en_US
dc.publisherACM|The 6th ACM International Symposium on Blockchain and Secure Critical Infrastructureen_US
dc.relation.isversionofhttps://doi.org/10.1145/3659463.3660031en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceAssociation for Computing Machineryen_US
dc.titleFHE-Rollups: Scaling Confidential Smart Contracts on Ethereum and Beyonden_US
dc.typeArticleen_US
dc.identifier.citationZyskind, Guy, Erez, Yonatan, Langer, Tom, Grossman, Itzik and Bondarevsky, Lior. 2024. "FHE-Rollups: Scaling Confidential Smart Contracts on Ethereum and Beyond."
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2025-03-01T08:46:22Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2025-03-01T08:46:23Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record