On Updatable Redactable Signatures

Pöhls, Henrich C.; Samelin, Kai

doi:10.1007/978-3-319-07536-5_27

Cited by 28 publications

(8 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-Accountability [18]: Pöhls and Samelin proposed an accountable redactable signature scheme that allows deriving the accountable party of a signed message. -Update and Marge [12,17]: Lim, Lee, and Park [12] proposed the redactable signature scheme where a signer can update signature by adding new parts of a message. Moreover, Pöhls and Samelin [17] proposed the updatable redactable signature scheme that can update a signature and marge signatures derived from the same signer.…”

Section: Redactable Signaturesmentioning

confidence: 99%

A t-out-of-n Redactable Signature Scheme

Tezuka

Tanaka

2022

Preprint

View full text Add to dashboard Cite

A redactable signature scheme allows removing parts of a signed message without invalidating the signature. Currently, the need to prove the validity of digital documents issued by governments and enterprises is increasing. However, when disclosing documents, governments and enterprises must remove privacy information concerning individuals. A redactable signature scheme is useful for such a situation. In this paper, we introduce the new notion of the t-out-of-n redactable signature scheme. This scheme has a signer, n redactors, a combiner, and a verifier. The signer designates n redactors and a combiner in advance and generates a signature of a message M . Each redactor decides parts that he or she wants to remove from the message and generates a piece of redaction information. The combiner collects pieces of redaction information from all redactors, extracts parts of the message that more than t redactors want to remove, and generate a redacted message. We consider the one-time redaction model which allows redacting signatures generated by the signer only once. We formalize the one-time redaction t-out-of-n redactable signature scheme, define security, and give a construction using the pairing based aggregate signature scheme in the random oracle model.

show abstract

Section: Redactable Signaturesmentioning

confidence: 99%

A t-out-of-n Redactable Signature Scheme

Tezuka

Tanaka

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Most constructions for ZKADS do not allow the data owner to perform updates (see [19] and references therein). Recently, an updatable ZKADS for sets with proofs of membership [55], and an updatable ZKADS for lists, trees and partially-ordered sets of bounded dimension [20] were proposed.…”

Section: Appendix O Related Workmentioning

confidence: 99%

Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases

Camenisch¹,

Dubovitskaya²,

Rial

2021

2021 IEEE 34th Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

“…Cryptographic accumulators were first proposed by Benaloh et al [31] with applications in timestamping, more specifically, to witness the existence of a value in a certain time. Subsequently, more accumulator schemes were proposed to apply to other applications such as redactable signature [32], P-homomorphic signatures [33] and privacy-preserving data outsourcing [34]. Recently, Derler et al [5] and Noar and Ziv [35] proposed a unified formal model for cryptographic accumulators and a primarysecondary-resolver membership proof systems, respectively.…”

Section: Ryptographic Accumulatormentioning

confidence: 99%

Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing

Zhu

Cui

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Due to the rapid development of social networks, bio-informatics, internet-of-things etc., subgraph matching query can be found in various applications. Meanwhile, the increasing popularity of storing graph data in the cloud drives demands for graph query processing on a remote cloud server. However, the query results in this scenario may not be guaranteed to be correct, especially when the cloud service provider (CSP) is malicious or compromised by some adversaries, for example, a CSP might omit some edges of the graph so that its search cost would be substantially reduced. Besides, various software bugs and unintended errors are also inevitable. All current generic verifiable computation (VC) schemes applied in this scenario are not only too impractical to be implemented but also need a lot of space to locally store their auxiliary data. To that end, we have put forth both public and designated verification schemes which focus on subgraph matching problems for outsourced graph data. They utilize a modified cryptographic primitive called accumulator to realize fast verification and low local storage overhead. In addition to the two main constructions, we have proposed an optimization to make the scheme more applicable, namely, supporting dynamic updates of the graph. At last, rigorous security proofs and efficiency analysis are given, which justify that our proposed schemes are secure and efficient, satisfying the requirements of general verifiable computation protocols.INDEX TERMS Cloud computing, cryptographic accumulator, subgraph matching, verifiable computation.

show abstract

On Updatable Redactable Signatures

Cited by 28 publications

References 39 publications

A t-out-of-n Redactable Signature Scheme

A t-out-of-n Redactable Signature Scheme

Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases

Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing

Contact Info

Product

Resources

About