The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends
Open accessAbstract
We put forward a new framework that makes it possible to re-write or compress the content of any number of blocks in decentralized services exploiting the blockchain technology. As we argue, there are several reasons to prefer an editable blockchain, spanning from the necessity to remove inappropriate content and the possibility to support applications requiring re-writable storage, to "the right to be forgotten." Our approach generically leverages so-called chameleon hash functions (Krawczyk and Rabin, NDSS '00), which allow determining hash collisions efficiently, given a secret trapdoor information. We detail how to integrate a chameleon hash function in virtually any blockchain-based technology, for both cases where the power of redacting the blockchain content is in the hands of a single trusted entity and where such a capability is distributed among several distrustful parties (as is the case with Bitcoin). We also report on a proof-of-concept implementation of a redactable blockchain, building on top of Nakamoto's Bitcoin core. The prototype only requires minimal changes to the way current client software interprets the information stored in the blockchain and to the current blockchain, block, or transaction structures. Moreover, our experiments show that the overhead imposed by a redactable blockchain is small compared to the case of an immutable one.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 6×
“Alternatively, for tolerating a higher threshold t n/2 (which is also the maximal threshold for such schemes [Man11]) one could use Shamir's secret sharing in conjunction with information-theoretic message authentication codes, as proposed by Rabin and Ben-Or [RB89].”
MethodInfluentialGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Efficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
Ben-Or, M., Goldwasser, S., & Wigderson, A. (1988) · Cited by 495
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Groth, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935230_29 · Cited by 390
Improved Online/Offline Signature Schemes
Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_21 · Cited by 384
Secure Multiparty Computations on Bitcoin
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, L. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.35 · Cited by 345
Collision Free Hash Functions and Public Key Signature Schemes
Damgård, I. B. (2010) · Lecture Notes in Computer Science · doi:10.1007/3-540-39118-5_19 · Cited by 339
Robust Non-interactive Zero Knowledge
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., & Sahai, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_33 · Cited by 293
Message recovery for signature schemes based on the discrete logarithm problem
Nyberg, K., & Rueppel, R. A. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053434 · Cited by 259
On the Key Exposure Problem in Chameleon Hashes
Ateniese, G., & de Medeiros, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30598-9_12 · Cited by 205
Self-citationPublic and private blockchains
Summers, A. (2022) · Understanding Blockchain and Cryptocurrencies · doi:10.1201/9781003187165-10 · Cited by 179
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation
Asharov, G., & Lindell, Y. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9214-4 · Cited by 155
Fair Two-Party Computations via Bitcoin Deposits
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, Ł. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44774-1_8 · Cited by 153
How to Use Bitcoin to Play Decentralized Poker
Kumaresan, R., Moran, T., & Bentov, I. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813712 · Cited by 111
Naor, M., & Teague, V. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380844 · Cited by 110
Robust computational secret sharing and a unified account of classical secret-sharing goals
Mihir Bellare, Y., & Rogaway, P. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315268 · Cited by 88
On the Malleability of Bitcoin Transactions
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, Ł. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48051-9_1 · Cited by 81
Liar, Liar, Coins on Fire! Penalizing Equivocation By Loss of Bitcoins
Ruffing, T., Kate, A., & Schröder, D. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813686 · Cited by 75
Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts
Banasik, W., Dziembowski, S., & Malinowski, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45741-3_14 · Cited by 73
PoW-Based Distributed Cryptography with No Trusted Setup
Andrychowicz, M., & Dziembowski, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48000-7_19 · Cited by 64
Ateniese, G., Faonio, A., Magri, B., & de Medeiros, B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07536-5_6 · Cited by 47
Self-citationShahin, S. (2016) · Journalism & Mass Communication Quarterly · doi:10.1177/1077699016638835 · Cited by 32
Traitor Deterring Schemes: Using Bitcoin as Collateral for Digital Content
Kiayias, A., & Tang, Q. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813698 · Cited by 23
Cited by
A Survey on Security and Privacy Issues of Bitcoin
Conti, M., Sandeep Kumar, E., Lal, C., & Ruj, S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2842460 · Cited by 1,116
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
Leveraging the Internet of Things and Blockchain Technology in Supply Chain Management
Rejeb, A., Keogh, J. G., & Treiblmaier, H. (2019) · Future Internet · doi:10.3390/fi11070161 · Cited by 538
Blockchain Mutability: Challenges and Proposed Solutions
Politou, E., Casino, F., Alepis, E., & Patsakis, C. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2949510 · Cited by 292
Blockchain Security: A Survey of Techniques and Research Directions
Leng, J., Zhou, M., Zhao, J. L., Huang, Y., & Bian, Y. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.3038641 · Cited by 279
Metadata
- Authors
- Ateniese, G., Magri, B., Venturi, D., & Andrade, E.
- Venue
- 2017 IEEE European Symposium on Security and Privacy (EuroS&P)
- Publisher
- IEEE
- Published
- 2017-04
- Pages
- 111-126
- OpenAlex
- W2724185994
- Cited by
- 433
- References
- 30
- FWCI
- 24.57
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.