Content Extraction Signatures, LNCS, vol.2288, pp.285-304, 2001. ,
DOI : 10.1007/3-540-45861-1_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5705
Homomorphic Signature Schemes, LNCS, vol.2271, pp.244-262, 2002. ,
DOI : 10.1007/3-540-45760-7_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.1944
A Certified Digital Signature, LNCS, vol.435, pp.218-238, 1989. ,
DOI : 10.1007/0-387-34805-0_21
Revisiting the uniqueness of simple demographics in the US population, Proceedings of the 5th ACM workshop on Privacy in electronic society , WPES '06, pp.77-80, 2006. ,
DOI : 10.1145/1179601.1179615
Theory of Privacy and Anonymity, 2009. ,
DOI : 10.1201/9781584888215-c18
Protecting respondents identities in microdata release, IEEE Transactions on Knowledge and Data Engineering, vol.13, issue.6, pp.1010-1027, 2001. ,
DOI : 10.1109/69.971193
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.10, issue.05, pp.557-570, 2002. ,
DOI : 10.1142/S0218488502001648
Security of Sanitizable Signatures Revisited, PKC 2009, 2009. ,
DOI : 10.1007/978-3-642-00468-1_18
Sanitizable Signatures, 10th European Symp. on Research in Computer Security -ESORICS 2005, pp.159-177, 2005. ,
DOI : 10.1007/11555827_10
Trapdoor Sanitizable Signatures and Their Application to Content Protection, ACNS '08, pp.258-276, 2008. ,
DOI : 10.1007/978-3-540-68914-0_16
Extended Sanitizable Signatures, LNCS, vol.4296, pp.343-355, 2006. ,
DOI : 10.1007/11927587_28
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, LNCS, vol.2656, pp.416-432, 2003. ,
DOI : 10.1007/3-540-39200-9_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.459
Digitally signed document sanitizing scheme based on bilinear maps, Proceedings of the 2006 ACM Symposium on Information, computer and communications security , ASIACCS '06, pp.343-354, 2006. ,
DOI : 10.1145/1128817.1128868
Yet Another Sanitizable Signature from Bilinear Maps, 2009 International Conference on Availability, Reliability and Security, pp.941-946, 2009. ,
DOI : 10.1109/ARES.2009.14
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification, Proceedings of the 2008 ACM symposium on Information, computer and communications security , ASIACCS '08, pp.353-362, 2008. ,
DOI : 10.1145/1368310.1368362
Short Redactable Signatures Using Random Trees, CT-RSA '09, 2009. ,
DOI : 10.1007/11967668_9
A Storage Efficient Redactable Signature in the Standard Model, LNCS, vol.17, issue.2, pp.326-337, 2009. ,
DOI : 10.1007/3-540-45539-6_7
Redactable signatures on data with dependencies and their application to personal health records, Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, pp.91-100, 2009. ,
DOI : 10.1145/1655188.1655201
How to construct random functions, Journal of the ACM, vol.33, issue.4, pp.792-807, 1986. ,
DOI : 10.1145/6490.6503
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, LNCS, vol.1109, pp.201-215, 1996. ,
DOI : 10.1007/3-540-68697-5_16
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, vol.17, issue.2, pp.281-308, 1988. ,
DOI : 10.1137/0217017
Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
DOI : 10.1145/362686.362692
One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) In: EUROCRYPT '93, LNCS, vol.765, pp.274-285, 1993. ,