scispace - formally typeset
Open AccessJournal Article

A digital multisignature scheme using bijective public-key cryptosystem

T. Okamoto
- 01 Jan 1988 - 
- Vol. 6, Iss: 8, pp 432-441
Reads0
Chats0
TLDR
It is shown that the new scheme is considered as safe as the public-key cryptosystem used in this new scheme, and some variations based on the scheme are also presented.
Abstract
A new digital multisignature scheme using bijective public-key cryptosystems that overcomes the problems of previous signature schemes used for multisignatures is proposed. The principal features of this scheme are (1) the length of a multisignature message is nearly equivalent to that for a singlesignature message; (2) by using a one-way hash function, multisignature generation and verification are processed in an efficient manner; (3) the order of signing is not restricted; and (4) this scheme can be constructed on any bijective public-key cryptosystem as well as the RSA scheme. In addition, it is shown that the new scheme is considered as safe as the public-key cryptosystem used in this new scheme. Some variations based on the scheme are also presented.

read more

Citations
More filters
Posted Content

Provable Data Possession at Untrusted Stores.

TL;DR: Ateniese et al. as discussed by the authors introduced the provable data possession (PDP) model, which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Book ChapterDOI

Aggregate and verifiably encrypted signatures from bilinear maps

TL;DR: In this article, Boneh, Lynn, and Shacham introduced the concept of an aggregate signature, presented security models for such signatures, and gave several applications for aggregate signatures.
Book ChapterDOI

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

TL;DR: It turns out that most of the constructions are simpler, more efficient and have more useful properties than similar existing constructions.
Journal ArticleDOI

Remote data checking using provable data possession

TL;DR: A model for provable data possession (PDP) that can be used for remote data checking: A client that has stored data at an untrusted server can verify that the server possesses the original data without retrieving it.
Proceedings ArticleDOI

How to share a function securely

TL;DR: The primitive of function sharing is defined, a functional analog of secret sharing, and employed to construct novel cryptosystems with improved integrity, availability and security properties and should be contrasted with the model of secure function evaluation protocols.
References
More filters
Journal ArticleDOI

New Directions in Cryptography

TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI

A method for obtaining digital signatures and public-key cryptosystems

TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.

Digitalized signatures and public-key functions as intractable as factorization

TL;DR: It is proved that for any given n, if the authors can invert the function y = E (x1) for even a small percentage of the values y then they can factor n, which seems to be the first proved result of this kind.