Sanitizable Signatures with Strong Transparency in the Standard Model

  • Shivank Agrawal
  • Swarun Kumar
  • Amjed Shareef
  • C. Pandu Rangan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6151)


Sanitizable signatures provide several security features which are useful in many scenarios including military and medical applications. Sanitizable signatures allow a semi-trusted party to update some part of the digitally signed document without interacting with the original signer. Such schemes, where the verifier cannot identify whether the message has been sanitized, are said to possess strong transparency. In this paper, we have described the first efficient and provably secure sanitizable signature scheme having strong transparency under the standard model.


sanitizable signatures strong transparency standard model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bull, L., Stañski, P., Squire, D.: Content extraction signatures using xml digital signatures and custom transforms on-demand. In: WWW, pp. 170–177 (2003)Google Scholar
  2. 2.
    Ateniese, G., Chou, D.H., de Medeiros, B., Tsudik, G.: Sanitizable signatures. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159–177. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Klonowski, M., Lauks, A.: Extended sanitizable signatures. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 343–355. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Miyazaki, K., Hanaoka, G., Imai, H.: Digitally signed document sanitizing scheme based on bilinear maps. In: ASIACCS, pp. 343–354 (2006)Google Scholar
  5. 5.
    Miyazaki, K., Iwamura, M., Matsumoto, T., Sasaki, R., Yoshiura, H., Tezuka, S., Imai, H.: Digitally signed document sanitizing scheme with disclosure condition control. IEICE Transactions 88-A(1), 239–246 (2005)Google Scholar
  6. 6.
    Suzuki, M., Isshiki, T., Tanaka, K.: Sanitizable signature with secret information. In: Research Reports on Mathematical and Computing Sciences, pp. 114–127. Springer, Heidelberg (2005)Google Scholar
  7. 7.
    Chang, E.C., Lim, C.L., Xu, J.: Short redactable signatures using random trees. In: CT-RSA, pp. 133–147 (2009)Google Scholar
  8. 8.
    Izu, T., Kunihiro, N., Ohta, K., Takenaka, M., Yoshioka, T.: A sanitizable signature scheme with aggregation. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 51–64. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Yuen, T.H., Susilo, W., Liu, J.K., Mu, Y.: Sanitizable signatures revisited. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol. 5339, pp. 80–97. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Klonowski, M., Lauks, A.: Extended sanitizable signatures. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 343–355. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Brzuska, C., Fischlin, M., Freudenreich, T., Lehmann, A., Page, M., Schelbert, J., Schröder, D., Volk, F.: Security of sanitizable signatures revisited. In: Irvine: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography, pp. 317–336. Springer, Heidelberg (2009)Google Scholar
  13. 13.
    Agrawal, S., Kumar, S., Shareef, A., Rangan, C.P.: Sanitizable signatures with strong transparency in the standard model (full version). Cryptology ePrint Archive (2010),
  14. 14.
    Johnson, R., Molnar, D., Song, D.X., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244–262. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Kunihiko, M., Susaki Seiichi, I.M.: Digital document sanitizing problem. In: CIEIC Technical Report (Institute of Electronics, Information and Communication Engineers), pp. 61–67 (2003)Google Scholar
  16. 16.
    Haber, S., Hatano, Y., Honda, Y., Horne, W., Miyazaki, K., Sander, T., Tezoku, S., Yao, D.: Efficient signature schemes supporting redaction, pseudonymization, and data deidentification. In: ASIACCS 2008: Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, pp. 353–362. ACM, New York (2008)CrossRefGoogle Scholar
  17. 17.
    Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  18. 18.
    Izu, T., Kanaya, N., Takenaka, M., Yoshioka, T.: Piats: A partially sanitizable signature scheme. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 72–83. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Shivank Agrawal
    • 1
  • Swarun Kumar
    • 1
  • Amjed Shareef
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Theoretical Computer Science Lab, Department of Computer Science and EngineeringIndian Institute of TechnologyMadrasIndia

Personalised recommendations