메뉴 건너뛰기




Volumn 3788 LNCS, Issue , 2005, Pages 174-198

Updatable zero-knowledge databases

Author keywords

Commitments; Protocols; Transparent updates; Updatable commitments; Zero knowledge; Zero knowledge databases; Zero knowledge sets

Indexed keywords

FUNCTION EVALUATION; KNOWLEDGE BASED SYSTEMS; NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA; SET THEORY;

EID: 33646764587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_10     Document Type: Conference Paper
Times cited : (46)

References (12)
  • 2
    • 24944472287 scopus 로고    scopus 로고
    • Mercurial commitments with applications to zero-knowledge sets
    • Lecture Notes in Computer Science. Springer-Verlag, 22 - 26 May
    • Melissa Chase, Alex Healy, Anna Lysyanskaya, Tal Malkin, and Leonid Reyzin. Mercurial commitments with applications to zero-knowledge sets. In Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science. Springer-Verlag, 22 - 26 May 2005.
    • (2005) Advances in Cryptology - EUROCRYPT 2005
    • Chase, M.1    Healy, A.2    Lysyanskaya, A.3    Malkin, T.4    Reyzin, L.5
  • 3
    • 24144481228 scopus 로고    scopus 로고
    • A verifiable random function with short proofs and keys
    • Serge Vaudenay, editor, 8th International Workshop on Theory and Practice in Public Key Cryptography. Springer-Verlag
    • Yevgeniy Dodis and Aleksandr Yampolskiy. A verifiable random function with short proofs and keys. In Serge Vaudenay, editor, 8th International Workshop on Theory and Practice in Public Key Cryptography, volume 3386 of lncs, pages 416 - 432. Springer-Verlag, 2005.
    • (2005) Lncs , vol.3386 , pp. 416-432
    • Dodis, Y.1    Yampolskiy, A.2
  • 4
    • 71149116146 scopus 로고
    • Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
    • Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691 - 729, 1991.
    • (1991) Journal of the ACM , vol.38 , Issue.1 , pp. 691-729
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 5
    • 35048829983 scopus 로고    scopus 로고
    • Efficiently committing to databases
    • NEC Research Institute
    • J. Kilian. Efficiently committing to databases. TR 97-040, NEC Research Institute, 1997.
    • (1997) TR , vol.97 , Issue.40
    • Kilian, J.1
  • 6
    • 84937425161 scopus 로고    scopus 로고
    • Unique signatures and verifiable random functions from the DH-DDH separation
    • Moti Yung, editor, Lecture Notes in Computer Science. Springer-Verlag
    • Anna Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, Lecture Notes in Computer Science. Springer-Verlag, 2002.
    • (2002) Advances in Cryptology - CRYPTO 2002
    • Lysyanskaya, A.1
  • 7
    • 0001263548 scopus 로고
    • A certified digital signature
    • G. Brassard, editor, Advances in Cryptology - CRYPTO 89. Springer-Verlag, 1990, 20 - 24 August
    • Ralph C. Merkle. A certified digital signature. In G. Brassard, editor, Advances in Cryptology - CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 218238. Springer-Verlag, 1990, 20 - 24 August 1989.
    • (1989) Lecture Notes in Computer Science , vol.435 , pp. 218238
    • Merkle, R.C.1
  • 8
    • 0031347575 scopus 로고    scopus 로고
    • Hashing on strings, cryptography, and protection of privacy
    • Los Alamitos, California, 11 - 13 June. IEEE Computer Society
    • Silvio Micali and Michael Rabin. Hashing on strings, cryptography, and protection of privacy. In Proceedings of Compression and Complexity of Sequences, page 1, Los Alamitos, California, 11 - 13 June 1997. IEEE Computer Society.
    • (1997) Proceedings of Compression and Complexity of Sequences , pp. 1
    • Micali, S.1    Rabin, M.2
  • 11
    • 26444616850 scopus 로고    scopus 로고
    • Efficient proofs of consistency for generalized queries on a committed database
    • R. Ostrovsky, C. Rackoff, and A. Smith. Efficient proofs of consistency for generalized queries on a committed database. In Proceedings of ICALP 2004, 2004.
    • (2004) Proceedings of ICALP 2004
    • Ostrovsky, R.1    Rackoff, C.2    Smith, A.3
  • 12
    • 85030460443 scopus 로고
    • A threshold cryptosystem without a trusted party (extended abstract)
    • D. W. Davies, editor, Advances in Cryptology - EUROCRYPT 91. Springer-Verlag, 8 - 11 April
    • Torben Pryds Pedersen. A threshold cryptosystem without a trusted party (extended abstract). In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT 91, volume 547 of Lecture Notes in Computer Science, pages 522-526. Springer-Verlag, 8 - 11 April 1991.
    • (1991) Lecture Notes in Computer Science , vol.547 , pp. 522-526
    • Pedersen, T.P.1


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