Shafi Goldwasser

Record year1982–1984

summaryIt advances security from cracking all plaintext to a formal definition of partial-information leakage, and uses randomized constructions to connect the definition with proofs.

M rationaleIt is a foundational definition and construction method widely reused across cryptography, approaching an information-theoretic major anchor while remaining limited to computational security.

attribution rationaleShafi Goldwasser .37; Silvio Micali .37; public-key cryptography and complexity prehistory .12; original review and publication chain .05; unresolved share .09. Symmetric shares are research judgments under current evidence and do not imply that the actual labor was fully equal.

overlap boundaryOnly the Goldwasser–Micali probabilistic-encryption and semantic-security definition is counted; digital signatures are a distinct completed authentication outcome, accounted for separately, and only the shared complexity methods are treated as prehistory.

Evidence gapsThe original probabilistic encryption paper was not re-read page by page this time; adjacent results such as pseudorandom functions still require specific paper boundaries.

Record year1985 and formal extension

summaryIt formalizes 'convincing the verifier' and 'revealing no knowledge beyond the truth value' and provides examples involving quadratic residuosity.

M rationaleBoth the concept and the formal model are foundational, spanning theoretical computation and cryptography; like probabilistic encryption, they therefore belong among the high-M methods.

attribution rationaleShafi Goldwasser .27; Silvio Micali .27; Charles Rackoff .27; proof complexity and cryptographic prehistory .10; original review and publication chain .04; unresolved share .05. Symmetric shares are research judgments under current evidence, not implying actual labor is fully equal.

overlap boundaryIt counts the specific completed outcome of interactive and zero-knowledge proofs as defined and demonstrated in the three-author paper; it does not claim blockchain, identity systems, or all subsequent zero-knowledge protocols.

Evidence gapsThis review covered the title, authors, abstract, and STOC bibliography; all theorems in the formal journal extension were not re-checked page by page; the earlier prehistory of interactive proofs remains in the aggregate budget.

Record year1984 draft, 1988 journal version

summaryIt treats unforgeability against an adversary who can adaptively request signatures as a strong security boundary and gives constructions based on explicit computational assumptions.

M rationaleIt has authentication goals independent of confidential encryption, a strong attack model, and concrete constructions, forming a foundation for a broad range of cryptographic protocols while remaining limited to computational security.

attribution rationaleShafi Goldwasser .27; Silvio Micali .27; Ron Rivest .27; prehistory of digital signatures and public-key cryptography .11; original review and publication chain .04; unresolved share .04. The symmetric shares are research judgments under current evidence and do not imply that the actual labor was fully equal.

overlap boundaryThe three are credited with proposing digital signature security goals resistant to adaptive chosen-message attacks, schemes and proofs based on factoring/trapdoor permutations; they do not claim all digital signatures, PKI, internet authentication, or deployment benefits.

Evidence gapsThis time actually read the full SIAM bibliography and abstract; the main text was behind a paywall and not read; do not infer actual deployment effectiveness from "potentially practical".

Record year2008

summaryIt configures the interactive proof so that a client verifies server computation, with verification and communication bounds lower than recomputation.

M rationaleIt transforms early interactive proofs into a distinct completed outcome for delegated verification, with both a theoretical model and efficiency bounds. Its scope is broad but does not extend to all verifiable computation.

attribution rationaleShafi Goldwasser .27; Yael Tauman Kalai .27; Guy Rothblum .27; interactive proofs, delegated verification, and circuit prehistory .11; original peer-reviewed publication chain .04; unresolved share .04. Symmetric shares are research judgments under current evidence and do not imply that the actual labor was fully equal.

overlap boundaryIt counts the 2008 Goldwasser–Kalai–Rothblum protocol and complexity conclusions for a weaker client interacting with a server to verify the correctness of delegated computation; it does not claim cloud services, blockchain, SNARKs, or subsequent GKR optimizations.

Evidence gapsThe official bibliography and abstract were actually read, but the complete proof was not verified section by section; engineering usability or deployment must not be inferred from the asymptotic summary.

Record year1990s

summaryIt formalizes models and algorithms for determining whether an object has, or is far from having, a property without reading the entire input.

M rationaleThe model is highly abstract and reusable across objects such as graphs and functions, placing it at the level of an important computational method.

attribution rationaleShafi Goldwasser .30; Oded Goldreich .30; Dana Ron .30; prehistory of randomized algorithms and complexity .06; original review-publication chain .02; unresolved share .02. The symmetric shares are research judgments under current evidence and do not represent that actual labor was exactly equal.

overlap boundaryCounts the property testing model and representative methods established by the three; does not claim subsequent results in the entire sublinear algorithms area.

Evidence gapsThe foundational paper titles, versions, and specific property instances still need to be supplied; application benefits do not flow back into this accounting.

Record year1986 and later

summaryIt uses elliptic curves to construct a route to efficiently verifiable primality proofs.

M rationaleThe method has a clear, independent completed outcome and algorithmic value, with a scope narrower than the two foundational families of cryptography.

attribution rationaleShafi Goldwasser .40; Joe Kilian .40; prehistory of primality determination and elliptic curves .12; original review-publication chain .04; unresolved share .04. The symmetric shares are research judgments under current evidence and do not represent that actual labor was exactly equal.

overlap boundaryCounts only the Goldwasser–Kilian primality proving method; does not claim subsequent independent primality algorithms or elliptic curve cryptosystems.

Evidence gapsThe original paper's main text and algorithmic-complexity conditions still need to be supplied; subsequent improvements are not included in this accounting.

Record year1988

summaryIt extends proof interaction to multiple provers who cannot communicate with one another, creating new formalizable boundaries for verification power and complexity structure.

M rationaleThe model changes the participation structure of proof systems and has a clear completed outcome in a four-author paper; it is an important complexity method, but its scope is strictly narrower than the entire PCP line.

attribution rationaleMichael Ben-Or .20; Shafi Goldwasser .20; Joe Kilian .20; Avi Wigderson .20; interactive proofs and complexity prehistory .12; original review-publication chain .04; unresolved share .04. Symmetric shares are a research judgment under current evidence, not representing actual labor equality.

overlap boundaryOnly the model and theorems of the 1988 multi-prover interactive proof paper by Ben-Or, Goldwasser, Kilian, and Wigderson are counted; later PCP theorems, local checking, or approximation hardness results are not claimed.

Evidence gapsThis reading used the MIT authors' publication directory; the paper abstract or main text was not obtained, so specific theorem statements remain bounded; no claim of entire PCP/approximation hardness contribution is made based on the directory.