메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 391-398

Digital signatures for modifiable collections

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA REDUCTION; PROBLEM SOLVING;

EID: 33750960835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2006.53     Document Type: Conference Paper
Times cited : (4)

References (21)
  • 2
    • 33750965974 scopus 로고    scopus 로고
    • Data privacy
    • R. Agrawal. Data privacy. In LNCS, volume 3202, 2004.
    • (2004) LNCS , vol.3202
    • Agrawal, R.1
  • 3
    • 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 CCS, 1993.
    • (1993) CCS
    • Bellare, M.1    Rogaway, P.2
  • 4
    • 84947906522 scopus 로고    scopus 로고
    • The exact security of digital signatures - How to sign with RSA and Rabin
    • M. Bellare and P. Rogaway. The exact security of digital signatures - how to sign with RSA and Rabin. In LNCS, 1996.
    • (1996) LNCS
    • Bellare, M.1    Rogaway, P.2
  • 7
    • 0003337018 scopus 로고    scopus 로고
    • The TLS protocol
    • T. Dierks and C. Allen. The TLS protocol. RFC 2246. 1999.
    • (1999) RFC , vol.2246
    • Dierks, T.1    Allen, C.2
  • 8
    • 33745440084 scopus 로고
    • Zero knowledge proofs of identity
    • U. Fiege, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. In STOC, 1987.
    • (1987) STOC
    • Fiege, U.1    Fiat, A.2    Shamir, A.3
  • 10
    • 84860028410 scopus 로고    scopus 로고
    • The GNU MP Bignum library
    • The GNU MP Bignum library, http://www.swox.com/gmp/.
  • 12
    • 0037519332 scopus 로고    scopus 로고
    • Practical and provably-secure commitment schemes from collision-free hashing
    • S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. LNCS, 1996.
    • (1996) LNCS
    • Halevi, S.1    Micali, S.2
  • 14
    • 2342648374 scopus 로고    scopus 로고
    • Transitive signature schemes
    • S. Micali and R. Rivest. Transitive signature schemes. In CT-RSA, 2002.
    • (2002) CT-RSA
    • Micali, S.1    Rivest, R.2
  • 16
    • 33750932025 scopus 로고    scopus 로고
    • Modeling integrity in data exchange
    • G. Miklau and D. Suciu. Modeling integrity in data exchange. In SDM, 2004.
    • (2004) SDM
    • Miklau, G.1    Suciu, D.2
  • 17
    • 85009120801 scopus 로고    scopus 로고
    • Controlling access to published data using cryptography
    • Gerome Miklau and Dan Suciu. Controlling access to published data using cryptography. In VLDB, 2003.
    • (2003) VLDB
    • Miklau, G.1    Suciu, D.2
  • 18
    • 26444616850 scopus 로고    scopus 로고
    • Efficient consistency proofs for generalized queries on a committed database
    • R. Ostrovsky, C. Rackoff, and A. Smith. Efficient consistency proofs for generalized queries on a committed database. In ICALP, 2004.
    • (2004) ICALP
    • Ostrovsky, R.1    Rackoff, C.2    Smith, A.3
  • 20
    • 0033309271 scopus 로고    scopus 로고
    • Non-interactive cryptocomputing for NC 1
    • T. Sander, A. Young, and M. Yung. Non-interactive cryptocomputing for NC 1. In FOCS, 1999.
    • (1999) FOCS
    • Sander, T.1    Young, A.2    Yung, M.3


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