Full Text:
<2362>
CLC number: TP393.08
On-line Access:
Received: 2002-09-10
Revision Accepted: 2003-01-02
Crosschecked: 0000-00-00
Cited: 1
Clicked: 4463
Distributed certification application via a trusted dealer
| |||||||||||||
LIU Duan-yang, PAN Xue-zeng, PING Ling-di. Distributed certification application via a trusted dealer[J]. Journal of Zhejiang University Science A, 2003, 4(5): 555-559.
@article{title="Distributed certification application via a trusted dealer",
author="LIU Duan-yang, PAN Xue-zeng, PING Ling-di",
journal="Journal of Zhejiang University Science A",
volume="4",
number="5",
pages="555-559",
year="2003",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2003.0555"
}
%0 Journal Article
%T Distributed certification application via a trusted dealer
%A LIU Duan-yang
%A PAN Xue-zeng
%A PING Ling-di
%J Journal of Zhejiang University SCIENCE A
%V 4
%N 5
%P 555-559
%@ 1869-1951
%D 2003
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2003.0555
TY - JOUR
T1 - Distributed certification application via a trusted dealer
A1 - LIU Duan-yang
A1 - PAN Xue-zeng
A1 - PING Ling-di
J0 - Journal of Zhejiang University Science A
VL - 4
IS - 5
SP - 555
EP - 559
%@ 1869-1951
Y1 - 2003
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2003.0555
Abstract: distributed certification via threshold cryptography is much more secure than other ways to protect certification authority (CA)'s private key, and can tolerate some intrusions. As the original system such as ITTC, etc., is unsafe, inefficient and impracitcal in actual network environment, this paper brings up a new distributed certification scheme, which although it generates key shares concentratively, it updates key shares distributedly, and so, avoids single-point failure like ITTC. It not only enhances robustness with Feldman verification and SSL protocol, but can also change the threshold (t,k) flexibly and robustly, and so, is much more practical. In this work, the authors implement the prototype system of the new scheme and test and analyze its performance.
[1]Boneh, D. and Franklin, M., 1997, Efficient Generation of Shared RSA Keys. In: Proceedings Crypto'97, Springer Press, California, p.425-439.
[2]Feldman, P., 1987. A Practical Scheme for Noninteractive Verifiable Secret Sharing. In: Proceedings of the 28th Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, p. 427-437.
[3]Frankel,Y., MacKenzie, P. D. and Yung, M.,1998. Robust Efficient Distributed RSA-Key Generation. In: Proceeding of the thirtieth Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, p.663-672.
[4]Malkin, M., Wu, T. and Boneh, D., 1999. Experimenting with Shared RSA Key Generation. In: Proceedings of the Internet Society's 1999 Symposium on Network and Distributed System Security (SNDSS), Springer Press, California, p. 43-56.
[5]Malkin, M.,Wu, T. and Boneh, D., 2000. Building Intrusion Tolerant Applications. In: Proceeding of DARPA Information Survivability Conference and Exposition, IEEE Computer Society Press, New York, 1:74-87.
[6]Open Security Socket Layer (OpenSSL), 2001. Available at http://www.open-ssl.org/
[7]Public Key Cryptography Standard (PKCS), 2001. Available at http://www.rsa-security.com/rsalabs/pkcs/
[8]Shamir, A.,1979. How to share a secret. Communications of ACM, 22(11):612-613.
[9]Request For Comment 2459 (RFC 2459), 2002. Available at http://www.ietf.org/rfc/
Open peer comments: Debate/Discuss/Question/Opinion
<1>