How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Digitally signed document sanitizing scheme based on bilinear maps
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A sanitizable signature scheme with aggregation
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
PIATS: a partially sanitizable signature scheme
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Extended sanitizable signatures
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Security of Sanitizable Signatures Revisited
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Sanitizable sgnatures with srong tansparency in the sandard model
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Fully-secure and practical sanitizable signatures
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
On extended sanitizable signature schemes
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Towards a cryptographic treatment of publish/subscribe systems
Journal of Computer Security
Hi-index | 0.00 |
A sanitizable signature scheme is a signature scheme which allows a sanitizer to hide parts of the original message after the message is signed, without interacting with the signer. There exists many security models, properties and constructions for sanitizable signatures, which are useful in different scenarios. The aim of this paper is twofold. Firstly, we summarize different properties in the literature and gives some generic conversions between them. We propose a security model to capture most of these properties. Secondly, we present the first concrete construction of sanitizable signatures which is proven secure in the standard model.