메뉴 건너뛰기




Volumn 434 LNCS, Issue , 1990, Pages 150-154

Verifiable disclosure of secrets and applications

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 85032868401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46885-4_17     Document Type: Conference Paper
Times cited : (20)

References (11)
  • 2
    • 84910735846 scopus 로고
    • (revised versíon), Technical Report PM-R8710, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands
    • Brassard, Gilles, David Chaum, and Claude Crépeau. “Minimum disclosure proofs of knowledge” (revised versíon), Technical Report PM-R8710, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands, 1987.
    • (1987) Minimum Disclosure Proofs of Knowledge
    • Brassard, G.1    Chaum, D.2    Crépeau, C.3
  • 5
    • 85031785922 scopus 로고
    • Equivalence Between Two Flavours of Oblivious Transfer
    • Springer-Verlag
    • Crépeau Claude, “Equivalence Between Two Flavours of Oblivious Transfer”, Proceedings of Crypto 87, 1988, Springer-Verlag.
    • (1988) Proceedings of Crypto 87
    • Claude, C.1
  • 10
    • 0020889143 scopus 로고
    • How to Simultaneously Exchange a Secret Bit by flipping Assymetrically Biased coins
    • Micali, Silvio, Charles Rackoff, Mike Luby, “How to Simultaneously Exchange a Secret Bit by flipping Assymetrically Biased coins”, Proceedings of the 24th FOCS, IEEE, 1983, 11-21.
    • (1983) Proceedings of the 24Th FOCS, IEEE , pp. 11-21
    • Micali, S.1    Rackoff, C.2    Luby, M.3
  • 11
    • 0003462641 scopus 로고
    • Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University
    • Rabin, Michael, “How to exchange secrets by oblivious transfer,” Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
    • (1981) How to Exchange Secrets by Oblivious Transfer
    • Rabin, M.1


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