메뉴 건너뛰기




Volumn , Issue , 2004, Pages

Authentication and Integrity in Outsourced Databases

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INFORMATION MANAGEMENT; INTERNET SERVICE PROVIDERS; NETWORK SECURITY; QUERY PROCESSING;

EID: 24944520998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (100)

References (22)
  • 1
    • 35248835575 scopus 로고    scopus 로고
    • Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
    • (E. Biham, ed), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany
    • D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps,” in Advances in Cryptology – EUROCRYPT’2003 (E. Biham, ed.), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 2003.
    • (2003) Advances in Cryptology – EUROCRYPT’2003
    • Boneh, D.1    Gentry, C.2    Lynn, B.3    Shacham, H.4
  • 4
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystems
    • Feb
    • R. L. Rivest, A. Shamir, and L. M. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, pp. 120–126, Feb. 1978.
    • (1978) Communications of the ACM , vol.21 , pp. 120-126
    • Rivest, R. L.1    Shamir, A.2    Adleman, L. M.3
  • 5
    • 11744310046 scopus 로고    scopus 로고
    • Batch verifying rsa signatures
    • Apr
    • L. Harn, “Batch verifying rsa signatures,” Electronic Letters, vol. 34, pp. 1219–1220, Apr 1998.
    • (1998) Electronic Letters , vol.34 , pp. 1219-1220
    • Harn, L.1
  • 6
    • 5744224341 scopus 로고    scopus 로고
    • Fast batch verification for modular exponentiation and digital signatures
    • M. Bellare, J. Garay, and T. Rabin, “Fast batch verification for modular exponentiation and digital signatures,” in Euro-crypt 1998, vol. 1403, pp. 191–204, 1998.
    • (1998) Euro-crypt 1998 , vol.1403 , pp. 191-204
    • Bellare, M.1    Garay, J.2    Rabin, T.3
  • 7
    • 0029342134 scopus 로고
    • Improved Digital Signature Suitable for Batch Verification
    • July
    • S. Yen and C. Laih, “Improved Digital Signature Suitable for Batch Verification,” IEEE Transactions on Computers, vol. 44, pp. 957–959, July 1995.
    • (1995) IEEE Transactions on Computers , vol.44 , pp. 957-959
    • Yen, S.1    Laih, C.2
  • 8
    • 0027726717 scopus 로고
    • Random oracles are practical: a paradigm for designing efficient protocols
    • M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” in ACM Press, pp. 62–73, 1993.
    • (1993) ACM Press , pp. 62-73
    • Bellare, M.1    Rogaway, P.2
  • 9
    • 0038087188 scopus 로고    scopus 로고
    • Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups
    • Report 2001/003
    • A. Joux and K. Nguyen, “Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups,” in Cryptology ePring Archive, no. Report 2001/003, 2001.
    • (2001) Cryptology ePring Archive
    • Joux, A.1    Nguyen, K.2
  • 10
    • 0041863206 scopus 로고
    • Can DSA be improved: complexity trade-offs with the Digital Signature Standard
    • International Association for Cryptologic Research, Springer-Verlag, Berlin Germany
    • D. Naccache, D. M’Raïhi, D. Raphaeli, and S. Vaudenay, “Can DSA be improved: complexity trade-offs with the Digital Signature Standard,” in Advances in Cryptology – EUROCRYPT’94, Lecture Notes in Computer Science, pp. 85–94, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1994.
    • (1994) Advances in Cryptology – EUROCRYPT’94, Lecture Notes in Computer Science , pp. 85-94
    • Naccache, D.1    M’Raïhi, D.2    Raphaeli, D.3    Vaudenay, S.4
  • 11
    • 0029254027 scopus 로고
    • DSA-type Secure Interactive Batch Verification Protocols
    • Feb
    • L. Harn, “DSA-type Secure Interactive Batch Verification Protocols,” Electronic Letters, vol. 31, pp. 257–258, Feb. 1995.
    • (1995) Electronic Letters , vol.31 , pp. 257-258
    • Harn, L.1
  • 12
    • 0032051077 scopus 로고    scopus 로고
    • Batch Verifying Multiple DSA-type Digital Signatures
    • Apr
    • L. Harn, “Batch Verifying Multiple DSA-type Digital Signatures,” Electronic Letters, vol. 34, pp. 870–871, Apr. 1998.
    • (1998) Electronic Letters , vol.34 , pp. 870-871
    • Harn, L.1
  • 13
    • 84937411766 scopus 로고    scopus 로고
    • Attacking and repairing batch verification schemes
    • C. Boyd and C. Pavlovski, “Attacking and repairing batch verification schemes,” in Asiacrypt 2000, pp. 58–71, 2000.
    • (2000) Asiacrypt 2000 , pp. 58-71
    • Boyd, C.1    Pavlovski, C.2
  • 15
    • 84857946222 scopus 로고    scopus 로고
    • Providing Authentication and Integrity in Outsourced Databases using Merkle Hash Trees
    • E. Mykletun, M. Narasimha, and G. Tsudik, “Providing Authentication and Integrity in Outsourced Databases using Merkle Hash Trees.” UCI-SCONCE Technical Report, 2003. http://sconce.ics.uci.edu/das/MerkleODB.pdf.
    • (2003) UCI-SCONCE Technical Report
    • Mykletun, E.1    Narasimha, M.2    Tsudik, G.3
  • 16
    • 85180543409 scopus 로고    scopus 로고
    • OpenSSL Project
    • OpenSSL Project, available from, http://www.openssl.org.
  • 21
    • 33745785145 scopus 로고    scopus 로고
    • Secure Indexes for Efficient Searching on Encrypted Compressed Data
    • Report 2003/216
    • E.-J. Goh, “Secure Indexes for Efficient Searching on Encrypted Compressed Data.” Cryptology ePrint Archive, Report 2003/216, 2003. http://eprint.iacr.org/2003/216/.
    • (2003) Cryptology ePrint Archive
    • Goh, E.-J.1


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