# Efficient Sanitizable Signatures Without Random Oracles

@inproceedings{Lai2016EfficientSS, title={Efficient Sanitizable Signatures Without Random Oracles}, author={Russell W. F. Lai and Tao Zhang and Sherman S. M. Chow and Dominique Schr{\"o}der}, booktitle={ESORICS}, year={2016} }

Sanitizable signatures, introduced by Ateniese et al. (ESORICS ’05), allow the signer to delegate the sanitization right of signed messages. The sanitizer can modify the message and update the signature accordingly, so that the sanitized part of the message is kept private. For stronger protection of sensitive information, it is desirable that no one can link sanitized message-signature pairs of the same document. This idea was formalized by Brzuska et al. (PKC ’10) as unlinkability, which was…

## 29 Citations

Efficient Invisible and Unlinkable Sanitizable Signatures

- Computer Science, MathematicsPublic Key Cryptography
- 2019

This work constructs (non-accountable) invisible and unlinkable sanitizable signatures from signatures on equivalence classes and other basic primitives and puts forth a generic transformation using verifiable ring signatures to turn any non- accountable sanitized signature into an accountable one while preserving all other properties.

Practical Strongly Invisible and Strongly Accountable Sanitizable Signatures

- Computer ScienceACISP
- 2017

The notion of invisible sanitizable signatures that hides from an outsider which parts of a message are admissible does not consider dishonest signers, and their signer-accountability definition does not prevent the signer from falsely accusing the sanitizer of having issued a signature on a sanitized message by exploiting the malleability of the signature itself.

Protean Signature Schemes

- Computer ScienceCANS
- 2018

We introduce the notion of Protean Signature schemes. This novel type of signature scheme allows to remove and edit signer-chosen parts of signed messages by a semi-trusted third party…

Fully Invisible Protean Signatures Schemes

- Computer ScienceIACR Cryptol. ePrint Arch.
- 2019

The authors introduce the new notions of invisible RSs and invisible non-accountable SSs, along with a consolidated framework for aggregate signatures, and extend PSs to be fully invisible, guaranteeing that an outsider can identify neither editable nor redactable parts.

Unlinkable and Strongly Accountable Sanitizable Signatures from Verifiable Ring Signatures

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2017

This paper proposes a stronger definition of accountability: an USS is accountable when the signer can prove whether a signature is sanitized and formally defines the notion of strong accountability where the sanitizer can also prove the origin of a signature.

Position Paper: The Past, Present, and Future of Sanitizable and Redactable Signatures

- Computer ScienceARES
- 2017

The state-of-the-art SSS and redactable signature schemes are discussed, and potential future research opportunities are highlighted, to bring both primitives into practice.

A New Constant-Size Accountable Ring Signature Scheme Without Random Oracles

- Computer Science, MathematicsInscrypt
- 2017

This paper presents an efficient construction for ARS with signature-size logarithmic in the size of the ring and a scheme based on q-type assumptions (q-SDH) that is secure in the standard model.

Delegatable functional signatures

- Computer Science, MathematicsIET Inf. Secur.
- 2018

The authors characterise the instantiability of DFS with respect to the corresponding security notions of unforgeability and privacy and show that privacy-free and private DFS can be constructed from one-way functions.

Foundations of Fully Dynamic Group Signatures

- Computer Science, MathematicsACNS
- 2016

A number of shortcomings in existing security definitions for fully dynamic group signatures are identified and a formal rigorous security model for the primitive is provided, which can be used to argue about the security of different existing constructions following different design paradigms.

A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Application to Identity Management

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

This paper proposes a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes and is secure under simple assumptions (in the random oracle model), whereas all scalable scheme are secure under q-type assumptions.

## References

SHOWING 1-10 OF 30 REFERENCES

Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys

- Computer Science, MathematicsPublic Key Cryptography
- 2015

This work presents the first efficient instantiation of unlinkable sanitizable signatures, based on a novel type of signature schemes with re-randomizable keys, and instantiates this generic idea with Schnorr signatures and efficient $$varSigma $$Σ-protocols, which are converted into non-interactive zero-knowledge proofs via the Fiat-Shamir transformation.

Security of Sanitizable Signatures Revisited

- Computer SciencePublic Key Cryptography
- 2009

This work revisits the security requirements for sanitizable signatures and, for the first time, presents a comprehensive formal treatment, investigating the relationship of the properties and showing for example that unforgeability follows from accountability.

Extended Sanitizable Signatures

- Computer ScienceICISC
- 2006

This paper presents several extensions of this paradigm that make sanitizable signatures even more useful, including one that allows the censor to present only a constant number of versions of the sanitized message and another that provides so-called strong transparency.

Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures

- Computer ScienceEuroPKI
- 2013

This work strengthens the standard unlinkability definition by Brzuska et al. at PKC ’10, making it robust against malicious or buggy signers and uses standard digital signatures, which makes them compatible with existing infrastructure.

Unlinkability of Sanitizable Signatures

- Computer SciencePublic Key Cryptography
- 2010

It is discussed that a sixth property of sanitizable signature schemes may be desirable: unlinkability, which prevents that one can link sanitized message-signature pairs of the same document, thus allowing to deduce combined information about the original document.

Sanitizable Signatures with Several Signers and Sanitizers

- Computer ScienceAFRICACRYPT
- 2012

This paper formalizes the concept of sanitizable signatures with n signers and m sanitizers, taking into account recent models (for 1 signer and 1 sanitizer) on the subject.

On Extended Sanitizable Signature Schemes

- Computer Science, MathematicsCT-RSA
- 2010

A new secure sanitizable signature scheme is given which is, to the best of the knowledge, the most efficient construction with such a high level of security.

TrapdoorSanitizable Signatures and Their Application to Content Protection

- Computer Science, MathematicsACNS
- 2008

This paper formally introduces trapdoor sanitizable signatures, a concept that allows a designated entity to modify some specific parts of a signed message and to produce a new signature of the resulting message without any interaction with the original signer.

Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction of Strongly Private Schemes

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2015

A notion stronger than privacy, but weaker than unlinkability is proposed, which captures privacy in the original sense and allows to easily construct efficient schemes satisfying this notion from secure existing schemes in a black-box fashion.

Sanitizable Signatures

- Computer Science, MathematicsESORICS
- 2005

This work presents constructions for this new primitive, based on standard signature schemes and secure under common cryptographic assumptions, and provides experimental measurements for the implementation of a sanitizable signature scheme and demonstrates its practicality.