Constraints-based and One-time Modification Redactable Blockchain

被引:0
|
作者
Wang, Chunli [1 ]
Chen, Yuling [1 ]
Jia, Wensheng [1 ]
机构
[1] Guizhou Univ, Coll Math & Stat, Guiyang, Peoples R China
来源
JOURNAL OF INTERNET TECHNOLOGY | 2023年 / 24卷 / 07期
关键词
Chameleon hash; Redactable; Blockchain rewriting; SUPPLY CHAIN; SYSTEM;
D O I
10.53106/160792642023122407005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Immutability enables the blockchain to store data permanently, which is considered to be the most essential property to protect the security of blockchain technology. However, illegal content stored on the blockchain cannot be modified either. "The right to be forgotten" stipulates that the data subject has the right to request the data controller to delete personal data about him, and the controller is obliged to delete the personal data in a timely manner in such circumstances. Therefore, redactable blockchains are proposed to solve the aforementioned problems. The redactable blockchain relaxes the immutability of blockchains in a controlled manner. However, a participant who is granted the privilege to modify the blockchain, he/she may add inappropriate or malicious modifications to the content of historical blocks. In this article, we introduce a redactable blockchain where transaction owners restrict what editors can rewrite in transactions. When posting an editable transaction, the transaction owner indicates what can be edited and what cannot be edited in order to restrict a transaction modifier from making malicious changes to the content of the transaction. The modifier's changes to the transaction are then validated by the validator and any malicious changes that do not meet the requirements will fail to be validated. To counteract collusive attacks between modifiers and validators, they will be held accountable and penalized.
引用
收藏
页码:1437 / 1446
页数:10
相关论文
共 50 条
  • [41] One-time proxy signature based on quantum cryptography
    Wang, Tian-Yin
    Wei, Zong-Li
    QUANTUM INFORMATION PROCESSING, 2012, 11 (02) : 455 - 463
  • [42] Efficient commerce protocols based on one-time pads
    Schneider, MA
    Felten, EW
    16TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2000, : 317 - 326
  • [43] Constraints-Based Complex Behavior in Rich Environments
    Allbeck, Jan M.
    Kress-Gazit, Hadas
    INTELLIGENT VIRTUAL AGENTS, IVA 2010, 2010, 6356 : 1 - 14
  • [44] An enhanced Kerberos protocol based on one-time password
    Ma, Limin
    Zhu, Yuesheng
    ICIC Express Letters, 2014, 8 (09): : 2497 - 2502
  • [45] Chaos-Based One-Time Pad Cryptography
    Miyano, Takaya
    Cho, Kenichiro
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 156 - 160
  • [46] A generic constraints-based framework for business modeling
    Li, Min
    Hogger, Christopher J.
    TRENDS IN ENTERPRISE APPLICATION ARCHITECTURE, 2007, 4473 : 241 - +
  • [47] Timing constraints-based RBAC delegation model
    Co-soft R and D Center, Sun Yat-sen University, Guangzhou 510275, China
    不详
    Jisuanji Jicheng Zhizao Xitong, 2008, 8 (1533-1538):
  • [48] GENERALIZATION FOR A PROPOSITIONAL CALCULUS - A CONSTRAINTS-BASED APPROACH
    VORCH, R
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 541 : 264 - 277
  • [49] Delegation model for periodicity constraints-based DAC
    National Engineering Research Center for Foundational Software, Institute of Software, Chinese Acad. of Sci., Beijing 100080, China
    不详
    Jisuanji Xuebao, 2006, 8 (1427-1437):
  • [50] Security of a one-time signature
    Yen, SM
    ELECTRONICS LETTERS, 1997, 33 (08) : 677 - 679