How to utilize the transformability of digital signatures for solving the oracle problem

Masahiro Mambo, Kouichi Sakurai, Eiji Okamoto

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

9 Citations (Scopus)

Abstract

Transformability is a property of a digital signature such that one valid signature can be transformed into another valid signature of the same signature scheme. Usually digital signatures should not be forged so that the transformability is regarded as an unfavorable property. Contrarily we show that the transformability can be positively utilized for solving the oracle problem. The oracle problem is the following problem existing in some cryptographic protocols. An entity following a protocol receives a message from an adversary, and returns a certain value computed by a procedure specified in the protocol. In this process the adversary may obtain useful information by interacting with the oracle entity. The blind signature scheme and the blind decoding scheme are examples of such a protocol. Since these blinding techniques are very important in cryptographic applications, e.g. electronic money and digital pay magazine, a method to prevent illegal information leakage should be found. In this paper an oracle problem in the blind decoding scheme based on the ElGamal cryptosystem is solved with the use of a transformable digital signature. As in the original blind decoding scheme, the proposed blind decoding protocol offers users perfect untraceability. We also discuss the relevance of the transformable signature to the blind signature, the divertible zeroknowledge interactive proof and other schemes.

Original languageEnglish
Title of host publicationAdvances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
EditorsKwangjo Kim, Tsutomu Matsumoto
PublisherSpringer Verlag
Pages322-333
Number of pages12
ISBN (Print)9783540618720
Publication statusPublished - Jan 1 1996
EventInternational Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996 - Kyongju, Korea, Republic of
Duration: Nov 3 1996Nov 7 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1163
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996
CountryKorea, Republic of
CityKyongju
Period11/3/9611/7/96

Fingerprint

Electronic document identification systems
Digital Signature
Decoding
Blind Signature
Signature
Signature Scheme
Valid
Interactive Proofs
Zero-knowledge
Cryptographic Protocols
Cryptosystem
Leakage
Cryptography
Electronics

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mambo, M., Sakurai, K., & Okamoto, E. (1996). How to utilize the transformability of digital signatures for solving the oracle problem. In K. Kim, & T. Matsumoto (Eds.), Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (pp. 322-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1163). Springer Verlag.

How to utilize the transformability of digital signatures for solving the oracle problem. / Mambo, Masahiro; Sakurai, Kouichi; Okamoto, Eiji.

Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. ed. / Kwangjo Kim; Tsutomu Matsumoto. Springer Verlag, 1996. p. 322-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1163).

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

Mambo, M, Sakurai, K & Okamoto, E 1996, How to utilize the transformability of digital signatures for solving the oracle problem. in K Kim & T Matsumoto (eds), Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1163, Springer Verlag, pp. 322-333, International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996, Kyongju, Korea, Republic of, 11/3/96.
Mambo M, Sakurai K, Okamoto E. How to utilize the transformability of digital signatures for solving the oracle problem. In Kim K, Matsumoto T, editors, Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Springer Verlag. 1996. p. 322-333. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mambo, Masahiro ; Sakurai, Kouichi ; Okamoto, Eiji. / How to utilize the transformability of digital signatures for solving the oracle problem. Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. editor / Kwangjo Kim ; Tsutomu Matsumoto. Springer Verlag, 1996. pp. 322-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{693a355ab6034458ae8bf66928ea01de,
title = "How to utilize the transformability of digital signatures for solving the oracle problem",
abstract = "Transformability is a property of a digital signature such that one valid signature can be transformed into another valid signature of the same signature scheme. Usually digital signatures should not be forged so that the transformability is regarded as an unfavorable property. Contrarily we show that the transformability can be positively utilized for solving the oracle problem. The oracle problem is the following problem existing in some cryptographic protocols. An entity following a protocol receives a message from an adversary, and returns a certain value computed by a procedure specified in the protocol. In this process the adversary may obtain useful information by interacting with the oracle entity. The blind signature scheme and the blind decoding scheme are examples of such a protocol. Since these blinding techniques are very important in cryptographic applications, e.g. electronic money and digital pay magazine, a method to prevent illegal information leakage should be found. In this paper an oracle problem in the blind decoding scheme based on the ElGamal cryptosystem is solved with the use of a transformable digital signature. As in the original blind decoding scheme, the proposed blind decoding protocol offers users perfect untraceability. We also discuss the relevance of the transformable signature to the blind signature, the divertible zeroknowledge interactive proof and other schemes.",
author = "Masahiro Mambo and Kouichi Sakurai and Eiji Okamoto",
year = "1996",
month = "1",
day = "1",
language = "English",
isbn = "9783540618720",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "322--333",
editor = "Kwangjo Kim and Tsutomu Matsumoto",
booktitle = "Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings",
address = "Germany",

}

TY - GEN

T1 - How to utilize the transformability of digital signatures for solving the oracle problem

AU - Mambo, Masahiro

AU - Sakurai, Kouichi

AU - Okamoto, Eiji

PY - 1996/1/1

Y1 - 1996/1/1

N2 - Transformability is a property of a digital signature such that one valid signature can be transformed into another valid signature of the same signature scheme. Usually digital signatures should not be forged so that the transformability is regarded as an unfavorable property. Contrarily we show that the transformability can be positively utilized for solving the oracle problem. The oracle problem is the following problem existing in some cryptographic protocols. An entity following a protocol receives a message from an adversary, and returns a certain value computed by a procedure specified in the protocol. In this process the adversary may obtain useful information by interacting with the oracle entity. The blind signature scheme and the blind decoding scheme are examples of such a protocol. Since these blinding techniques are very important in cryptographic applications, e.g. electronic money and digital pay magazine, a method to prevent illegal information leakage should be found. In this paper an oracle problem in the blind decoding scheme based on the ElGamal cryptosystem is solved with the use of a transformable digital signature. As in the original blind decoding scheme, the proposed blind decoding protocol offers users perfect untraceability. We also discuss the relevance of the transformable signature to the blind signature, the divertible zeroknowledge interactive proof and other schemes.

AB - Transformability is a property of a digital signature such that one valid signature can be transformed into another valid signature of the same signature scheme. Usually digital signatures should not be forged so that the transformability is regarded as an unfavorable property. Contrarily we show that the transformability can be positively utilized for solving the oracle problem. The oracle problem is the following problem existing in some cryptographic protocols. An entity following a protocol receives a message from an adversary, and returns a certain value computed by a procedure specified in the protocol. In this process the adversary may obtain useful information by interacting with the oracle entity. The blind signature scheme and the blind decoding scheme are examples of such a protocol. Since these blinding techniques are very important in cryptographic applications, e.g. electronic money and digital pay magazine, a method to prevent illegal information leakage should be found. In this paper an oracle problem in the blind decoding scheme based on the ElGamal cryptosystem is solved with the use of a transformable digital signature. As in the original blind decoding scheme, the proposed blind decoding protocol offers users perfect untraceability. We also discuss the relevance of the transformable signature to the blind signature, the divertible zeroknowledge interactive proof and other schemes.

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

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

M3 - Conference contribution

AN - SCOPUS:84955591749

SN - 9783540618720

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 322

EP - 333

BT - Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings

A2 - Kim, Kwangjo

A2 - Matsumoto, Tsutomu

PB - Springer Verlag

ER -