메뉴 건너뛰기




Volumn , Issue , 2010, Pages 609-620

How to authenticate graphs without leaking

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE SIGNATURE; AUTHENTICATION OF DATA; DATA ORGANIZATION; DEPTH FIRST; DIGITAL SIGNATURE SCHEMES; DIRECTED CYCLIC GRAPHS; DIRECTED GRAPHS; SECURE DATA; SECURITY PROPERTIES; SENSITIVE INFORMATIONS;

EID: 77952285841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739114     Document Type: Conference Paper
Times cited : (24)

References (34)
  • 1
    • 52649108083 scopus 로고    scopus 로고
    • Efficient data authentication in an environment of untrusted third-party distributors
    • M. Atallah, Y. Cho, and A. Kundu. Efficient data authentication in an environment of untrusted third-party distributors. In ICDE, 2008.
    • (2008) ICDE
    • Atallah, M.1    Cho, Y.2    Kundu, A.3
  • 2
    • 31644434085 scopus 로고    scopus 로고
    • Cryptanalysis and improvement on batch verifying multiple rsa digital signatures
    • F. Bao, C.-C. Lee, and M.-S. Hwang. Cryptanalysis and improvement on batch verifying multiple rsa digital signatures. Applied Mathematics and Computation, 172(2), 2006.
    • (2006) Applied Mathematics and Computation , vol.172 , pp. 2
    • Bao, F.1    Lee, C.-C.2    Hwang, M.-S.3
  • 3
    • 5744224341 scopus 로고    scopus 로고
    • Fast batch verification for modular exponentiation and digital signatures
    • M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In EUROCRYPT, 1998.
    • (1998) Eurocrypt
    • Bellare, M.1    Garay, J.A.2    Rabin, T.3
  • 4
    • 77952286337 scopus 로고    scopus 로고
    • Secure knowledge management: Confidentiality, trust, and privacy
    • May
    • E. Bertino, L. Khan, R. Sandhu, and B. Thuraisingham. Secure knowledge management: confidentiality, trust, and privacy. IEEE SMC-A, May '06.
    • (2006) IEEE SMC-A
    • Bertino, E.1    Khan, L.2    Sandhu, R.3    Thuraisingham, B.4
  • 6
    • 21144441197 scopus 로고    scopus 로고
    • Aggregate and verifiably encrypted signatures from bilinear maps
    • D. Boneh, C. Gentry, H. Shacham, and B. Lynn. Aggregate and verifiably encrypted signatures from bilinear maps. In Eurocrypt, 2003.
    • (2003) Eurocrypt
    • Boneh, D.1    Gentry, C.2    Shacham, H.3    Lynn, B.4
  • 7
    • 38049031137 scopus 로고    scopus 로고
    • Knowledge-binding commitments with applications in time-stamping
    • A. Buldas and S. Laur. Knowledge-binding commitments with applications in time-stamping. In Public Key Cryptography, pages 150-165, 2007.
    • (2007) Public Key Cryptography , pp. 150-165
    • Buldas, A.1    Laur, S.2
  • 13
    • 84885379626 scopus 로고    scopus 로고
    • Efficient authenticated data structures for graph connectivity and geometric search problems
    • volume Online
    • M. T. Goodrich, R. Tamassia, and N. Triandopoulos. Efficient authenticated data structures for graph connectivity and geometric search problems. In Algorithmica, volume Online, 2009.
    • (2009) Algorithmica
    • Goodrich, M.T.1    Tamassia, R.2    Triandopoulos, N.3
  • 14
    • 35248831605 scopus 로고    scopus 로고
    • Authenticated data structures for graph and geometric searching
    • M. T. Goodrich, R. Tamassia, N. Triandopoulos, and R. Cohen. Authenticated data structures for graph and geometric searching. In LNCS, volume 2612, 2003.
    • (2003) LNCS , vol.2612
    • Goodrich, M.T.1    Tamassia, R.2    Triandopoulos, N.3    Cohen, R.4
  • 15
    • 11744310046 scopus 로고    scopus 로고
    • Batch verifying multiple rsa digital signatures
    • L. Harn. Batch verifying multiple rsa digital signatures. Electronics Letters, 34(12), 1998.
    • (1998) Electronics Letters , vol.34 , Issue.12
    • Harn, L.1
  • 17
    • 0038564821 scopus 로고    scopus 로고
    • Cryptanalysis of the batch verifying multiple rsa digital signatures
    • M.-S. Hwang, I.-C. Lin, and K.-F. Hwang. Cryptanalysis of the batch verifying multiple rsa digital signatures. Informatica, 11(1), 2000.
    • (2000) Informatica , vol.11 , Issue.1
    • Hwang, M.-S.1    Lin, I.-C.2    Hwang, K.-F.3
  • 18
    • 57149132520 scopus 로고    scopus 로고
    • Efficiently answering reachability queries on very large directed graphs
    • R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Jin, R.1    Xiang, Y.2    Ruan, N.3    Wang, H.4
  • 21
    • 70449395944 scopus 로고    scopus 로고
    • Structural signatures for tree data structures
    • A. Kundu and E. Bertino. Structural signatures for tree data structures. In VLDB, 2008.
    • (2008) VLDB
    • Kundu, A.1    Bertino, E.2
  • 22
    • 34250630995 scopus 로고    scopus 로고
    • Dynamic authenticated index structures for outsourced databases
    • New York, NY, USA, ACM
    • F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin. Dynamic authenticated index structures for outsourced databases. In SIGMOD, pages 121-132, New York, NY, USA, 2006. ACM.
    • (2006) SIGMOD , pp. 121-132
    • Li, F.1    Hadjieleftheriou, M.2    Kollios, G.3    Reyzin, L.4
  • 23
    • 57149126815 scopus 로고    scopus 로고
    • Towards identity anonymization on graphs
    • K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Liu, K.1    Terzi, E.2
  • 26
    • 0001263548 scopus 로고
    • A certified digital signature
    • R. C. Merkle. A certified digital signature. In CRYPTO, 1989.
    • (1989) Crypto
    • Merkle, R.C.1
  • 27
    • 58149462240 scopus 로고    scopus 로고
    • Partially materialized digest scheme: An efficient verification method for outsourced databases
    • K. Mouratidis, D. Sacharidis, and H. Pang. Partially materialized digest scheme: an efficient verification method for outsourced databases. The VLDB Journal, 18(1):363-381, 2009.
    • (2009) The VLDB Journal , vol.18 , Issue.1 , pp. 363-381
    • Mouratidis, K.1    Sacharidis, D.2    Pang, H.3
  • 28
    • 29844457793 scopus 로고    scopus 로고
    • Verifying completeness of relational query results in data publishing
    • H. Pang, A. Jain, K. Ramamritham, and K.-L. Tan. Verifying completeness of relational query results in data publishing. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Pang, H.1    Jain, A.2    Ramamritham, K.3    Tan, K.-L.4
  • 29
    • 76849102606 scopus 로고    scopus 로고
    • Authenticating the query results of text search engines
    • H. Pang and K. Mouratidis. Authenticating the query results of text search engines. PVLDB, 1(1), 2008.
    • (2008) PVLDB , vol.1 , Issue.1
    • Pang, H.1    Mouratidis, K.2
  • 30
    • 2442590644 scopus 로고    scopus 로고
    • Authenticating query results in edge computing
    • H. Pang and K. Tan. Authenticating query results in edge computing. In ICDE, 2004.
    • (2004) ICDE
    • Pang, H.1    Tan, K.2
  • 32
    • 36849093960 scopus 로고    scopus 로고
    • Fast direction-aware proximity for graph mining
    • H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD, 2007.
    • (2007) KDD
    • Tong, H.1    Faloutsos, C.2    Koren, Y.3
  • 33
    • 84893821498 scopus 로고    scopus 로고
    • Efficient secure query evaluation over encrypted XML databases
    • H. Wang and L. V. S. Lakshmanan. Efficient secure query evaluation over encrypted XML databases. In VLDB, 2006.
    • (2006) VLDB
    • Wang, H.1    Lakshmanan, L.V.S.2
  • 34
    • 67650219221 scopus 로고    scopus 로고
    • Preserving the privacy of sensitive relationships in graph data
    • E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In PinKDD, 2007.
    • (2007) PinKDD
    • Zheleva, E.1    Getoor, L.2


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