Digitally signed document sanitizing scheme based on bilinear maps

ABSTRACT

A digital signature does not allow any alteration of the document to which it is attached. Appropriate alteration of some signed documents, however, should be allowed because there are security requirements other than the integrity of the document. In the disclosure of official information, for example, sensitive information such as personal information or national secrets is masked when an official document is sanitized so that its nonsensitive information can be disclosed when it is requested by a citizen. If this disclosure is done digitally by using the current digital signature schemes, the citizen cannot verify the disclosed information because it has been altered to prevent the leakage of sensitive information. The confidentiality of official information is thus incompatible with the integrity of that information, and this is called the digital document sanitizing problem. Conventional solutions such as content extraction signatures and digitally signed document sanitizing schemes with disclosure condition control can either let the sanitizer assign disclosure conditions or hide the number of sanitized portions. The digitally signed document sanitizing scheme we propose here is based on the aggregate signature derived from bilinear maps and can do both.

REFERENCES

• 1: G. Ateniese, D. H. Chou, B. de Medeiros, and G. Tsudik, "Sanitizable signature," In ESORICS 2005, volume 3679 of LNCS, Berlin, Springer--Verlag, 2005.
• 2: G. Ateniese and B. de Medeiros, "On the key-exposure problem in chameleon hashes," In SCN '04, volume 3352 of LNCS, Berlin, Springer--Verlag, 2004.
• 3: M. Bellare and P. Rogaway, "The exact security of digital signatures: How to sign with RSA and Rabin," In Eurocrypt'96, volume 1070 of LNCS, pp. 399--416, Berlin, Springer--Verlag, 1996.
• 4: Dan Boneh , Matthew K. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, p.213-229, August 19-23, 2001
• 5: Dan Boneh , Ben Lynn , Hovav Shacham, Short Signatures from the Weil Pairing, Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, p.514-532, December 09-13, 2001
• 6: D. Boneh, C. Gentry, B. Lynn, and H. Shacham, "Aggregate and Verifiably Encrypted Signatures from Bilinear Maps," In Eurocrypt 2003, volume 2656 of LNCS, pp. 416--432, Berlin, Springer--Verlag, 2003.
• 7: David Chaum , Eugène van Heijst , Birgit Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.470-484, August 11-15, 1991
• 8: J. Coron and D. Naccache, "Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption," In Asiacrypt 2003, volume 2894 of LNCS, pp. 392--397, Berlin, Springer--Verlag, 2003.
• 9: Ronald Cramer , Victor Shoup, Signature schemes based on the strong RSA assumption, Proceedings of the 6th ACM conference on Computer and communications security, p.46-51, November 01-04, 1999, Kent Ridge Digital Labs, Singapore [doi>10.1145/319709.319716]
• 10: Taher El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, Proceedings of CRYPTO 84 on Advances in cryptology, p.10-18, August 1985, Santa Barbara, California, United States
• 11: T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Transactions on Information Theory, vol. IT-31, no. 4, pp. 469--472, July 1985
• 12: Amos Fiat , Adi Shamir, How to prove yourself: practical solutions to identification and signature problems, Proceedings on Advances in cryptology---CRYPTO '86, p.186-194, January 1987, Santa Barbara, California, United States
• 13: A. Fujioka, T. Okamoto, and S. Miyaguchi, "ESIGN: An Efficient Digital Signature Implementation for Smart Cards," In Eurocrypt'91, volume 547 of LNCS, pp.446--457, Berlin, Springer--Verlag, 1992
• 14: S. Galbraith and W. Mao, "Invisibility and Anonymity of Undeniable and Confirmer Signatures," in Topics in Cryptology CTRSA 2003, volume 2612 of LNCS, pp. 80--97, Berlin, Springer--Verlag, 2003
• 15: S. Goldwasser and S. Micali, "Probabilistic Encryption," Special issue of Journal of Computer and Systems Sciences, Vol. 28, No. 2, pp 270--299, April 1984
• 16: Shafi Goldwasser , Silvio Micali , Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, v.17 n.2, p.281-308, April 1988 [doi>10.1137/0217017]
• 17: T. Izu, N. Kanaya, M. Takenaka, and T. Yoshioka, "PIATS: A partially sanitizable signature scheme," In ICICS 2005, volume 3783 of LNCS, pp. 72--83, Berlin, Springer--Verlag, 2005.
• 18: Robert Johnson , David Molnar , Dawn Xiaodong Song , David Wagner, Homomorphic Signature Schemes, Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology, p.244-262, February 18-22, 2002
• 19: A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham "Sequential Aggregate Signatures from Trapdoor Permutations" In Eurocrypt 2004, vol. 3027 of LNCS, pages 74--90, Berlin, Springer--Verlag, May 2004.
• 20: K. Miyazaki, M. Iwamura, T. Matsumoto, R. Sasaki, H. Yoshiura, S. Tezuka, and H. Imai, "Digitally Signed Document Sanitizing Scheme with Disclosure Condition Control," IEICE Trans Fundamentals, Vol. E88-A, No.1, 2005.
• 21: K. Miyazaki, S. Susaki, M. Iwamura, T. Matsumoto, R. Sasaki, and H. Yoshiura, "Digital Documents Sanitizing Problem," IEICE Technical Report, ISEC2003-20, 61--67, 2003 (in Japanese)
• 22: T. Okamoto and A. Shiraishi, "A Fast Signature Scheme Based on Quadratic Inequalities," Proceedings of the Symposium on Security and Privacy, IEEE, pp.123--132, 1985
• 23: R. Sakai, K. Ohgishi, M. Kasahara, "Cryptosystems Based on Pairing," In the 2000 Sympoium on Cryptography and Information Security, Okinawa, Japan, January 2000
• 24: C. P. Schnorr, "Efficient Signature Generation by Smart Cards," J. Cryptology 4(3), pp 161--174, 1991
• 25: Ron Steinfeld , Laurence Bull , Yuliang Zheng, Content Extraction Signatures, Proceedings of the 4th International Conference Seoul on Information Security and Cryptology, p.285-304, December 06-07, 2001
• 26: National Institute of Standards and Technology (NIST), "Secure Hash Standard (SHS)," Federal Information Processing Standards Publication 180--2, 2002.
• 27: National Institute of Standards and Technology (NIST), "Digital Signature Standard (DSS)," Federal Information Processing Standards Publication 186--2, 2000.
• 28: "Gyosei Kikan no Hoyusuru Joho no Kokai ni Kansuru Horitsu (Information Disclosure Law in Japan)," 1999. http://law.e-gov.go.jp/htmldata/H11/H11H0042.html
• 29: MasterCard and Visa, "SET Secure Electronic Transaction Specification, Book 1: Business Description," ver. 1.0, May 1997.
• 30: MasterCard and Visa, "SET Secure Electronic Transaction Specification, Book 2: Programmer's Guide," ver. 1.0, May 1997.

INDEX TERMS

Primary Classification:
  E. Data
  E.3 DATA ENCRYPTION

Additional Classification:
  K. Computing Milieux
  K.4 COMPUTERS AND SOCIETY
      K.4.4 Electronic Commerce
          Subjects: Security

General Terms:
Security

Keywords:
digital signature, information disclosure, privacy issue