A Storage Efficient Redactable Signature in the Standard Model

Nojima, Ryo; Tamura, Jin; Kadobayashi, Youki; Kikuchi, Hiroaki

doi:10.1007/978-3-642-04474-8_26

Cited by 17 publications

(30 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our scheme does not need a mechanism to share random prime numbers; hence, our result improves the computational efficiency of the schemes based on RSA in [4], [6]. The security of our proposed scheme relies on the security of the full-domain RSA signature.…”

Section: Introductionmentioning

confidence: 86%

“…The redactable signature scheme on bitstrings in [4] employs a Merkle tree and a GGM tree, and the size of the redacted signature varies according to the number or the position of the redacted parts. Recently, Nojima and others presented a storage efficient redactable signature based on RSA in [6]. This scheme is the shortest among known the redactable signature schemes although it suffers from heavy computations.…”

Section: Efficiency Of Some Redactable Signature Schemes Based On Rsamentioning

confidence: 99%

“…In general, a redactable signature is used for documents with unspecific structure, such as bit strings [1]- [6]. For privacy concerns, it is desirable to release a signed document only after revising the sensitive content according to the privacy policy.…”

Section: Introductionmentioning

confidence: 99%

“…In the paper [4], Johnson and others presented a very short set homomorphic signature scheme based on RSA and a method to convert the set homomorphic signature to a redactable signature. Recently, Nojima and others presented a A Short and Efficient Redactable Signature Based on RSA Seongan Lim and Hyang-Sook Lee storage-efficient redactable signature based on RSA in [6]. Recently, Nojima and others presented a A Short and Efficient Redactable Signature Based on RSA Seongan Lim and Hyang-Sook Lee storage-efficient redactable signature based on RSA in [6].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Short and Efficient Redactable Signature Based on RSA

Lim¹

2011

ETRI J

View full text Add to dashboard Cite

The redactable signature scheme was introduced by Johnson and others in 2002 as a mechanism to support disclosing verifiable subdocuments of a signed document. In their paper, a redactable signature based on RSA was presented. In 2009, Nojima and others presented a redactable signature scheme based on RSA. Both schemes are very efficient in terms of storage. However, the schemes need mechanisms to share random prime numbers, which causes huge time consuming computation. Moreover, the public key in the scheme of Johnson and others is designed to be used only once. In this paper, we improve the computational efficiency of these schemes by eliminating the use of a random prime sharing mechanism while sustaining the storage efficiency of them. The size of our signature scheme is the same as that of the standard RSA signature scheme plus the size of the security parameter. In our scheme, the public key can be used multiple times, and more efficient key management than the scheme of Johnson and others is possible. We also prove that the security of our scheme is reduced to the security of the full domain RSA signature scheme.

show abstract

Section: Introductionmentioning

confidence: 86%

Section: Efficiency Of Some Redactable Signature Schemes Based On Rsamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Short and Efficient Redactable Signature Based on RSA

Lim¹

2011

ETRI J

View full text Add to dashboard Cite

show abstract

“…Another approach by [16] extends the treebased construction of [2] such that the length of the redacted strings can be hidden. Finally, [17] have proposed a redactable signature scheme that does not rely on random oracles and is provably secure in the standard model.…”

Section: Related Workmentioning

confidence: 99%

Generalizations and Extensions of Redactable Signatures with Applications to Electronic Healthcare

Slamanig

Raß

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Redactable signatures allow for altering signed documents, retaining the validity of the signature without interaction with the original signer. In their plain form, such schemes are designed for documents having an unspecific structure, i.e. documents are simply considered as binary strings. In this work, we generalize the concept of redactable signatures towards documents that inherently provide a structure and investigate the security of our construction. Furthermore, we present extensions to our scheme, adding features not commonly provided by other redactable signature schemes. Additionally, various applications in healthcare are discussed, supporting the applicability and usability of our construction.

show abstract

A short redactable signature scheme using pairing

Lim

Lee

Park

2011

Security Comm Networks

View full text Add to dashboard Cite

Redactable signature schemes permit deletion of arbitrary substrings of a signed document while preserving the authenticity of the remaining document. Most of known redactable signatures based on pairing have large-sized signatures and the sizes depend on the product of security parameter and the number of blocks of the redacted document. In this paper, we present a short redactable signature scheme based on pairing. We modify Waters signature scheme to obtain an underlying standard signature defined on composite-order bilinear group. The modified scheme satisfies the unforgeability under the known message attack based on the Computational Diffie-Hellman assumption. Based on the modified Waters signature, we propose a short redactable signature that is existentially unforgeable under random message attack and weakly private. The size of the proposed scheme is 20% of known redactable signatures using aggregated pairing-based signatures when half of the message blocks are deleted.

show abstract

A Storage Efficient Redactable Signature in the Standard Model

Cited by 17 publications

References 18 publications

A Short and Efficient Redactable Signature Based on RSA

A Short and Efficient Redactable Signature Based on RSA

Generalizations and Extensions of Redactable Signatures with Applications to Electronic Healthcare

A short redactable signature scheme using pairing

Contact Info

Product

Resources

About