1-out-of-n oblivious signatures

Authors:
Raylin Tso;Takeshi Okamoto;Eiji Okamoto
Affiliations:
Department of Computer Science, National Chengchi University, Taipei City, Taiwan;Department of Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan;Department of Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan
Venue:
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Year:
2008

Citing 6
Cited 0

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Oblivious Signatures

ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Security of Blind Digital Signatures (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters

IEEE Transactions on Computers
Security proofs for signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.01

Visualization

Abstract

An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out on which key (or message) the recipient has got the signature. This kind of signature is firstly introduced by L. Chen in 1994. However, the previous reference does not crisply formalize the notion. Furthermore, the proposed constructions are less efficient in both communication and computation. In this paper, we first give formal definitions on the model of oblivious signatures. Then, based on the Schnorr signature, we propose our efficient oblivious signature scheme. A comparison result is also provided in this paper which shows that our scheme is more efficient than Chen's schemes and those using a combination of a signature scheme and an oblivious transfer protocol.