메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 386-392

Revocation invocation for accountable anonymous PKI certificate trees

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC COMMERCE; NETWORK PROTOCOLS; ONLINE SYSTEMS; REAL TIME SYSTEMS; SECURITY OF DATA; TREES (MATHEMATICS);

EID: 10844241569     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (30)
  • 2
    • 0034471216 scopus 로고    scopus 로고
    • Anonymous public-key certificates for anonymous and fair document exchange
    • N. Zhang, Q. Shi and M. Merabti, "Anonymous public-key certificates for anonymous and fair document exchange", IEE Proceedings in Communications, 2000, 147(6), 345-350.
    • (2000) IEE Proceedings in Communications , vol.147 , Issue.6 , pp. 345-350
    • Zhang, N.1    Shi, Q.2    Merabti, M.3
  • 3
    • 84958056811 scopus 로고    scopus 로고
    • Revocation: Options and challenges
    • Michael Myers, "Revocation: Options and Challenges", FC'98, LNCS 1465, 1998, pp. 165-171.
    • (1998) FC'98, LNCS , vol.1465 , pp. 165-171
    • Myers, M.1
  • 4
    • 3242880752 scopus 로고    scopus 로고
    • Digital certificates: A survey of revocation methods
    • Los Angeles, California, United States
    • Petra Wohlmacher, "Digital Certificates: A Survey of Revocation Methods", Proceedings of the 2000 ACM Workshops on Multimedia 2000, Los Angeles, California, United States, 2000, pp. 111-114.
    • (2000) Proceedings of the 2000 ACM Workshops on Multimedia 2000 , pp. 111-114
    • Wohlmacher, P.1
  • 10
    • 23044519211 scopus 로고    scopus 로고
    • Distributed storage and revocation in digital certificate databases
    • J. Lopez et al., "Distributed Storage and Revocation in Digital Certificate Databases", DEXA 2000, LNCS 1873, 2000, pp. 929-938.
    • (2000) DEXA 2000, LNCS , vol.1873 , pp. 929-938
    • Lopez, J.1
  • 11
    • 84958042111 scopus 로고    scopus 로고
    • Can we eliminate certificate revocation lists?
    • R.L. Rivest, "Can We Eliminate Certificate Revocation Lists?", FC'98, LNCS 1465, 1998, pp. 178-183.
    • (1998) FC'98, LNCS , vol.1465 , pp. 178-183
    • Rivest, R.L.1
  • 12
    • 84949191488 scopus 로고    scopus 로고
    • Nonmonotonicity, user interfaces, and risk assessment in certificate revocation (position paper)
    • N. Li and J. Feigenbaum, "Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation (Position Paper)", FC 2001, LNCS 2339, 2002, pp. 166-177.
    • (2002) FC 2001, LNCS , vol.2339 , pp. 166-177
    • Li, N.1    Feigenbaum, J.2
  • 13
    • 23044531736 scopus 로고    scopus 로고
    • Key revocation with interval cover families
    • J. Blomer and A. May, "Key Revocation with Interval Cover Families", SAC 2001, LNCS 2259, 2001, pp. 325-341.
    • (2001) SAC 2001, LNCS , vol.2259 , pp. 325-341
    • Blomer, J.1    May, A.2
  • 14
    • 84957678021 scopus 로고    scopus 로고
    • Fast digital identity revocation
    • W. Aiello, S. Lodha and R. Ostrovsky, "Fast Digital Identity Revocation", CRYPTO'98, LNCS 1462, 1998, pp. 137-153.
    • (1998) CRYPTO'98, LNCS , vol.1462 , pp. 137-153
    • Aiello, W.1    Lodha, S.2    Ostrovsky, R.3
  • 15
    • 84958063551 scopus 로고    scopus 로고
    • On certificate revocation and validation
    • P.C. Kocher, "On Certificate Revocation and Validation", FC'98, LNCS 1465, 1998, pp. 172-177
    • (1998) FC'98, LNCS , vol.1465 , pp. 172-177
    • Kocher, P.C.1
  • 17
    • 22844454009 scopus 로고    scopus 로고
    • Performance evaluation of certificate revocation using k-valued hash tree
    • H. Kikuchi, K. Abe and S. Nakanishi, "Performance Evaluation of Certificate Revocation Using k-Valued Hash Tree", ISW'99, LNCS 1729, 1999, pp. 103-117.
    • (1999) ISW'99, LNCS , vol.1729 , pp. 103-117
    • Kikuchi, H.1    Abe, K.2    Nakanishi, S.3
  • 24
    • 84945135810 scopus 로고    scopus 로고
    • Efficient non-transfereable anonymous multi-show credential system with optional anonymity revocation
    • Jan Camenisch and Anna Lysyanskaya, "Efficient non-transfereable anonymous multi-show credential system with optional anonymity revocation, " EUROCRYPT 2001, LNCS 2045, 2001, pp. 93-118.
    • (2001) EUROCRYPT 2001, LNCS , vol.2045 , pp. 93-118
    • Camenisch, J.1    Lysyanskaya, A.2
  • 25
    • 84937428748 scopus 로고    scopus 로고
    • Accumulators and application to efficient revocation of anonymous credentials
    • Jan Camenisch and Anna Lysyanskaya, "Accumulators and Application to Efficient Revocation of Anonymous Credentials", CRYPTO 2002, LNCS 2442, 2002, pp. 61-76.
    • (2002) CRYPTO 2002, LNCS , vol.2442 , pp. 61-76
    • Camenisch, J.1    Lysyanskaya, A.2
  • 28
    • 0022145479 scopus 로고
    • Security without identification: Transaction systems to make big brother obsolete
    • David Chaum, "Security without identification: Transaction systems to make big brother obsolete", Communications of the ACM, 1985, 28(10), 1030-1044.
    • (1985) Communications of the ACM , vol.28 , Issue.10 , pp. 1030-1044
    • Chaum, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.