{
  "personId": "sl-1750",
  "uid": "SL-1750",
  "name": "沙菲·戈德瓦瑟",
  "version": "V2研究贡献账",
  "updatedAt": "2026-09-15",
  "formula": {
    "q": "Q = 10^(M/2) − 1",
    "light": "Lᵢ = aᵢ × Qᵢ",
    "total": "L = Σ Lᵢ",
    "score": "S = 2 × log₁₀(1 + L)"
  },
  "scopeNote": "本轮当前已列7项有限研究账；M与归功份额为可修订判断。未覆盖内容和未核清的负面作用不按零处理，具体缺口见逐项说明。",
  "exclusions": [
    {
      "id": "GOLDWASSER-MULTIPARTY-COMPUTATION-SPECIFIC-CONTRIBUTIONS",
      "title": "安全多方计算的具体原创贡献",
      "reason": "ICM摘要证明她系统讲述该领域，但不证明每种协议为其原创；待补具体论文和共同作者。"
    },
    {
      "id": "GOLDWASSER-ACADEMIC-LEADERSHIP",
      "title": "教学与机构领导",
      "reason": "职位不自动构成独立成果，尚缺具体课程或制度交付。"
    },
    {
      "id": "GOLDWASSER-POSTQUANTUM-AND-QUANTUM-CRYPTOGRAPHY",
      "title": "后期量子与后量子密码研究",
      "reason": "现有补充包未提供具体原论文、共同作者和独立终态，仍保留缺口。"
    }
  ],
  "items": [
    {
      "id": "OUT-SL1750-1982-1984-PROBABILISTIC-ENCRYPTION-SEMANTIC-SECURITY",
      "title": "概率加密与语义安全框架",
      "year": "1982–1984",
      "summary": "把安全从破解全部明文推进到对部分信息泄露的形式定义，并用随机化构造连接定义与证明。",
      "mReason": "是跨密码学广泛复用的基础定义与构造方法，接近信息论大锚但范围限计算安全。",
      "aReason": "沙菲·戈德瓦瑟 .37；西尔维奥·米卡利 .37；公钥密码与复杂性前史 .12；原始评审出版链 .05；未解析份额 .09。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://arxiv.org/abs/cs/0212055"
        },
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://www.simonsfoundation.org/people/shafrira-goldwasser/"
        },
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://doi.org/10.1145/800070.802212"
        }
      ],
      "missing": "概率加密原论文此次未重新逐页核读；伪随机函数等相邻成果仍需具体论文边界",
      "status": "缺证暂估",
      "overlapNote": "只计Goldwasser–Micali概率加密与语义安全定义；数字签名是不同认证终态，另点计算且只把共有复杂性方法作为前史。",
      "M": "6.7",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".37"
        },
        {
          "actor": "西尔维奥·米卡利",
          "actorId": "SL-1870",
          "type": "PERSON",
          "share": ".37"
        },
        {
          "actor": "公钥密码与复杂性前史",
          "actorId": "SHAFI-GOLDWASSER::PUBLIC-KEY-AND-COMPLEXITY-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".12"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".05"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-ENCRYPTION",
          "type": "UNALLOCATED",
          "share": ".09"
        }
      ],
      "share": "0.37",
      "exactLight": "827.9568212702856564233318154123246634716867171430073053841806965639856354238652946139556192116432749",
      "light": "827.956821",
      "standaloneScore": "5.84",
      "lightSharePercent": "27.3735"
    },
    {
      "id": "OUT-SL1750-1985-1989-INTERACTIVE-ZERO-KNOWLEDGE",
      "title": "交互证明与零知识证明系统",
      "year": "1985及正式扩展",
      "summary": "把“说服验证者”与“除真值外不泄露知识”形式化，并给出二次剩余相关实例。",
      "mReason": "概念和形式模型均具基础性，跨理论计算与密码学，故与概率加密同属高M方法。",
      "aReason": "沙菲·戈德瓦瑟 .27；西尔维奥·米卡利 .27；查尔斯·拉科夫 .27；证明复杂性与密码前史 .10；原始评审出版链 .04；未解析份额 .05。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/The_Knowledge_Complexity_Of_Interactive_Proof_Systems.pdf"
        },
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://arxiv.org/abs/cs/0212055"
        },
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://www.simonsfoundation.org/people/shafrira-goldwasser/"
        },
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://doi.org/10.1145/22145.22178"
        }
      ],
      "missing": "本次核读题名、作者、摘要及STOC书目；正式期刊扩展的全部定理未逐页复核；交互证明更早前史仍为集合预算",
      "status": "缺证暂估",
      "overlapNote": "计三人论文所定义和展示的交互/零知识证明终态；不领取区块链、身份系统或所有后续零知识协议。",
      "M": "6.8",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "西尔维奥·米卡利",
          "actorId": "SL-1870",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "查尔斯·拉科夫",
          "actorId": "EXT-NAME:CHARLES-RACKOFF",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "证明复杂性与密码前史",
          "actorId": "SHAFI-GOLDWASSER::PROOF-COMPLEXITY-AND-CRYPTO-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".10"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".04"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-ZK",
          "type": "UNALLOCATED",
          "share": ".05"
        }
      ],
      "share": "0.27",
      "exactLight": "677.9393365075866299929586583058183964227998872112683657435698736452256768853615532825397723970051789",
      "light": "677.939337",
      "standaloneScore": "5.66",
      "lightSharePercent": "22.4137"
    },
    {
      "id": "OUT-SL1750-1984-1988-ADAPTIVE-CHOSEN-MESSAGE-SECURE-SIGNATURES",
      "title": "自适应选择消息攻击安全的数字签名方案",
      "year": "1984初稿、1988期刊版",
      "summary": "将攻击者可自适应请求签名后的不可伪造性作为强安全边界，并给出基于明确计算假设的构造。",
      "mReason": "具有独立于保密加密的认证目标、强攻击模型和具体构造，覆盖广泛密码协议基础，但范围仍限计算安全。",
      "aReason": "沙菲·戈德瓦瑟 .27；西尔维奥·米卡利 .27；罗恩·里维斯特 .27；数字签名与公钥密码前史 .11；原始评审出版链 .04；未解析份额 .04。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://epubs.siam.org/doi/10.1137/0217017"
        }
      ],
      "missing": "本次实际读取SIAM完整书目和摘要，正文在付费墙后未读；不从“potentially practical”推定真实部署效果",
      "status": "缺证暂估",
      "overlapNote": "计三人提出能抵抗自适应选择消息攻击的数字签名安全目标、基于因子分解/无爪置换的方案和证明；不领取所有数字签名、PKI、互联网认证或部署收益。",
      "M": "6.4",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "西尔维奥·米卡利",
          "actorId": "SL-1870",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "罗恩·里维斯特",
          "actorId": "SL-1845",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "数字签名与公钥密码前史",
          "actorId": "SHAFI-GOLDWASSER::DIGITAL-SIGNATURE-AND-PUBLIC-KEY-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".11"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".04"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-SIGNATURE",
          "type": "UNALLOCATED",
          "share": ".04"
        }
      ],
      "share": "0.27",
      "exactLight": "427.6511619645006410045673708157068935827493761327605484454001393254973531904825746297547354384499819",
      "light": "427.651162",
      "standaloneScore": "5.26",
      "lightSharePercent": "14.1388"
    },
    {
      "id": "OUT-SL1750-2008-GKR-DELEGATED-COMPUTATION-INTERACTIVE-PROOFS",
      "title": "GKR可验证委托计算交互证明",
      "year": "2008",
      "summary": "把交互证明配置为客户端验证服务器计算，给出低于重算的验证与通信边界。",
      "mReason": "将早期交互证明转化为不同的委托验证终态，兼有理论模型与效率边界，范围广但不等同所有可验证计算。",
      "aReason": "沙菲·戈德瓦瑟 .27；雅埃尔·陶曼·卡莱 .27；盖伊·罗斯布卢姆 .27；交互证明、委托验证与电路前史 .11；原始评审出版链 .04；未解析份额 .04。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://www.microsoft.com/en-us/research/publication/delegating-computation-interactive-proofs-for-muggles/"
        }
      ],
      "missing": "实际读取官方书目与摘要，未逐节核验完整证明；不据渐近摘要推定工程可用性或部署",
      "status": "缺证暂估",
      "overlapNote": "计Goldwasser、Kalai、Rothblum 2008年让较弱客户端与服务器交互验证所委托计算正确性的协议及复杂度结论；不领取云服务、区块链、SNARK或后续GKR优化。",
      "M": "6.2",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "雅埃尔·陶曼·卡莱",
          "actorId": "EXT-NAME:YAEL-TAUMAN-KALAI",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "盖伊·罗斯布卢姆",
          "actorId": "EXT-NAME:GUY-ROTHBLUM",
          "type": "PERSON",
          "share": ".27"
        },
        {
          "actor": "交互证明、委托验证与电路前史",
          "actorId": "SHAFI-GOLDWASSER::INTERACTIVE-PROOF-DELEGATION-AND-CIRCUIT-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".11"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".04"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-GKR",
          "type": "UNALLOCATED",
          "share": ".04"
        }
      ],
      "share": "0.27",
      "exactLight": "339.6398611844251468144676087268661636452767005560713886591392152721948562612755465126837608945054659",
      "light": "339.639861",
      "standaloneScore": "5.06",
      "lightSharePercent": "11.2290"
    },
    {
      "id": "OUT-SL1750-1990S-PROPERTY-TESTING",
      "title": "性质测试模型与次线性检验方法",
      "year": "1990年代",
      "summary": "形式化无需读取全部输入即可判断对象是否具有或远离某性质的模型与算法。",
      "mReason": "模型抽象度高、跨图与函数等对象复用，达到重要计算方法量级。",
      "aReason": "沙菲·戈德瓦瑟 .30；奥德·戈德赖希 .30；达娜·朗 .30；随机算法与复杂性前史 .06；原始评审出版链 .02；未解析份额 .02。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://www.simonsfoundation.org/people/shafrira-goldwasser/"
        }
      ],
      "missing": "需补奠基论文题名、版本与具体性质实例；应用收益不回灌",
      "status": "缺证暂估",
      "overlapNote": "计三人建立的性质测试模型与代表性方法；不领取整个次线性算法领域的后续成果。",
      "M": "6.0",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".30"
        },
        {
          "actor": "奥德·戈德赖希",
          "actorId": "EXT-NAME:ODED-GOLDREICH",
          "type": "PERSON",
          "share": ".30"
        },
        {
          "actor": "达娜·朗",
          "actorId": "EXT-NAME:DANA-RON",
          "type": "PERSON",
          "share": ".30"
        },
        {
          "actor": "随机算法与复杂性前史",
          "actorId": "SHAFI-GOLDWASSER::RANDOMIZED-ALGORITHM-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".06"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".02"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-PROPERTY",
          "type": "UNALLOCATED",
          "share": ".02"
        }
      ],
      "share": "0.30",
      "exactLight": "299.70",
      "light": "299.700000",
      "standaloneScore": "4.96",
      "lightSharePercent": "9.9085"
    },
    {
      "id": "OUT-SL1750-1986-ELLIPTIC-CURVE-PRIMALITY-PROOFS",
      "title": "椭圆曲线素性证明方法",
      "year": "1986及后续",
      "summary": "以椭圆曲线构造可高效验证的素性证明路线。",
      "mReason": "方法有明确独立终态和算法价值，范围窄于密码学两大基础族。",
      "aReason": "沙菲·戈德瓦瑟 .40；乔·基利安 .40；素性判定与椭圆曲线前史 .12；原始评审出版链 .04；未解析份额 .04。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://www.simonsfoundation.org/people/shafrira-goldwasser/"
        }
      ],
      "missing": "需补原论文正文和算法复杂度条件；后续改进不纳入本预算",
      "status": "缺证暂估",
      "overlapNote": "只计Goldwasser–Kilian素性证明方法，不领取后续独立素性算法或椭圆曲线密码系统。",
      "M": "5.6",
      "budget": [
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".40"
        },
        {
          "actor": "乔·基利安",
          "actorId": "EXT-NAME:JOE-KILIAN",
          "type": "PERSON",
          "share": ".40"
        },
        {
          "actor": "素性判定与椭圆曲线前史",
          "actorId": "SHAFI-GOLDWASSER::PRIMALITY-AND-ELLIPTIC-CURVE-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".12"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".04"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-PRIMALITY",
          "type": "UNALLOCATED",
          "share": ".04"
        }
      ],
      "share": "0.40",
      "exactLight": "251.9829377920772997737440546489375458691781028752914898110918115333979773190747230291656270974609060",
      "light": "251.982938",
      "standaloneScore": "4.81",
      "lightSharePercent": "8.3309"
    },
    {
      "id": "OUT-SL1750-1988-MULTIPROVER-INTERACTIVE-PROOFS",
      "title": "1988年多证明者交互证明模型",
      "year": "1988",
      "summary": "把证明交互扩展到互不通信的多个证明者，使验证能力与复杂性结构出现新的可形式化边界。",
      "mReason": "模型改变证明系统的参与结构并有明确四人论文终态，属于重要复杂性方法；范围严格窄于整个PCP路线。",
      "aReason": "迈克尔·本-奥尔 .20；沙菲·戈德瓦瑟 .20；乔·基利安 .20；阿维·维格德森 .20；交互证明与复杂性前史 .12；原始评审出版链 .04；未解析份额 .04。对称份额是当前证据下的研究判断，不代表实际劳动完全相等。",
      "sources": [
        {
          "label": "原论文、作者目录与机构记录",
          "url": "https://people.csail.mit.edu/joanne/shafi-pubs.html"
        }
      ],
      "missing": "本次读取MIT作者出版目录，未取得论文摘要或正文，具体定理表述保持有界；不据目录声称整个PCP/近似困难性贡献",
      "status": "缺证暂估",
      "overlapNote": "只计Ben-Or、Goldwasser、Kilian、Wigderson 1988年多证明者交互证明论文的模型与定理；不领取后来的PCP定理、局部检查或近似困难性成果。",
      "M": "6.0",
      "budget": [
        {
          "actor": "迈克尔·本-奥尔",
          "actorId": "EXT-NAME:MICHAEL-BEN-OR",
          "type": "PERSON",
          "share": ".20"
        },
        {
          "actor": "沙菲·戈德瓦瑟",
          "actorId": "SL-1750",
          "type": "PERSON",
          "share": ".20"
        },
        {
          "actor": "乔·基利安",
          "actorId": "EXT-NAME:JOE-KILIAN",
          "type": "PERSON",
          "share": ".20"
        },
        {
          "actor": "阿维·维格德森",
          "actorId": "EXT-NAME:AVI-WIGDERSON",
          "type": "PERSON",
          "share": ".20"
        },
        {
          "actor": "交互证明与复杂性前史",
          "actorId": "SHAFI-GOLDWASSER::INTERACTIVE-PROOF-AND-COMPLEXITY-PREDECESSORS",
          "type": "PREDECESSOR_POOL",
          "share": ".12"
        },
        {
          "actor": "原始评审出版链",
          "actorId": "SHAFI-GOLDWASSER::ORIGINAL-REVIEW-AND-PUBLICATION-CHAIN",
          "type": "TEAM",
          "share": ".04"
        },
        {
          "actor": "未解析份额",
          "actorId": "SHAFI-GOLDWASSER::UNALLOCATED-SL1750-MULTIPROVER",
          "type": "UNALLOCATED",
          "share": ".04"
        }
      ],
      "share": "0.20",
      "exactLight": "199.80",
      "light": "199.800000",
      "standaloneScore": "4.61",
      "lightSharePercent": "6.6057"
    }
  ],
  "exactTotalLight": "3024.670118718875374009069507909653662991690783918399098043381736340301499080059692068099515039064808",
  "totalLight": "3024.670119",
  "exactScore": "6.961643152443907037764108071591914494023913303288671506135623914867956191722492422511863368214215824",
  "displayScore": "6.96",
  "provisionalCount": 7,
  "provenance": {
    "releaseId": "research-200-20260914",
    "baselineLedgerSha256": "8bdd406b3e20ae22357644499e622922c670ff11010df0478c70c23b38902108",
    "c24DeltaSha256": "b0b96144d1d3397e54a61c3d706ff2da5920fe7617e3bef50407149cb97d9d62",
    "generatorSha256": "25de659e9852503508e7c27d8a31773b8da5d6310531b1e3699d18cc94319929"
  },
  "priorScopeNote": "7项已列贡献的研究估分，含7项暂估。账本覆盖有限的主要成果，尚未穷尽生涯。M与归功份额是可修订的评估判断；未覆盖经历和负面影响不按零处理。",
  "rank": 19
}
