The efficiency method of sanitizable signature scheme for SMF

Hirokazu Miyata, Ryuya Uda, Kenichi Okada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a method of reducing the insertion amount of data at the time of sanitization in order to increase the usefulness of the sanitizable signature scheme for SMF. When a user plays back a part of an SMF, which is signed with a general digital signature, the signature is destroyed. We propose a sanitizable signature scheme for SMF, and the user can prove that a partial playback satisfies the intention of the copyright holder, making it possible to show using the musical piece correctly. With the existing method, the signing object is a hash value set. Therefore, in order to verify the SMF and the sanitized digital signature, all the hash values of the sanitized block are required. With the proposed method, a root hash value is signed instead of a hash value set. Therefore all low rank nodes become a part of the host node, which is a sanitization block, which makes it possible to decrease the insertion amount of data at the time of sanitization of the number of the hash value which a sanitizer inserts.

Original languageEnglish
Title of host publicationProceedings - International Conference on Advanced Information Networking and Applications, AINA
Pages495-502
Number of pages8
DOIs
Publication statusPublished - 2009
Event2009 International Conference on Advanced Information Networking and Applications, AINA 2009 - Bradford, United Kingdom
Duration: 2009 May 262009 May 29

Other

Other2009 International Conference on Advanced Information Networking and Applications, AINA 2009
CountryUnited Kingdom
CityBradford
Period09/5/2609/5/29

Fingerprint

Electronic document identification systems

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Miyata, H., Uda, R., & Okada, K. (2009). The efficiency method of sanitizable signature scheme for SMF. In Proceedings - International Conference on Advanced Information Networking and Applications, AINA (pp. 495-502). [5076239] https://doi.org/10.1109/AINA.2009.115

The efficiency method of sanitizable signature scheme for SMF. / Miyata, Hirokazu; Uda, Ryuya; Okada, Kenichi.

Proceedings - International Conference on Advanced Information Networking and Applications, AINA. 2009. p. 495-502 5076239.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Miyata, H, Uda, R & Okada, K 2009, The efficiency method of sanitizable signature scheme for SMF. in Proceedings - International Conference on Advanced Information Networking and Applications, AINA., 5076239, pp. 495-502, 2009 International Conference on Advanced Information Networking and Applications, AINA 2009, Bradford, United Kingdom, 09/5/26. https://doi.org/10.1109/AINA.2009.115
Miyata H, Uda R, Okada K. The efficiency method of sanitizable signature scheme for SMF. In Proceedings - International Conference on Advanced Information Networking and Applications, AINA. 2009. p. 495-502. 5076239 https://doi.org/10.1109/AINA.2009.115
Miyata, Hirokazu ; Uda, Ryuya ; Okada, Kenichi. / The efficiency method of sanitizable signature scheme for SMF. Proceedings - International Conference on Advanced Information Networking and Applications, AINA. 2009. pp. 495-502
@inproceedings{27836c15494c454f83c1fb856b6a30bf,
title = "The efficiency method of sanitizable signature scheme for SMF",
abstract = "In this paper, we propose a method of reducing the insertion amount of data at the time of sanitization in order to increase the usefulness of the sanitizable signature scheme for SMF. When a user plays back a part of an SMF, which is signed with a general digital signature, the signature is destroyed. We propose a sanitizable signature scheme for SMF, and the user can prove that a partial playback satisfies the intention of the copyright holder, making it possible to show using the musical piece correctly. With the existing method, the signing object is a hash value set. Therefore, in order to verify the SMF and the sanitized digital signature, all the hash values of the sanitized block are required. With the proposed method, a root hash value is signed instead of a hash value set. Therefore all low rank nodes become a part of the host node, which is a sanitization block, which makes it possible to decrease the insertion amount of data at the time of sanitization of the number of the hash value which a sanitizer inserts.",
author = "Hirokazu Miyata and Ryuya Uda and Kenichi Okada",
year = "2009",
doi = "10.1109/AINA.2009.115",
language = "English",
isbn = "9780769536385",
pages = "495--502",
booktitle = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",

}

TY - GEN

T1 - The efficiency method of sanitizable signature scheme for SMF

AU - Miyata, Hirokazu

AU - Uda, Ryuya

AU - Okada, Kenichi

PY - 2009

Y1 - 2009

N2 - In this paper, we propose a method of reducing the insertion amount of data at the time of sanitization in order to increase the usefulness of the sanitizable signature scheme for SMF. When a user plays back a part of an SMF, which is signed with a general digital signature, the signature is destroyed. We propose a sanitizable signature scheme for SMF, and the user can prove that a partial playback satisfies the intention of the copyright holder, making it possible to show using the musical piece correctly. With the existing method, the signing object is a hash value set. Therefore, in order to verify the SMF and the sanitized digital signature, all the hash values of the sanitized block are required. With the proposed method, a root hash value is signed instead of a hash value set. Therefore all low rank nodes become a part of the host node, which is a sanitization block, which makes it possible to decrease the insertion amount of data at the time of sanitization of the number of the hash value which a sanitizer inserts.

AB - In this paper, we propose a method of reducing the insertion amount of data at the time of sanitization in order to increase the usefulness of the sanitizable signature scheme for SMF. When a user plays back a part of an SMF, which is signed with a general digital signature, the signature is destroyed. We propose a sanitizable signature scheme for SMF, and the user can prove that a partial playback satisfies the intention of the copyright holder, making it possible to show using the musical piece correctly. With the existing method, the signing object is a hash value set. Therefore, in order to verify the SMF and the sanitized digital signature, all the hash values of the sanitized block are required. With the proposed method, a root hash value is signed instead of a hash value set. Therefore all low rank nodes become a part of the host node, which is a sanitization block, which makes it possible to decrease the insertion amount of data at the time of sanitization of the number of the hash value which a sanitizer inserts.

UR - http://www.scopus.com/inward/record.url?scp=70349490101&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349490101&partnerID=8YFLogxK

U2 - 10.1109/AINA.2009.115

DO - 10.1109/AINA.2009.115

M3 - Conference contribution

AN - SCOPUS:70349490101

SN - 9780769536385

SP - 495

EP - 502

BT - Proceedings - International Conference on Advanced Information Networking and Applications, AINA

ER -