메뉴 건너뛰기




Volumn 1109, Issue , 1996, Pages 186-200

Proving without knowing: On oblivious, agnostic and blindfolded provers

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84955606093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_15     Document Type: Conference Paper
Times cited : (42)

References (17)
  • 2
    • 84958948483 scopus 로고    scopus 로고
    • Hiding Instances in Zero-Knowledge Proof Systems
    • D. Beaver, J. Feigenbaum and V. Slioup, "Hiding Instances in Zero-Knowledge Proof Systems," Crypto '90, pp. 326-338
    • Crypto '90 , pp. 326-338
    • Beaver, D.1    Feigenbaum, J.2    Slioup, V.3
  • 3
    • 84983104598 scopus 로고    scopus 로고
    • On Defining Proofs of Knowledge
    • M. Bellare, S. Goldreich, "On Defining Proofs of Knowledge," Crypto '92, pp. 390-420
    • Crypto '92 , pp. 390-420
    • Bellare, M.1    Goldreich, S.2
  • 5
    • 85043778396 scopus 로고    scopus 로고
    • Zero-Knowledge Undeniable Signatures
    • D. Chaum, "Zero-Knowledge Undeniable Signatures," Eurocrypt '90, pp. 458-464
    • Eurocrypt '90 , pp. 458-464
    • Chaum, D.1
  • 8
    • 84955575786 scopus 로고    scopus 로고
    • A Note on One-Prover Instance-Hiding, Zero- Knowledge Proof Systems
    • J. Feigenbaum and R.Ostrovsky, "A Note on One-Prover Instance-Hiding, Zero- Knowledge Proof Systems," Asiacrypt, '91.
    • Asiacrypt '91
    • Feigenbaum, J.1    Ostrovsky, R.2
  • 9
    • 84969340886 scopus 로고    scopus 로고
    • Interactive Bi-Proof Systems and Undeniable Signature Schemes
    • A. Fujioka, T. Okamoto, K. Oht.'i, "Interactive Bi-Proof Systems and Undeniable Signature Schemes," Eurocrypt '91, pp. 243-256
    • Eurocrypt '91 , pp. 243-256
    • Fujioka, A.1    Okamoto, T.2    Oht'i, K.3
  • 11
    • 0024611659 scopus 로고
    • The Knowledge Complexity of Interactive Proof Systems
    • Feb
    • S. Goldwasser, S, Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proof Systems," SIAM Journal on Computing, vol. 18, n. 1, Feb. 1989, pp. 186-208
    • (1989) SIAM Journal on Computing , vol.18 , Issue.1 , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 12
    • 0342829646 scopus 로고    scopus 로고
    • Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility
    • T. Okamoto and K. Ohta, "Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility," Eurocrypt '89, pp. 134-149
    • Eurocrypt '89 , pp. 134-149
    • Okamoto, T.1    Ohta, K.2
  • 13
    • 84957626847 scopus 로고    scopus 로고
    • Interactive Hashing Simplifies Zero Knowledge Protocol Design
    • R. Ostrovsky, R. Venkatesan, and M. Yung, "Interactive Hashing Simplifies Zero Knowledge Protocol Design," Eurocrypt '90.
    • Eurocrypt '90
    • Ostrovsky, R.1    Venkatesan, R.2    Yung, M.3
  • 14
    • 84876222959 scopus 로고    scopus 로고
    • Distributed Provers with Applications to Undeniable Signatures
    • T. Pedersen, "Distributed Provers with Applications to Undeniable Signatures," Eurocrypt '91, pp. 221-238
    • Eurocrypt '91 , pp. 221-238
    • Pedersen, T.1
  • 15
    • 0023568495 scopus 로고
    • Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information
    • M. Tompa and H. Woll, "Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information," Proceedings of the 28th FOCS, 1987, pp. 472-482
    • (1987) Proceedings of the 28th FOCS , pp. 472-482
    • Tompa, M.1    Woll, H.2
  • 16
    • 0022882770 scopus 로고
    • How to Generate and Exchange Secrets
    • A. Yao, "How to Generate and Exchange Secrets," Proceedings of the 27th FOCS, 1986, pp. 162-167
    • (1986) Proceedings of the 27th FOCS , pp. 162-167
    • Yao, A.1
  • 17
    • 0020312165 scopus 로고    scopus 로고
    • Protocols for Secure Computations
    • A. Yao, "Protocols for Secure Computations," FOCS '82, pp. 160-164
    • FOCS '82 , pp. 160-164
    • Yao, A.1


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