A digital multisignature scheme using bijective public-key cryptosystems
The problem of multiple signatures in electronic data systems originated in the paper world, where even routine and ordinary correspondence requires various forms of computer-signatures and approval signatures (for example, look at the title pages of most technical or engineering reports produced by large corporations). Electronic documents requires such signatures to the same extent. From earlier work (cited in the paper) the author provides a general scheme for multiple electronic signatures that increases the message length by the length of the ciphertext of each added signature. The author then describes and analyzes a scheme in which the length in bits of a multisigned document is increased only by the length of a single signature, plus one bit for each additional signature, plus one bit for each additional signatory. Previous schemes increased the total message length by the length of a single signature times the number of signatories. The paper includes an example of the process using the RSA algorithm; Okamoto claims, however, that any bijective ciphering scheme is equally applicable. Proofs of the security properties of the proposed scheme are also presented. This carefully written paper is an excellent model of what technical papers should be. I recommend it to everyone working in the field of office automation (for the application) as well as to those working in public key cryptology. It is a nice, well-written piece of work.
- A practical anonymous multi-authority e-cash scheme.
- An XML multisignature scheme.
- Threshold verification scheme to a valid-signature using identity only on specialized approval
- A practical anonymous payment scheme for electronic commerce
- Non-interactive multisignatures in the plain public-key model with efficient verification
- Two-party adaptor signatures from identification schemes
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Convertible multi-authenticated encryption scheme
- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
- Secure order-specified multisignature scheme based on DSA
- (t,n) Threshold-multisignature scheme and generalized-multisignature scheme where suspected forgery implies traceability of adversarial shareholders
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- A method for obtaining digital signatures and public-key cryptosystems
- A digital signature with multiple subliminal channels and its applications
- Threshold and multi-signature schemes from linear hash functions
- Locally verifiable signature and key aggregation
- Blind threshold signatures based on discrete logarithm
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
This page was built for publication: A digital multisignature scheme using bijective public-key cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4365526)
