TY - GEN

T1 - Identity-embedding method for decentralized public-key infrastructure

AU - Anada, Hiroaki

AU - Kawamoto, Junpei

AU - Weng, Jian

AU - Sakurai, Kouichi

N1 - Funding Information:
The first, second and forth authors were partially supported by the Bilateral Joint Research Projects/Seminars FY2014 by Japan Society for the Promotion of Science under the research project name “Computational Aspects of Mathematical Design and Analysis of Secure Communication Systems Based on Cryptographic Primitives”, who appreciate sincere thanks for discussion with Sushmita Ruj in Indian Statistical Institute and Avishek Adhikari in University of Calcutta.
Funding Information:
The third author was partially supported by the Invitation Programs for Foreign-based Researchers provided by the National Institute of Information and Communications Technology (NICT), Japan.
Publisher Copyright:
© Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - A public key infrastructure (PKI) is for facilitating the authentication and distribution of public keys. Currently, the most commonly employed approach to PKI is to rely on certificate authorities (CAs), but recently there has been arising more need for decentralized peer-to-peer certification like Webs of Trust. In this paper, we propose an identity-embedding method suitable for decentralized PKI. By embed- ding not only ID of the candidate public-key owner itself but also IDs of his guarantors into PK, we can construct Web of guarantors on public keys. Here guarantors can be chosen arbitrarily by the candidate public- key owner. Our embedding method uses a combination of two public-key cryptosystems; the first cryptosystem is for PKI directly. Here we employ a technique to embed a string into a public key of the first cryptosystem. As such a string, we choose a concatenation of ID of a candidate public-key owner, IDs of his guarantors, and a public key of the second cryptosystem. This embedded public key of the second cryptosystem is used by the candidate public-key owner that he certainly knows the secret key that corresponds to the public key of the first cryptosystem. Then, with an aid of a broadcast mechanism of an updated public-key list on a peer-to-peer network, we can attain the decentralized PKI. Such an embedding method is concretely realized by the RSA encryption with the Lenstra’s algorithm, which can be used as the first cryptosystem. As the second cryptosystem, we employ an elliptic curve encryption whose security is equivalent to the security of the RSA encryption, where the former achieves shorter key size than the latter. We write down concrete values of parameters for a realization of the embedding.

AB - A public key infrastructure (PKI) is for facilitating the authentication and distribution of public keys. Currently, the most commonly employed approach to PKI is to rely on certificate authorities (CAs), but recently there has been arising more need for decentralized peer-to-peer certification like Webs of Trust. In this paper, we propose an identity-embedding method suitable for decentralized PKI. By embed- ding not only ID of the candidate public-key owner itself but also IDs of his guarantors into PK, we can construct Web of guarantors on public keys. Here guarantors can be chosen arbitrarily by the candidate public- key owner. Our embedding method uses a combination of two public-key cryptosystems; the first cryptosystem is for PKI directly. Here we employ a technique to embed a string into a public key of the first cryptosystem. As such a string, we choose a concatenation of ID of a candidate public-key owner, IDs of his guarantors, and a public key of the second cryptosystem. This embedded public key of the second cryptosystem is used by the candidate public-key owner that he certainly knows the secret key that corresponds to the public key of the first cryptosystem. Then, with an aid of a broadcast mechanism of an updated public-key list on a peer-to-peer network, we can attain the decentralized PKI. Such an embedding method is concretely realized by the RSA encryption with the Lenstra’s algorithm, which can be used as the first cryptosystem. As the second cryptosystem, we employ an elliptic curve encryption whose security is equivalent to the security of the RSA encryption, where the former achieves shorter key size than the latter. We write down concrete values of parameters for a realization of the embedding.

UR - http://www.scopus.com/inward/record.url?scp=84958055950&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958055950&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-27998-5_1

DO - 10.1007/978-3-319-27998-5_1

M3 - Conference contribution

AN - SCOPUS:84958055950

SN - 9783319279978

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 14

BT - Trusted Systems - 6th International Conference, INTRUST 2014, Revised Selected Papers

A2 - Yung, Moti

A2 - Zhu, Liehuang

A2 - Yang, Yanjiang

PB - Springer Verlag

T2 - 6th International Conference on Trusted Systems, INTRUST 2014

Y2 - 16 December 2014 through 17 December 2014

ER -