메뉴 건너뛰기




Volumn 2612, Issue , 2003, Pages 295-313

Authenticated data structures for graph and geometric searching

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; NETWORK MANAGEMENT; QUERY PROCESSING;

EID: 35248831605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_20     Document Type: Article
Times cited : (47)

References (39)
  • 1
    • 21044449695 scopus 로고    scopus 로고
    • Persistent authenticated dictionaries and their applications
    • Proc. Information Security Conference (ISC 2001), Springer-Verlag
    • A. Anagnostopoulos, M. T. Goodrich, and R. Tamassia. Persistent authenticated dictionaries and their applications. In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS, pages 379-393. Springer-Verlag, 2001.
    • (2001) LNCS , vol.2200 , pp. 379-393
    • Anagnostopoulos, A.1    Goodrich, M.T.2    Tamassia, R.3
  • 4
    • 0029214558 scopus 로고
    • Designing programs that check their work
    • Jan.
    • M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, Jan. 1995.
    • (1995) J. ACM , vol.42 , Issue.1 , pp. 269-291
    • Blum, M.1    Kannan, S.2
  • 9
    • 3543102859 scopus 로고    scopus 로고
    • Dynamic accumulators and application to efficient revocation of anonymous credentials
    • J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Proc. CRYPTO, 2002.
    • (2002) Proc. CRYPTO
    • Camenisch, J.1    Lysyanskaya, A.2
  • 10
    • 0023010037 scopus 로고
    • Fractional cascading: I. a data structuring technique
    • B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(3):133-162, 1986.
    • (1986) Algorithmica , vol.1 , Issue.3 , pp. 133-162
    • Chazelle, B.1    Guibas, L.J.2
  • 11
    • 0023010035 scopus 로고
    • Fractional cascading: II. Applications
    • B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163-191, 1986.
    • (1986) Algorithmica , vol.1 , pp. 163-191
    • Chazelle, B.1    Guibas, L.J.2
  • 12
    • 0348230458 scopus 로고    scopus 로고
    • Combine and conquer
    • R. F. Cohen and R. Tamassia. Combine and conquer. Algorithmica, 18:342-362, 1997.
    • (1997) Algorithmica , vol.18 , pp. 342-362
    • Cohen, R.F.1    Tamassia, R.2
  • 16
    • 84957863642 scopus 로고    scopus 로고
    • Upward planarity checking: "Faces are more than polygons"
    • S.H. Whitesides, editor, Graph Drawing (Proc. GD '98), Springer-Verlag
    • G. Di Battista and G. Liotta. Upward planarity checking: "Faces are more than polygons". In S.H. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Comput. Sci., pages 72-86. Springer-Verlag, 1998.
    • (1998) Lecture Notes Comput. Sci. , vol.1547 , pp. 72-86
    • Di Battista, G.1    Liotta, G.2
  • 17
    • 1542577522 scopus 로고    scopus 로고
    • On-line maintenance of triconnected components with SPQR-trees
    • G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15:302-318, 1996.
    • (1996) Algorithmica , vol.15 , pp. 302-318
    • Di Battista, G.1    Tamassia, R.2
  • 20
    • 84957806727 scopus 로고    scopus 로고
    • Efficient and fresh certification
    • Int. Workshop on Practice and Theory in Public Key Cryptography (PKC '2000), Springer-Verlag
    • I. Gassko, P. S. Gemmell, and P. MacKenzie. Efficient and fresh certification. In Int. Workshop on Practice and Theory in Public Key Cryptography (PKC '2000), volume 1751 of LNCS, pages 342-353. Springer-Verlag, 2000.
    • (2000) LNCS , vol.1751 , pp. 342-353
    • Gassko, I.1    Gemmell, P.S.2    MacKenzie, P.3
  • 22
    • 84945279475 scopus 로고    scopus 로고
    • An efficient dynamic and distributed cryptographic accumulator
    • Proc. Int. Security Conference (ISC 2002), Springer-Verlag
    • M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In Proc. Int. Security Conference (ISC 2002), volume 2433 of LNCS, pages 372-388. Springer-Verlag, 2002.
    • (2002) LNCS , vol.2433 , pp. 372-388
    • Goodrich, M.T.1    Tamassia, R.2    Hasic, J.3
  • 24
    • 84958043500 scopus 로고
    • A simpler minimum spanning tree verification algorithm
    • V. King. A simpler minimum spanning tree verification algorithm. In Workshop on Algorithms and Data Structures, pages 440-448, 1995.
    • (1995) Workshop on Algorithms and Data Structures , pp. 440-448
    • King, V.1
  • 25
    • 84958063551 scopus 로고    scopus 로고
    • On certificate revocation and validation
    • Proc. Int. Conf. on Financial Cryptography, Springer-Verlag
    • P. G. Kocher. On certificate revocation and validation. In Proc. Int. Conf. on Financial Cryptography, volume 1465 of LNCS. Springer-Verlag, 1998.
    • (1998) LNCS , vol.1465
    • Kocher, P.G.1
  • 31
    • 84920380941 scopus 로고
    • Protocols for public key cryptosystems
    • IEEE Computer Society Press
    • R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy, pages 122-134. IEEE Computer Society Press, 1980.
    • (1980) Proc. Symp. on Security and Privacy , pp. 122-134
    • Merkle, R.C.1
  • 32
    • 84969346266 scopus 로고
    • A certified digital signature
    • G. Brassard, editor, Proc. CRYPTO '89, Springer-Verlag
    • R. C. Merkle. A certified digital signature. In G. Brassard, editor, Proc. CRYPTO '89, volume 435 of LNCS, pages 218-238. Springer-Verlag, 1990.
    • (1990) LNCS , vol.435 , pp. 218-238
    • Merkle, R.C.1
  • 33
    • 85084162561 scopus 로고    scopus 로고
    • Certificate revocation and certificate update
    • Berkeley
    • M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. 7th USENIX Security Symposium, pages 217-228, Berkeley, 1998.
    • (1998) Proc. 7th USENIX Security Symposium , pp. 217-228
    • Naor, M.1    Nissim, K.2
  • 35
    • 0025436383 scopus 로고
    • Skip lists: A probabilistic alternative to balanced trees
    • W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
    • (1990) Commun. ACM , vol.33 , Issue.6 , pp. 668-676
    • Pugh, W.1
  • 36
    • 0020766586 scopus 로고
    • A data structure for dynamic trees
    • D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.
    • (1983) J. Comput. Syst. Sci. , vol.26 , Issue.3 , pp. 362-381
    • Sleator, D.D.1    Tarjan, R.E.2
  • 39
    • 0026626071 scopus 로고
    • Maintaining bridge-connected and biconnected components on-line
    • J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464, 1992.
    • (1992) Algorithmica , vol.7 , pp. 433-464
    • Westbrook, J.1    Tarjan, R.E.2


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