Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Keisuke Usuda

dblp:59/418 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 61% Cryptographic protocols and secure computation · 30% Authentication and access control · 9%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.011996
Proxy Signatures for Delegating Signing Operation · CCS 1996
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
proxy signature
0.011996
Proxy Signatures for Delegating Signing Operation · CCS 1996

Methods — techniques the papers use, named apart from their topics

discrete logarithm problem · 0.0
YearPublicationVenuePosition
1996 Proxy Signatures for Delegating Signing Operation
abstract
In this paper a new type of digital proxy signature is proposed.The proxy signature allows a designated person, called a proxy signer, to sign on behalf of an original signer.Classification of the proxy signatures is shown from the point of view of the degree of delegation, and conditions of a proposed proxy signature for partial delegation are clarified.The proposed proxy signature scheme is based on the discrete logarithm problem.Compared to the consecutive execution of the ordinary digital signature schemes, it has a direct form, and a verifier does not need a public key of a user other than the original signer in the verification stage.Moreover, it requires less amount of computational work than the consecutive execution of the signature schemes.Due to this efficiency together with the delegation property, an organization, e.g. a software company, can very efficiently create many signatures of its own by delegating its signing operations to multiple employees.Another attractive feature of the proposed schemes is their highapplicability to other ordinary signature schemes based on the discrete logarithm problem.For instance, designated confirmer proxy signatures can be constructed.Furthermore, using a proposed on-line proxy updating protocol, the original signer can revoke proxies of dishonest proxy signers.
Masahiro Mambo, Keisuke Usuda, Eiji Okamoto
CCS2