Fine-Grained and Controlled Rewriting in Blockchains: Chameleon-Hashing Gone Attribute-Based

Derler, David; Samelin, Kai; Slamanig, Daniel; Striecks, Christoph

doi:10.14722/ndss.2019.23066

Cited by 131 publications

(72 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, all of the proposed schemes solve this problem on the block level. Recently, Derler et al [12] proposed a finegrained and transaction-level redactable blockchain. In their scheme, a new policy-based chameleon hash was proposed, the new hash allows anyone who possesses sufficient privileges to satisfy the policy can then find arbitrary collisions for a given hash value.…”

Section: A Ralated Workmentioning

confidence: 99%

See 1 more Smart Citation

Privacy-Protected Deletable Blockchain

2020

View full text Add to dashboard Cite

A deletable blockchain has been proposed recently to change the immutability of the traditional blockchain. However, the users' identities and transaction contents are all public in the scheme, and the public data may reveal the users' privacy. In order to protect the privacy of the users, we propose a privacyprotected deletable blockchain based on the proof-of-space consensus mechanism, which does not rely on complex cryptographic tools or any trusted party. In order to satisfy full transparency and accountability in an anonymous environment, we use a traceable ring signature or a Pedersen commitment scheme to disclose the users' real identities or the real transaction contents respectively according to different deletion reasons. During the deletion process, we propose a linkable multi-signature scheme, which allows multiple users to generate a valid signature by using their one-time addresses as pseudonyms to protect their identity privacy. Moreover, the proposed multi-signature scheme can link two sub-signatures if they are generated by the same malicious user. Finally, we simulate the generation and deletion process of a block under the proof-of-space consensus mechanism and give the time of generating and deleting a block. The experimental results prove the efficiency and feasibility of our proposed scheme. INDEX TERMS Blockchain, privacy protection, deletable, linkable multi-signature. XIANJI CAI received the B.S. degree in electronics and information engineering from Shanghai University, China, in 2018, where she is currently pursuing the M.S. degree. Her research interests are blockchain security and cryptocurrencies. YANLI REN received the M.S. degree in applied mathematics from Shaanxi Normal University, China, in 2005, and the Ph.D. degree in computer science and technology from Shanghai Jiao Tong University, China, in 2009. She is currently a Professor with the School of Communication and Information Engineering, Shanghai University, China. She has published more than 60 articles on international journals and conference papers. Her research interests include applied cryptography, secure outsourcing computing, and network security.

show abstract

Section: A Ralated Workmentioning

confidence: 99%

“…3) The rest of the users calculate the hash value h r 1 , r 2 , d and compare the hash result with the commitment C received in step 1) to verify the validity of the real transaction contents d . If the equation (12) holds, the revealed transaction contents d is valid.…”

Section: ) Revealing the Sender's Real Identitymentioning

confidence: 99%

Privacy-Protected Deletable Blockchain

2020

View full text Add to dashboard Cite

show abstract

“…But, unlike ours, it did not build a regular (multiple-times) signature scheme for continuous message authentication in cyber-physical systems. CHF is also used in many real-world application such as the vehicular communications [44], verifiable data streaming [45], and rewritable block-chains [46]. However, all these constructions require the (message) sender to compute the hash value of the CHF, which involves two expensive exponentiation operations.…”

Section: Related Workmentioning

confidence: 99%

LiS: Lightweight Signature Schemes for Continuous Message Authentication in Cyber-Physical Systems

Yang

Jin

Tian

et al. 2020

Proceedings of the 15th ACM Asia Conference on Computer and Communications Security

View full text Add to dashboard Cite

Cyber-Physical Systems (CPS) provide the foundation of our critical infrastructures, which form the basis of emerging and future smart services and improve our quality of life in many areas. In such CPS, sensor data is transmitted over the network to the controller, which will make real-time control decisions according to the received sensor data. Due to the existence of spoofing attacks (more specifically to CPS, false data injection attacks), one has to protect the authenticity and integrity of the transmitted data. For example, a digital signature can be used to solve this issue. However, the resource-constrained field devices like sensors cannot afford conventional signature computation. Thus, we have to seek for an efficient signature mechanism that can support the fast and continuous message authentication in CPS, while being easy to compute on the devices. To this end, we introduce two Lightweight Signature schemes (LiS), which are suitable for continuous message authentication commonly seen in cyber-physical systems. In our constructions, we exploit the efficient hash collision generation property of a chameleon hash function to transform a chameleon hash function into signature schemes. In our schemes, the signature of a message m is the randomness r associated with m in a chameleon hash function, such that they can lead to a hash collision with a given message randomness pair (m ′ , r ′). Thus, the task of a signer is to generate the collision using the private key of the underlying chameleon hash function, and a verifier can verify the signature by checking the hash collision with a known message and randomness pair. We also specifically instantiate the chameleon hash function in such a way that it leads to a fast signing procedure and an optimal storage requirement on the signer side. The optimized signing algorithms are very efficient. Namely, our first scheme requires only three additions and two multiplications, and only one

show abstract

“…Recently, [4] claimed the first efficient redactable public blockchain construction. We also mention chameleon hash functions [9] that were recently used in redactable blockchain constructions [3,10].…”

Section: Redactable Blockchain Structurementioning

confidence: 99%

RSA and redactable blockchains

Grigoriev

Shpilrain

2020

International Journal of Computer Mathematics: Computer Systems

View full text Add to dashboard Cite

A blockchain is redactable if a private key holder (e.g. a central authority) can change any single block without violating integrity of the whole blockchain, but no other party can do that. In this paper, we offer a simple method of constructing redactable blockchains inspired by the ideas underlying the well-known RSA encryption scheme. Notably, our method can be used in conjunction with any reasonable hash function that is used to build a blockchain. Public immutability of a blockchain in our construction is based on the computational hardness of the RSA problem and not on properties of the underlying hash function. Corruption resistance is based on the computational hardness of the discrete logarithm problem.

show abstract

Fine-Grained and Controlled Rewriting in Blockchains: Chameleon-Hashing Gone Attribute-Based

Cited by 131 publications

References 30 publications

Privacy-Protected Deletable Blockchain

Privacy-Protected Deletable Blockchain

LiS: Lightweight Signature Schemes for Continuous Message Authentication in Cyber-Physical Systems

RSA and redactable blockchains

Contact Info

Product

Resources

About