Delegation Chains Secure up to Constant Length(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we discuss how one can delegate his power to authenticate or sign documents to others who, again, can delegate the power to someone else. A practical cryptographic solution would be to issue a certificate that consists of one's signature. The final verifier checks verifies the chain of these certificates. This paper provides an efficient and provably secure scheme that is suitable for such a delegation chain. We prove the security of our scheme against an adaptive chosen message attack in the random oracle model. Though our primary application would be agent systems where some agents work on behalf of a user, some other applications and variants will be discussed as well. One of the variants enjoys a threshold feature whereby one can delegate his power to a group so that they have less chance to abuse their power. Another application is an identity-based signature scheme that provides faster verification capability and less communication complexity compared to those provided by existing certificate-based public key infrastructure.
- 社団法人電子情報通信学会の論文
- 2002-01-01
著者
-
Okamoto Tatsuaki
Ntt Information Sharing Platform Laboratories
-
Abe Masayuki
Ntt Information Sharing Platform Laboratories
関連論文
- 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
- Key Size Evaluation of Provably Secure RSA-based Encryption Schemes