1-out-of-n Signatures from a Variety of Keys (Asymmetric Cipher) (<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper addresses how to use public-keys of several different signature schemes to generate 1-out-of-n signatures. Previously known constructions are for either RSA-type keys only or DL-type keys only. We present a widely applicable method to construct a 1-out-of-n signature scheme that allows mixture use of different flavors of keys at the same time. The resulting scheme is more efficient than previous schemes even if it is used only with a single type of keys. With all DL-type keys, it yields shorter signatures than the ones of the previously known scheme based on the witness indistinguishable proofs by Cramer, et al. With all RSA-type keys, it reduces both computational and storage costs compared to that of the Ring signatures by Rivest, et al.

• 社団法人電子情報通信学会の論文
• 2004-01-01

著者

• Abe Masayuki

  Ntt Information Sharing Platform Laboratories Ntt Corporation

• Ohkubo Miyako

  Ntt Information Sharing Platform Laboratories Ntt Corporation

• SUZUKl Koutarou

  NTT Information Sharing Platform Laboratories, NTT Corporation

• Abe Masayuki

  Ntt Information Sharing Platform Laboratories

• Suzukl Koutarou

  Ntt Information Sharing Platform Laboratories Ntt Corporation

関連論文

• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
• Tag-KEM from Set Partial Domain One-Way Permutations
• Flexible-Routing Anonymous Networks Using Optimal Length of Ciphertext(Application)(Cryptography and Information Security)
• 1-out-of-n Signatures from a Variety of Keys (Asymmetric Cipher) (Cryptography and Information Security)
• M+1-st Price Auction Using Homomorphic Encryption(Special Section on Cryptography and Information Security)
• Lenient/Strict Batch Verification in Several Groups(Special Section on Cryptography and Information Security)
• Delegation Chains Secure up to Constant Length(Special Section on Cryptography and Information Security)
• Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers

スポンサーリンク