THE SPYMASTERS DOUBLE-AGENT PROBLEM - MULTIPARTY COMPUTATION SECURE UNCONDITIONALLY FROM MINORITIES AND CRYPTOGRAPHICALLY FROM MAJORITIES

被引：0
|
作者：
CHAUM, D
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 435卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：591 / 602
页数：12
相关论文
共 22 条
  • [21] Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
    Patra, Arpita
    Srinivasan, Akshayaram
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT II, 2021, 12826 : 185 - 213
  • [22] Multi-party computation from any linear secret sharing scheme unconditionally secure against adaptive adversary: The zero-error case
    Nikov, V
    Nikova, S
    Preneel, B
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2003, 2846 : 1 - 15
123