메뉴 건너뛰기




Volumn 1465, Issue , 1998, Pages 90-102

Secure group barter: Multi-party fair exchange with semi-trusted neutral parties

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC COMMERCE;

EID: 84958060645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055475     Document Type: Conference Paper
Times cited : (59)

References (16)
  • 5
    • 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 Proceedings of ACM STOC 1988, 1988.
    • (1988) Proceedings of ACM STOC 1988
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 10
    • 0023538330 scopus 로고
    • A practical scheme for non-interactive verifiable secret sharing
    • P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In IEEE Fondations of Computer Science, 1987.
    • (1987) IEEE Fondations of Computer Science
    • Feldman, P.1
  • 13
    • 84968367689 scopus 로고    scopus 로고
    • Making trust explicit in distributed commerce transactions
    • S. Ketchpel and H. Garcia-Molina. Making trust explicit in distributed commerce transactions. In IEEE ICDCS, 1996.
    • (1996) IEEE ICDCS
    • Ketchpel, S.1    Garcia-Molina, H.2
  • 14
    • 0020889143 scopus 로고
    • How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
    • M. Luby, S. Micali, and C. Rackoff. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In IEEE Symposium on Foundations of Computer Science, pages 11-21, November 1984.
    • (1984) IEEE Symposium on Foundations of Computer Science , pp. 11-21
    • Luby, M.1    Micali, S.2    Rackoff, C.3


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