메뉴 건너뛰기




Volumn 2939, Issue , 2004, Pages 558-569

Public watermark detection using multiple proxies and secret sharing

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; DIGITAL WATERMARKING;

EID: 35048902123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24624-4_45     Document Type: Article
Times cited : (4)

References (15)
  • 1
    • 84944404911 scopus 로고    scopus 로고
    • Zero-knowledge watermark detection and proof of ownership
    • LNCS 2137
    • A. Adelsbach and A. Sadeghi. Zero-knowledge watermark detection and proof of ownership. 4th Int. Workshop on Info. Hiding, LNCS 2137:273-288, 2000.
    • (2000) 4th Int. Workshop on Info. Hiding , pp. 273-288
    • Adelsbach, A.1    Sadeghi, A.2
  • 2
    • 84898960610 scopus 로고
    • Completeness theorems for noncryptographic fault-tolerant distributed computation
    • M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In STOC, pages 1-10, 1988.
    • (1988) STOC , pp. 1-10
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 3
    • 0022199386 scopus 로고
    • Verifiable secret sharing and achieving simultaneity in the presence of faults
    • B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In FOCS, pages 383-395, 1985.
    • (1985) FOCS , pp. 383-395
    • Chor, B.1    Goldwasser, S.2    Micali, S.3    Awerbuch, B.4
  • 6
    • 84904255553 scopus 로고    scopus 로고
    • Copyright protection protocols based on asymmetric watermarking
    • S. Craver and S. Katzenbeisser. Copyright protection protocols based on asymmetric watermarking. In CMS'01, pages 159-170, 2001.
    • (2001) CMS'01 , pp. 159-170
    • Craver, S.1    Katzenbeisser, S.2
  • 9
    • 0023538330 scopus 로고
    • A practical scheme for non-interaive verifiable secret sharing
    • P. Feldman. A practical scheme for non-interaive verifiable secret sharing. In FOCS, pages 427-437, 1987.
    • (1987) FOCS , pp. 427-437
    • Feldman, P.1
  • 10
  • 11
    • 84957626176 scopus 로고
    • Proactive secret sharing or: How to cope with perpetual leakage
    • LNCS 963
    • A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or: How to cope with perpetual leakage. CRYPTO'95, LNCS 963:339-352, 1995.
    • (1995) CRYPTO'95 , pp. 339-352
    • Herzberg, A.1    Jarecki, S.2    Krawczyk, H.3    Yung, M.4
  • 12
    • 35248861868 scopus 로고    scopus 로고
    • Efficient secure multi-party computation
    • volume LNCS 1976
    • Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient secure multi-party computation. In ASIACRYPT'00, volume LNCS 1976, pages 143-161, 2000.
    • (2000) ASIACRYPT'00 , pp. 143-161
    • Hirt, M.1    Maurer, U.2    Przydatek, B.3
  • 13
    • 35248859167 scopus 로고    scopus 로고
    • Security of public watermarking schemes for binary sequences
    • Qiming Li and Ee-Chien Chang. Security of public watermarking schemes for binary sequences. 5th Int. Workshop on Info. Hiding, pages 119-128, 2002.
    • (2002) 5th Int. Workshop on Info. Hiding , pp. 119-128
    • Li, Q.1    Chang, E.-C.2
  • 15
    • 0018545449 scopus 로고
    • How to share a secret
    • Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1


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